iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s10109-014-0197-8
Corridor location: the multi-gateway shortest path model | Journal of Geographical Systems Skip to main content
Springer Nature Link
Log in

Corridor location: the multi-gateway shortest path model

  • Original Article
  • Published:
Journal of Geographical Systems Aims and scope Submit manuscript

Abstract

The problem of corridor location can be found in a number of fields including power transmission, highways, and pipelines. It involves the placement of a corridor or rights-of-way that traverses a landscape starting at an origin and ending at a destination. Since most systems are subject to environmental review, it is important to generate competitive, but different alternatives. This paper addresses the problem of generating efficient, spatially different alternatives to the corridor location problem. We discuss the weaknesses in current models and propose a new approach which is designed to overcome many of these problems. We present an application of this model to a real landscape and compare the results to past work. Overall, the new model called the multi-gateway shortest path problem can generate a wide variety of efficient alignments, which eclipse what could be generated by past work.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Networks flows: theory, algorithms, and applications. Prentice Hall, NJ

    Google Scholar 

  • Aissi H, Chakhar S, Mousseau V (2012) GIS-based multicriteria evaluation approach for corridor siting. Environ Plan 39:287–307

    Article  Google Scholar 

  • Akgün V, Erkut E, Batta R (2000) On finding dissimilar paths. Eur J Oper Res 121:232–246

    Article  Google Scholar 

  • Antikainen H (2013) Comparison of different strategies for determining raster-based least-cost paths with a minimum amount of distortion. Trans GIS 17:96–108

    Article  Google Scholar 

  • Atkinson DM, Deadman P, Dudycha D, Traynor S (2005) Multi-criteria evaluation and least cost path analysis for an arctic all-weather road. Appl Geogr 25:287–307

    Article  Google Scholar 

  • Ayad H (1967) System evaluation by the simplified assignment technique. Ph.D. Thesis, Purdue University, USA

  • Bagli S, Geneletti D, Orsi F (2011) Routeing of power lines through least-cost path analysis and multicriteria evaluation to minimise environmental impacts. Environ Impact Assess Rev 31:234–239

    Article  Google Scholar 

  • Barnwell C (2001) “Problems and Concerns in determining an alternate route for the CSX railroad along the Gulf,” presented at a planning meeting of the Mississippi Department of Transportation, Jackson, MS

  • Brill ED (1979) The use of optimization models in public-sector planning. Manage Sci 25:413–422

    Article  Google Scholar 

  • Carlyle WM, Wood RK (2005) Near-shortest and k-shortest simple paths. Networks 46:98–109

    Article  Google Scholar 

  • Carotenuto P, Giordani S, Ricciardelli S (2007) Finding minimum and equitable risk routes for hazmat shipments. Comput Oper Res 34:1304–1327

    Article  Google Scholar 

  • Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest path algorithms: theory and experimental evaluation. Math Program 73:129–174

    Google Scholar 

  • Cowen DJ, Jensen JR, Hendrix C, Hodgson ME, Schill SR (2000) A GIS-assisted rail construction econometric model that incorporates LIDAR data. Photogramm Eng Remote Sens 66(11):1323–1328

    Google Scholar 

  • Dell’olmo P, Gentili M, Scozzari A (2005) On finding dissimilar pareto-optimal paths. Eur J Oper Res 162:70–82

    Article  Google Scholar 

  • Dial R (1969) Algorithm 360: shortest path forest with topological ordering. Commun ACM 12:623–633

    Article  Google Scholar 

  • Dijkstra E (1959) A note on two problems in connection with graphs. Numer Math 1:269–271

    Article  Google Scholar 

  • Douglas DH (1974) It makes me so CROSS. Harvard University Laboratory for Computer Graphics and Spatial Analysis, Internal memorandum. Reprinted in: 1984, Basic Readings in Geographic Information Systems, edited by D. Marble, H. Calkins and D. Peuquet

  • Economidies S (1977) Minimizing the environmental impact of territorial corridors: a case study. Interfaces 7:61–69

    Article  Google Scholar 

  • Eppstein D (1999) Finding the K shortest paths. SIAM J Comput 28:653–674

    Google Scholar 

  • Erkut E (1990) The discrete p-dispersion problem. Eur J Oper Res 40:48–60

    Article  Google Scholar 

  • Feldman SC, Pelletier RE, Walser E, Smoot JC, Ahl D (1995) A prototype for pipeline routing using remotely sensed data and geographic information system analysis. Remote Sens Environ 53:123–131

    Article  Google Scholar 

  • Goodchild M (1977) An evaluation of lattice solutions to the problem of corridor location. Environ Plan A 9:727–738

    Article  Google Scholar 

  • Guerriero F, Musmanno R, Lacagnina V, Pecorella A (2000) A class of label-correcting methods for the K shortest paths problem. Oper Res 49(3):423–429

    Article  Google Scholar 

  • Hobbs BF, Voelker AH (1978) Analytic multiobjective decision making techniques and power plant siting: a survey and critique. ORNL-5288 (special), Oak Ridge National Laboratory, Oak Ridge, TN

  • Hopkins L (1977) Methods for generating land suitability maps: a comparative evaluation. AIP J 43:386–400

    Google Scholar 

  • Huber DL (1980) Alternative methods in corridor routing. MA Thesis, Environmental Engineering Department, Univ. of Tennessee, Knoxville, TN

  • Huber DL, Church RL (1980) ENCORE: a test application of an environmental economic corridor location system to the MAGI database. Research series No. 37, Department of Civil Engineering, University of Tennessee, Knoxville, TN

  • Huber DL, Church RL (1985) Transmission corridor location modeling. J Transp Eng ASCE 111(2):114–130

    Article  Google Scholar 

  • Johnson PE, Joy DS, Clarke DB, Jacobi JM (1992) HIGHWAY 3.01, An enhanced highway routing model: Program, description, methodology, and revised user’s manual. ORNL/TM-12124, Oak Ridge National Laboratory, Oak Ridge, TN

  • Katoh N, Ibaraki T, Mine H (1982) An efficient algorithm for K shortest simple paths. Networks 4:411–427

    Article  Google Scholar 

  • Kuby MJ (1987) Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geogr Anal 19:315–329

    Article  Google Scholar 

  • Kuby M, Zhongyi X, Xiaodong X (1997) A minimax method for finding the k best “differentiated” paths. Geogr Anal 29(4):298–313

    Article  Google Scholar 

  • Lee BD, Tomlin CD (1997) Automate transportation corridor location: cartographic modeling makes it easy to determine a minimum-cost/impact alternative. GIS World (Jan.), 56–60

  • Ligmann-Zielinska A, Church RL, Jankowski P (2008) Spatial optimization as a generative technique for sustainable multiobjective land-use allocation. Int J Geogr Inf Sci 22:601–622

    Article  Google Scholar 

  • Lombard K, Church RL (1993) The gateway shortest path problem: generating alternative routes for a corridor location problem. Geogr Syst 1:25–45

    Google Scholar 

  • Luxen D, Vetter C (2011) Real-time routing with OpenStreetMap data. ACM SIGSPATIAL GIS ‘11, pp 513–516

  • Martin QW (1987) Optimal canal location using environmental mapping. J Water Resour Plann Manage 113(4):512–521

    Article  Google Scholar 

  • McHarg I (1969) Design with nature. Natural History Press, Philadelphia

    Google Scholar 

  • Mendoza GA, Bare BB, Campbell GE (1987) Multiobjective programming for generating alternatives: a multiple-use planning example. For Sci 33:458–468

    Google Scholar 

  • O’Rourke J (1998) Computational geometry in C, 2nd edn. University Press, Cambridge

    Book  Google Scholar 

  • Openshaw S (1983) The modifiable area unit problem. Concepts and techniques in modern geography 38, GeoBooks, Norwich, UK

  • Pinto N, Keitt TH (2009) Beyond the least-cost path: evaluating corridor redundancy using a graph-theoretic approach. Landsc Ecol 24:253–266

    Article  Google Scholar 

  • Rouphail NM, Ranjithan SR, El Dessouki W, Smith T, Brill ED (1995) A decision support system for dynamic pre-trip route planning. Application of advanced technologies in transportation engineering: proceedings of the 4th international conference, pp 325–329

  • Scott K, Pabón-Jiménez G, Bernstein D (1997) Finding alternatives to the best path. 76th Annual Meeting of the Transportation Research Board, Preprint 970682

  • Smart CW (1976) A computer-assisted technique for planning minimum optimum routing procedures for high voltage electric impact transmission right of way routes. Ph.D. Thesis, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA

  • Turner AK (1968) Computer-assisted procedures to generate and evaluate regional highway alternatives. Joint Highway Research Project, C-36-72A, Purdue University, Lafayette, IN

  • Turner AK (1978) A decade of experience in computer aided route selection. Photogramm Eng Remote Sens 14(12):1561–1576

    Google Scholar 

  • Turner AK (1979) Interactive and graphic techniques for computer aided route selection. Transp Res Rec 729:10–16

    Google Scholar 

Download references

Acknowledgments

We wish to acknowledge earlier support of the U.S.D.O.T. (Contract DTRS56-00-T-0002) and to acknowledge K. Thirumalai of the U.S.D.O.T for his support, advice, and encouragement during the earlier stages of this work. We wish also to thank our colleagues including Michael Goodchild and Val Noronha for their encouragement and suggestions. Finally, we wish to acknowledge the support of John Krummel and Argonne National Laboratory in supporting the development of a near shortest path algorithm which was used to generate Fig. 3.

Author information

Authors and Affiliations

  1. Kent Business School, University of Kent, Canterbury, UK

    Maria P. Scaparra

  2. Department of Geography, University of California at Santa Barbara, Santa Barbara, CA, 93106-4060, USA

    Richard L. Church & F. Antonio Medrano

Authors
  1. Maria P. Scaparra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard L. Church
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Antonio Medrano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Richard L. Church.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scaparra, M.P., Church, R.L. & Medrano, F.A. Corridor location: the multi-gateway shortest path model. J Geogr Syst 16, 287–309 (2014). https://doi.org/10.1007/s10109-014-0197-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10109-014-0197-8

Keywords

JEL Classification

Search

Navigation