Skip to main content
SpringerLink
Log in

Minisum Location with Closest Euclidean Distances

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market areas. The objective is to find the location that minimizes the sum of weighted Euclidean distances to the closest points of the demand regions. It is assumed that internal distribution within the areas is “someone else's concern”. A number of properties of the problem are derived and algorithms for solving the problem are suggested.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Brimberg and R.F. Love, Global convergence of a generalized iterative procedure for the minisum location problem with ?p distances, Operations Research 41 (1993) 1153-1163.

    Google Scholar 

  2. J. Brimberg and G.O. Wesolowsky, Note: facility location with closest rectangular distances, Naval Research Logistics 47 (2000) 77-84.

    Google Scholar 

  3. J. Brimberg and G.O.Wesolowsky, Locating facilities by minimax relative to closest points of demand areas, Computers and Operations Research 29(6) (2002) 625-636.

    Google Scholar 

  4. D.J. Buchanan and G.O. Wesolowsky Locating a noxious facility with respect to several polygonal regions using asymmetric distances, IIE Transactions 25(1) (1993) 77-88.

    Google Scholar 

  5. Z. Drezner (ed.), Facility Location: A Survey of Applications and Methods (Springer, New York, 1995).

    Google Scholar 

  6. R.L. Francis, L.F. McGinnis Jr. and J.A. White, Facility Layout and Location: An Analytical Approach, 2nd ed., International Series in Industrial and Systems Engineering (Prentice-Hall, Englewood Cliffs, NJ, 1992).

    Google Scholar 

  7. H.W. Hamacher and S. Nickel, Restricted planar location problems and applications, Naval Research Logistics 42 (1995) 967-992.

    Google Scholar 

  8. F. Hausdorff, Grundzüge der Mengenlehre (1914), reprinted by the Chelsea Publishing Company, New York, 1949.

    Google Scholar 

  9. W. Kaplan, Advanced Calculus (Addison-Wesley, Reading, MA, 1959).

    Google Scholar 

  10. H.W. Kuhn, A note on Fermat's problem, Mathematical Programming 4 (1973) 98-107.

    Google Scholar 

  11. R.F. Love, J.G. Morris and G.O. Wesolowsky, Facilities Location: Models and Methods (North-Holland, New York, 1988).

    Google Scholar 

  12. J. Viegas and P. Hansen, Finding shortest paths in the presence of barriers to travel (for any ?p norm), European Journal of Operational Research 20 (1985) 373-381.

    Google Scholar 

  13. G.O. Wesolowsky and R.F. Love, Location of facilities with rectangular distances among point and area destinations, Naval Research Logistics Quarterly 18 (1971) 83-90.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Administration, University of Prince Edward Island Charlottetown, P.E.I, C1A 4P3

    J. Brimberg

  2. GERAD, 3000, Chemin de la Côte-Sainte-Catherine, Montréal, Québec, H3T 2A7, Canada

    J. Brimberg

  3. Management Science and Information Systems, MGD School of Business, McMaster University, Hamilton, Ontario, L8S 4M4, Canada

    G.O. Wesolowsky

Authors
  1. J. Brimberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G.O. Wesolowsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brimberg, J., Wesolowsky, G. Minisum Location with Closest Euclidean Distances. Annals of Operations Research 111, 151–165 (2002). https://doi.org/10.1023/A:1020901719463

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020901719463

Keywords

Search

Navigation