Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

An Evaluation of Lattice Solutions to the Problem of Corridor Location

Bibliographic Data

ID4140208
AuthorsMichael F Goodchild (0000-0003-1075-3471, Western University, corresponding author)
Year1977
Volume9
Issue7
Pages727-738
Publication date1977-07-01
Peer ReviewedYes
Open AccessYes
TypeARTICLE
VenueEnvironment and Planning A Economy and Space (JOURNAL)
Journal identifiersISSN: 0308-518X • E-ISSN: 1472-3409
PublisherSAGE Publications Inc (PUBLISHER)
DOI10.1068/a090727
OpenAlexW2077585566
LanguageEN
Citations received12
References cited5

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

Algorithm · Combinatorics · Geodesic · Geometry · Heuristic · Mathematical optimization · Physics · Reciprocal lattice · Shortest path problem · Statistics · Computational Geometry and Mesh Generation · Computer Science · Data Management and Algorithms · Geographic Information Systems Studies · Mathematics

  • Creating Buffers on Surfaces

    Xingong Li, Christopher M Larson et al.•Cartography and Geographic…•2005

  • Spatial Optimization Models

    Open Access•Richard L Church, Richard Church•International Encyclopedia of the…•2015

  • Does Time Smoothen Space? Implications for Space-Time Representation

    Open Access•Neil Sang•ISPRS International Journal of…•2023

  • A Voxel-Based Optimal Path Planning Method for UAV Navigation in Smart Cities

    Open Access•Min Jang, Dohee Kim et al.•ISPRS International Journal of…•2025

  • Accurate and Efficient Calculation of Three-Dimensional Cost Distance

    Open Access•Yaqian Chen, Jiangfeng She et al.•ISPRS International Journal of…•2020

  • Predicting the variability in pedestrian travel rates and times using crowdsourced GPS data

    Open Access•Michael J Campbell, Philip E Dennison et al.•Computers Environment and Urban…•2022

  • Beyond Tobler’s Hiking Function

    Open Access•Michael F Goodchild•Geographical Analysis•2020

  • Graph theory

    Open Access•Keith J Tinkler•Progress in Human Geography•1979

  • Representation and Spatial Analysis in Geographic Information Systems

    Hubert J Miller, Harvey J Miller et al.•Annals of the Association of…•2003

  • A Field-Based Theory for Time Geography

    Hubert J Miller, Harvey J Miller et al.•Annals of the Association of…•2009

  • Maximum unobstructed shortest path between multipart-continuous geometries

    Open Access•Jiwon Baik, Alan T Murray•Computers Environment and Urban…•2025

  • Geographic information system-based edge effect correction for Ripley'sK-function under irregular boundaries

    Open Access•Ying Ge, Mengdi Sun et al.•Geographical Research•2019

  • A note on two problems in connexion with graphs

    Open Access•E W Dijkstra, E Dijkstra•Numerische Mathematik•1959

  • The Law of Refraction in Transportation Geography

    Open Access•Christian Werner•Canadian Geographies /…•1968

Unique citing works12
Citations per year0,26
Citation span1979 - 2025 (47)
Citation velocityrecent
Highly citedNo
Citation typesNeutral: 11

Tools

Open DOISci-Hub
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae