IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v13y1981i6p669-680.html
   My bibliography  Save this article

A Tight Bound Drop Exchange Algorithm for Solving the p Median Problem

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 drop algorithm is proposed for solving the p median problem. In solving for a fixed value of p , tight bounds on all other median solutions in the range m − 1 to p + 1 are generated where m is the number of possible location sites and p is the number of medians. A step by step numerical example is described, and extensive computational experience is reported for some standard sets of tests problems in the literature. Comparisons with the well-known greedy interchange heuristic confirm the effectiveness of this drop approach in solving a significant number of difficult median problems.

Suggested Citation

  • 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.
    • Handle: RePEc:sae:envira:v:13:y:1981:i:6:p:669-680
    DOI: 10.1068/a130669
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a130669
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a130669?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. Bell, Michael G.H. & Fonzone, Achille & Polyzoni, Chrisanthi, 2014. "Depot location in degradable transport networks," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 148-161.

    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. 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.
    2. 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.
    3. 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.
    4. R A Whitaker, 1982. "Some Interchange Algorithms for Median Location Problems," Environment and Planning B, , vol. 9(2), pages 119-129, 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. 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).
    7. 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.
    8. 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.
    9. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    10. 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.
    11. 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.
    12. 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.
    13. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    14. Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
    15. Li‐Lian Gao & E. Powell Robinson, 1992. "A dual‐based optimization procedure for the two‐echelon uncapacitated facility location problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 191-212, March.
    16. Righini, Giovanni, 1995. "A double annealing algorithm for discrete location/allocation problems," European Journal of Operational Research, Elsevier, vol. 86(3), pages 452-468, November.
    17. Zohreh Hosseini Nodeh & Ali Babapour Azar & Rashed Khanjani Shiraz & Salman Khodayifar & Panos M. Pardalos, 2020. "Joint chance constrained shortest path problem with Copula theory," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 110-140, July.
    18. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    19. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    20. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.

    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:envira:v:13:y:1981:i:6:p:669-680. 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.