A MORE EFFICIENT HEURISTIC FOR SOLVING LARGE P‐MEDIAN PROBLEMS

Paul J. Densham and Gerard Rushton

Papers in Regional Science, 1992, vol. 71, issue 3, 307-329

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.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1111/j.1435-5597.1992.tb01849.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:presci:v:71:y:1992:i:3:p:307-329

Access Statistics for this article

Papers in Regional Science is currently edited by Jouke van Dijk

More articles in Papers in Regional Science from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().