Locating undesirable facilities on a network
Chih-Kang Eric Chen · 1981
This dissertation gives a systematic study of the problem of locating undesirable on a network, where the new can be located anywhere on the network. The undesirable are further divided into two classes, namely, the undesirable facilities and the 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.