IDEAS home Printed from https://ideas.repec.org/a/sae/envirb/v9y1982i2p119-129.html
   My bibliography  Save this article

Some Interchange Algorithms for Median Location Problems

Author

Listed:
  • R A Whitaker

    (Central Statistics Bureau, Ministry of Industry and Small Business Development, Province of British Columbia, Victoria, BC V8V 1X4, Canada)

Abstract

A number of interchange heuristics are described for solving p -median location problems. The robustness of these algorithms is extensively evaluated in terms of optimality and mean percentage errors. The best of the proposed heuristics generated optimal solutions to 307 of 319 median problems solved drawn from six data sets.

Suggested Citation

  • R A Whitaker, 1982. "Some Interchange Algorithms for Median Location Problems," Environment and Planning B, , vol. 9(2), pages 119-129, June.
    • Handle: RePEc:sae:envirb:v:9:y:1982:i:2:p:119-129
    DOI: 10.1068/b090119
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/b090119
    Download Restriction: no
    File URL: https://libkey.io/10.1068/b090119?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
    ---><---

    References listed on IDEAS

    as
    1. CORNUEJOLS, Gérard & FISHER, Marshall L. & NEMHAUSER, George L., 1977. "Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms," LIDAM Reprints CORE 292, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Basheer M. Khumawala, 1972. "An Efficient Branch and Bound Algorithm for the Warehouse Location Problem," Management Science, INFORMS, vol. 18(12), pages 718-731, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Lei, Ting L. & Church, Richard L., 2015. "On the unified dispersion problem: Efficient formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 241(3), pages 622-630.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kurt Jörnsten & Andreas Klose, 2016. "An improved Lagrangian relaxation and dual ascent approach to facility location problems," Computational Management Science, Springer, vol. 13(3), pages 317-348, July.
    2. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    3. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. R A Whitaker, 1981. "A Tight Bound Drop Exchange Algorithm for Solving the p Median Problem," Environment and Planning A, , vol. 13(6), pages 669-680, June.
    5. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    6. Fang Lu & John J. Hasenbein & David P. Morton, 2016. "Modeling and Optimization of a Spatial Detection System," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 512-526, August.
    7. Jeffrey D. Camm & Susan K. Norman & Stephen Polasky & Andrew R. Solow, 2002. "Nature Reserve Site Selection to Maximize Expected Species Covered," Operations Research, INFORMS, vol. 50(6), pages 946-955, December.
    8. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    9. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    10. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    11. García Cáceres, Rafael Guillermo & Aráoz Durand, Julián Arturo & Gómez, Fernando Palacios, 2009. "Integral analysis method - IAM," European Journal of Operational Research, Elsevier, vol. 192(3), pages 891-903, February.
    12. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    13. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    14. Heidari, Mehdi & Asadpour, Masoud & Faili, Hesham, 2015. "SMG: Fast scalable greedy algorithm for influence maximization in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 124-133.
    15. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    16. Melachrinoudis, Emanuel & Min, Hokey, 2000. "The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: A multiple objective approach," European Journal of Operational Research, Elsevier, vol. 123(1), pages 1-15, May.
    17. Fred Glover & Hanif Sherali, 2005. "Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints," Annals of Operations Research, Springer, vol. 140(1), pages 215-233, November.
    18. Mohammad Ehsanifar & David A. Wood & Arezoo Babaie, 2021. "UTASTAR method and its application in multi-criteria warehouse location selection," Operations Management Research, Springer, vol. 14(1), pages 202-215, June.
    19. Melachrinoudis, Emanuel & Min, Hokey, 2007. "Redesigning a warehouse network," European Journal of Operational Research, Elsevier, vol. 176(1), pages 210-229, January.
    20. Mauricio Resende & Renato Werneck, 2007. "A fast swap-based local search procedure for location problems," Annals of Operations Research, Springer, vol. 150(1), pages 205-230, March.

    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:sae:envirb:v:9:y:1982:i:2:p:119-129. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: SAGE Publications (email available below). General contact details of provider: .

    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.