Locating undesirable facilities on a network
Date Issued
March 1, 1981
Author(s)
Chen, Chih-Kang Eric
Advisor(s)
Robert S. Garfinkel
Additional Advisor(s)
Thomas L. Bell
Robert A. McLean
Donald J. Wheeler
Abstract
This dissertation gives a systematic study of the problem of locating undesirable facilities on a network, where the new facilities can be located anywhere on the network. The undesirable facilities are further divided into two classes, namely, the "strictly undesirable facilities" and the "partially undesirable facilities." Models are developed for locating these two classes of facilities.
A new model which utilizes both the network shortest path distance measurement and Euclidean distance measurement is proposed for the partially undesirable facility location problems on a network. Two examples of this new model are examined and solved by an application of an interactive computer graphics technique.
The strictly undesirable facility location problem on a network is modeled with both median-type objective function and center-type objective function. Theoretical and computational results are given for both formulations.
Degree
Doctor of Philosophy
Major
Management Science
File(s)![Thumbnail Image]()
Name
Thesis81b.C435.pdf
Size
3.79 MB
Format
Unknown
Checksum (MD5)
adafba4addd8bf9af5b14eadb73524cb