Analysis and computational schemes for p-median heuristics
This paper is concerned with solution procedures for the p-median problem: the well-established heuristic of Teitz and Bail, 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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:pio:envira:v:28:y:1996:i:9:p:1699-1708. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond)
If references are entirely missing, you can add them using this form.