An Efficient Algorithm for Solving the Rectilinear Location-Allocation Problem

G Babich
Additional contact information
G Babich: Department of Economic Statistics, University of Sydney, Sydney, NSW, Australia 2006

Environment and Planning A, 1978, vol. 10, issue 12, 1387-1395

Abstract: The rectilinear location-allocation problem may be solved analytically using familiar programming methods. However, the computational demands imposed by these techniques are often prohibitive. Cooper's Elimination—Alternate-Correction-Heuristic is modified to handle rectilinear distances. The algorithm seems to perform satisfactorily and is applied to the problem of locating fire-fighting appliances.

Date: 1978
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/a101387 (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:10:y:1978:i:12:p:1387-1395

DOI: 10.1068/a101387

Access Statistics for this article

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