In this thesis, single undesirable and semi-desirable facility location problems are analyzed in a continuous planar region considering the interaction between the facility and the existing demand points. In both problems, the distance between the facility and the demand points is measured with the rectilinear metric. The aim in the first part where the location of a pure undesirable facility is considered, is to maximize the distance of the facility from the closest demand point. In the second part, where the location of a semi-desirable facility is considered, a conflicting objective measuring the service cost of the facility is added to the problem of the first part. For the solution of the first problem, a mixed integer programming model is used. In order to increase the solution efficiency of the model, new branch and bound strategies and bounding schemes are suggested. In addition, a geometrical method is presented which is based on upper and lower bounds. For the biobjective problem, a three-phase interactive geometrical branch and bound algorithm is suggested to find the most preferred efficient solution.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12605244/index.pdf |
| Date | 01 August 2004 |
| Creators | Nadirler, Deniz |
| Contributors | Karasakal, Esra |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0026 seconds