Analysis and Computational Schemes for p-Median Heuristics

M Horn
Additional contact information
M Horn: CSIRO Division of Information Technology, GPO Box 664, Canberra, ACT 2601, Australia

Environment and Planning A, 1996, vol. 28, issue 9, 1699-1708

Abstract: This paper is concerned with solution procedures for the p -median problem: the well-established heuristic of Teitz and Bart, and the GRIA (Global/Regional Interchange Algorithm) technique developed more recently by Densham and Rushton. A computational scheme is presented which facilitates efficient implementations in both cases. The mathematical basis for the computational scheme is explained concisely by means of set-theory notation, and implementation of the Teitz—Bart heuristic is discussed with particular reference to search and storage considerations in large networks and in trees. In addition, it is shown that the two procedures in general do not terminate at solutions of equivalent local optimality.

Date: 1996
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/a281699 (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:28:y:1996:i:9:p:1699-1708

DOI: 10.1068/a281699

Access Statistics for this article

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