Strategies for solving large location-allocation problems by heuristic methods
AbstractSolution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessmg 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by Pion Ltd, London in its journal Environment and Planning A.
Volume (Year): 24 (1992)
Issue (Month): 2 (February)
Contact details of provider:
Web page: http://www.pion.co.uk
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Carreras, Miquel & Serra, Daniel, 1999.
"On optimal location with threshold requirements,"
Socio-Economic Planning Sciences,
Elsevier, vol. 33(2), pages 91-103, June.
- Miquel Carreras & Daniel Serra, 1997. "On optimal location with treshold requirements," Economics Working Papers 220, Department of Economics and Business, Universitat Pompeu Fabra.
- Miquel Carreras & Daniel Serra, 1997. "On optimal location with treshold requirements," Working Papers, Research Center on Health and Economics 220, Department of Economics and Business, Universitat Pompeu Fabra.
- K.E. Rosing & C.S. ReVelle, 1997. "Heuristic Concentration and Tabu Search: A Nose to Nose Comparison," Tinbergen Institute Discussion Papers 97-058/3, Tinbergen Institute.
- Rosing, K. E. & ReVelle, C. S. & Rolland, E. & Schilling, D. A. & Current, J. R., 1998. "Heuristic concentration and Tabu search: A head to head comparison," European Journal of Operational Research, Elsevier, vol. 104(1), pages 93-99, January.
- Vladimir Marianov & Daniel Serra & Charles Revelle, 1997.
"Location of hubs in a competitive environment,"
Economics Working Papers
227, Department of Economics and Business, Universitat Pompeu Fabra.
- Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, vol. 97(1), pages 75-86, February.
- Rosing, K. E. & ReVelle, C. S. & Schilling, D. A., 1999. "A gamma heuristic for the p-median problem," European Journal of Operational Research, Elsevier, vol. 117(3), pages 522-532, September.
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.