Strategies for Solving Large Location-Allocation Problems by Heuristic Methods

P J Densham and G Rushton
Additional contact information
P J Densham: National Center for Geographic Information and Analysis, and Department of Geography, State University of New York at Buffalo, Buffalo, NY 14261, USA
G Rushton: Department of Geography, San Diego State University, San Diego, CA 92182, USA

Environment and Planning A, 1992, vol. 24, issue 2, 289-304

Abstract: Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessing systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of location-allocation problems. The strategies used, preprocessing interpoint distance data as both candidate and demand strings, and use of them to update an allocation table, allow the solution of large problems (3000 nodes) in a microcomputer-based, interactive decisionmaking environment. Moreover, these strategies yield solution times which increase approximately linearly with problem size. Tests on four network problems validate these claims.

Date: 1992
References: View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/a240289 (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:24:y:1992:i:2:p:289-304

DOI: 10.1068/a240289

Access Statistics for this article

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