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

R A Whitaker
Additional contact information
R A Whitaker: Central Statistics Bureau, Ministry of Industry and Small Business Development, Province of British Columbia, Victoria, BC V8V 1X4, Canada

Environment and Planning A, 1981, vol. 13, issue 6, 669-680

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.

Date: 1981
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/a130669 (text/html)

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

DOI: 10.1068/a130669

Access Statistics for this article

More articles in Environment and Planning A
Bibliographic data for series maintained by SAGE Publications ().