Article ID: | iaor1997471 |
Country: | United Kingdom |
Volume: | 47 |
Issue: | 3 |
Start Page Number: | 435 |
End Page Number: | 445 |
Publication Date: | Mar 1996 |
Journal: | Journal of the Operational Research Society |
Authors: | Ghosh Jay B. |
Keywords: | programming: dynamic, facilities |
The problem where a number of facilities need to be sited along a line is often encountered in practice. This paper considers the case where the objective is to achieve equity of service, accomplished by minimizing the maximum distance between two adjacent facilities. It also considers a stronger variation where the objective is not only to minimize the maximum distance, but also to hierarchically minimize the second maximum distance and so on. It then assumes that there is a cost for siting a facility at a given point, and considers bicriteria extensions where the objective is to simultaneously achieve cost efficiency and service equity. Only the first among these various cases has thus far been addressed in the literature. The paper provides simple and effective solutions for all of them (indicating where and how solutions can be obtained using available methods).