IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v6y1972i2p103-113.html
   My bibliography  Save this article

Rectangular Distance Location under the Minimax Optimality Criterion

Author

Listed:
  • George O. Wesolowsky

    (McMaster University, Hamilton, Ontario, Canada)

Abstract

Various versions of the Weber problem deal with the location of facilities in a system with fixed destinations or customers. The object is to minimize the sum of transportation costs, which is represented as the sum of the weighted distances in the system. This paper finds the optimum location for facilities where the object is to minimize the maximum weighted distance in the system. Rectangular distances, which are more appropriate for urban transportation than straight line distances, are used in the model. Optimization is achieved through parametric linear programming.

Suggested Citation

  • George O. Wesolowsky, 1972. "Rectangular Distance Location under the Minimax Optimality Criterion," Transportation Science, INFORMS, vol. 6(2), pages 103-113, May.
    • Handle: RePEc:inm:ortrsc:v:6:y:1972:i:2:p:103-113
    DOI: 10.1287/trsc.6.2.103
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.6.2.103
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.6.2.103?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. D K Kulshrestha & T W Sag, 1984. "Extensions of the k-Elliptic Optimization Approach and a Computer Method for Location Decision," Environment and Planning A, , vol. 16(9), pages 1181-1195, September.
    2. G Babich, 1978. "An Efficient Algorithm for Solving the Rectilinear Location-Allocation Problem," Environment and Planning A, , vol. 10(12), pages 1387-1395, December.
    3. Diaz-Banez, J. M. & Mesa, J. A. & Schobel, A., 2004. "Continuous location of dimensional structures," European Journal of Operational Research, Elsevier, vol. 152(1), pages 22-44, January.
    4. Noor-E-Alam, Md. & Mah, Andrew & Doucette, John, 2012. "Integer linear programming models for grid-based light post location problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 17-30.
    5. Nikolai Krivulin, 2017. "Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance," Computational Management Science, Springer, vol. 14(4), pages 493-518, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:6:y:1972:i:2:p:103-113. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.