An Evaluation of Lattice Solutions to the Problem of Corridor Location

M F Goodchild
Additional contact information
M F Goodchild: Department of Geography, The University of Western Ontario, London, Ontario, Canada

Environment and Planning A, 1977, vol. 9, issue 7, 727-738

Abstract: Many route-location problems can be regarded as the minimisation of some accumulated cost, impact, or similar friction per unit length. Analogies can be found with paths of light and other least-time paths, and with geodesics. The problem is often solved by finding a path through a lattice of sample costs, with the use of modified shortest-path algorithms. Lattice paths do not converge to continuous-space paths. The differences are shown to depend on the set of permitted moves in the lattice, with the use of three cases. The continuous-space problem is solved for surfaces described by simple functions and for choropleth surfaces, and compared with lattice solutions. Three heuristic approaches for large problems are reviewed, with emphasis placed on regular spatial aggregation.

Date: 1977
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/a090727 (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:9:y:1977:i:7:p:727-738

DOI: 10.1068/a090727

Access Statistics for this article

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