IDEAS home Printed from https://ideas.repec.org/a/bla/presci/v71y1992i3p307-329.html
   My bibliography  Save this article

A More Efficient Heuristic For Solving Large P‐Median Problems

Author

Listed:
  • Paul J. Densham
  • Gerard Rushton

Abstract

ABSTRACT The Teitz and Bart (1968) vertex substitution heuristic is more robust than competing algorithms and yields solutions with properties that are necessary, but not sufficient, for a global optimum solution. All documented implementations of this algorithm, however, use a naive spatial search procedure, whereas a more informed spatial search procedure, requiring considerably less computation to solve any given problem, is possible. An algorithm incorporating this new search procedure, called the global/regional interchange algorithm, is described. As problem size increases, proportionally larger reductions in processing costs occur.

Suggested Citation

  • Paul J. Densham & Gerard Rushton, 1992. "A More Efficient Heuristic For Solving Large P‐Median Problems," Papers in Regional Science, Wiley Blackwell, vol. 71(3), pages 307-329, July.
    • Handle: RePEc:bla:presci:v:71:y:1992:i:3:p:307-329
    DOI: 10.1111/j.1435-5597.1992.tb01849.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1435-5597.1992.tb01849.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1435-5597.1992.tb01849.x?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. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    2. Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
    3. Andries M. Heyns & Robert Banick, 2024. "Optimisation of rural roads planning based on multi-modal travel: a multi-service accessibility study in Nepal’s remote Karnali Province," Transportation, Springer, vol. 51(2), pages 567-613, April.

    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:bla:presci:v:71:y:1992:i:3:p:307-329. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=1056-8190 .

    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.