UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Mathematical Programming Formulations of the Planar Facility Location Problem

dc.contributor.authorZvereva, Margarita
dc.date.accessioned2007-09-24T15:01:59Z
dc.date.available2007-09-24T15:01:59Z
dc.date.issued2007-09-24T15:01:59Z
dc.date.submitted2007
dc.description.abstractThe facility location problem is the task of optimally placing a given number of facilities in a certain subset of the plane. In this thesis, we present various mathematical programming formulations of the planar facility location problem, where potential facility locations are not specified. We first consider mixed-integer programming formulations of the planar facility locations problems with squared Euclidean and rectangular distance metrics to solve this problem to provable optimality. We also investigate a heuristic approach to solving the problem by extending the $K$-means clustering algorithm and formulating the facility location problem as a variant of a semidefinite programming problem, leading to a relaxation algorithm. We present computational results for the mixed-integer formulations, as well as compare the objective values resulting from the relaxation algorithm and the modified $K$-means heuristic. In addition, we briefly discuss some of the practical issues related to the facility location model under the continuous customer distribution.en
dc.identifier.urihttp://hdl.handle.net/10012/3283
dc.language.isoenen
dc.pendingfalseen
dc.publisherUniversity of Waterlooen
dc.subjectfacility locationen
dc.subjectsemidefinite programmingen
dc.subject.programCombinatorics and Optimizationen
dc.titleMathematical Programming Formulations of the Planar Facility Location Problemen
dc.typeMaster Thesisen
uws-etd.degreeMaster of Mathematicsen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
myThesis.pdf
Size:
482.22 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
261 B
Format:
Item-specific license agreed upon to submission
Description: