<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T18:53:01Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9400" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9400</identifier><datestamp>2017-03-21T14:42:37Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9910</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="a37951fe-1c9c-499f-b7a7-c2562f5de9c2" confidence="600">Qi, Michelle Bo</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-05-25T12:09:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-05-25T12:09:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-05-25</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015-05-21</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9400</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The Bin Packing Problem (BPP) is an important optimization problem with&#xd;
many applications. Given a set of items with a certain weight and a set of bins&#xd;
with fixed capacity, the classical BPP seeks to pack the items into the minimum&#xd;
number of bins. In this thesis a variant of the BPP, the Bin Packing Problem with&#xd;
Fragile Objects (BPPFO), is studied. The BPPFO originates in telecommunication&#xd;
systems where cellphone calls are assigned to towers based on the noise level of&#xd;
calls and the tolerance level of each call in the channel.In this case, the calls are&#xd;
represented as objects that are characterized by a weight and a fragility parameter.&#xd;
The fragility parameter corresponds to the noise tolerance level of each call, and the&#xd;
weight corresponds to the noise produced by a call. As calls are assigned, the total&#xd;
noise produced within a channel can not exceed the lowest tolerance level among&#xd;
the calls. The less the tolerance level, the more fragile the line becomes. Hence, the&#xd;
capacity of the bin depends on the smallest fragility of any item packed in it. In&#xd;
this thesis, two new formulations are proposed. The first is based on the classical&#xd;
BPP formulation to which a Lagrangian relaxation is applied. Several heuristics&#xd;
are developed to find upper bounds, including a greedy heuristic. The second is&#xd;
a graph-based formulation that is solved directly. A standard data set is used for&#xd;
testing. It is found that the new formulation based on the classical BPP is more&#xd;
efficient in getting a Lagrangian lower bound and the greedy heuristic outperforms&#xd;
other heuristics in finding good quality upper bounds in very short computational&#xd;
times, especially with very large data instances.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Operation Research</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Bin packing problem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Management Sciences</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">The Bin Packing Problem with Fragile Objects: Models and Solution Methods</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">The format of tables from page 39-53 are preferred to remain as is.</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Management Sciences</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Applied Science</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>