Advertisement

Annals of Operations Research

, Volume 123, Issue 1–4, pp 173–188 | Cite as

Efficient Location for a Semi-Obnoxious Facility

  • Yoshiaki Ohsawa
  • Kazuki Tamura
Article

Abstract

This paper deals with a location model for the placement of a semi-obnoxious facility in a continuous plane with the twin objectives of maximizing the distance to the nearest inhabitant and minimizing the sum of distances to all the users (or the distance to the farthest user) in a unified manner. For special cases, this formulation includes (1) elliptic maximin and rectangular minisum criteria problem, and (2) rectangular maximin and minimax criteria problem. Polynomial-time algorithms for finding the efficient set and the tradeoff curve are presented.

location semi-obnoxious facility efficient set tradeoff curve Voronoi diagram 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boissonnat, J.T. and M. Yvinec. (1998). Algorithmic Geometry. Cambridge: Cambridge University Press.Google Scholar
  2. Carrizosa, E. and F. Plastria. (1999). “Location of Semi-Obnoxious Facilities.” Studies in Locational Studies 12, 1–27.Google Scholar
  3. Daskin, M.S. (1995). Network and Discrete Location. New York: Wiley.Google Scholar
  4. Drezner, Z., J.-F. Thisse, and G.O. Wesolowsky. (1986). “The Minimax-Min Location Problem.” Journal of Regional Science 26, 87–101.Google Scholar
  5. Eiselt, H.A. and G. Laporte. (1995). “Objectives in Location Problems.” In Z. Drezner (ed.), Facility Location. New York: Springer, pp. 151–180.Google Scholar
  6. Elzinga, J. and D.W. Hearn. (1972). “Geometrical Solutions for SomeMinimax Location Problems.” Transportation Science 6, 379–394.Google Scholar
  7. Francis, R.L. and J.A. White. (1974). Facility Layout and Location. Englewood Cliffs: Prentice Hall.Google Scholar
  8. Karkazis, J. and C. Papadimitriou. (1992). “A Branch-and-Bound Algorithm for the Location of Facilities Causing Atmospheric Pollution.” European Journal of Operational Research 58, 363–373.Google Scholar
  9. Konfurty, Y. and A. Tamir. (1997). “The Single Facility Location Problem with Minimum Distance Constraints.” Location Science 5, 147–163.Google Scholar
  10. Lee, D. (1980). “Two-Dimensional Voronoi Diagrams in the Lp-Metric.” Journal of the Association for Computing Machinery 27, 604–618.Google Scholar
  11. Mehrez, A., Z. Sinuany-Stern, and A. Stulman. (1985). “A Single Facility Location Problem with a Weighted Maximin-Minimax Rectilinear Distance.” Computer and Operations Research 12, 51–60.Google Scholar
  12. Ohsawa, Y. (2000). “Bicriteria Euclidean Location Associated with Maximin and Minimax Criteria.” Naval Research Logistics 47, 581–592.Google Scholar
  13. Ohsawa, Y. and A. Imai. (1997). “Degree of Locational Freedom in a Single Facility Euclidean Minimax Location Problem.” Location Science 5, 29–45.Google Scholar
  14. Plastria, F. (1992). “On Destination Optimality in Asymmetric Distance Fermat–Weber Problems.” Annals of Operations Research 40, 355–369.Google Scholar
  15. Plastria, F. and E. Carrizosa. (1999). “Undesirable Facility Location with Minimal Covering Objectives.” European Journal of Operational Research 119, 158–180.Google Scholar
  16. Scheike, T.H. (1994). “Anisotropic Growth of Voronoi Cells.” Advances in Applied Probability 26, 43–53.Google Scholar
  17. Shamos, M.I. and D. Hoey. (1975). “Closest-Point Problems.” In Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, pp. 151–162.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Yoshiaki Ohsawa
    • 1
  • Kazuki Tamura
    • 2
  1. 1.Institute of Policy and Planning SciencesUniversity of TsukubaTsukubaJapan
  2. 2.Railway Technical Research InstituteKokubunjiJapan

Personalised recommendations