Least cost path algorithm design for highway route selection

Highway route design is a difficult process due to the complex structure of the environment. The topography and the natural geographical objects constitute an obstacle for highway constructions. On the other hand, the cost parameter and protecting the environment are main two issues which planners have to consider. Thus, the priorities of the highway routes should be decided according to the requirements and expectations. At this point, Least Cost Path Algorithm (LCPA) makes it possible to investigate least cost path for highway routes. This cost can be assigned as the cost of the constructions such as avoiding slope and swampy areas or an environmental object such as keeping the forests and not damaging to agricultural lands. When the cost parameter is decided, then LCPA can calculate the least cost path from origin point to destination. In this study, new highway routes are investigated for Konya city with economic, environmentally and hybrid approaches. The cost parameter and related surfaces are generated according to the highway construction requirements and then with LCPA, three different routes are calculated. The result maps are generated and the three approaches are compared for environmental and cost parameters.

___

  • Arentze, T. A. and Timmermans, H. J. P., 2000. ALBATROSS: A Learning-based Transportation Oriented Simulation System. EIRASS, Eindhoven University of Technology, The Netherlands.
  • Atkinson, D.M., 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.
  • Collischonn, W., Pilar, J.V., 2000. A directional dependent least-cost path algorithm for roads and canals. Int. J. Geogr. Inform. Sci. 14 (4), 397–406.
  • Dijkstra, E.W., 1959. A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271.
  • Douglas, D.H., 1994. Least cost path in GIS using an accumulated cost surface and slope lines. Cartographica 31 (3), 37–51.
  • Hassan, O., Effat, H., (2013). Designing and evaluation of three alternatives highway routes using the Analytical Hierarchy Process and the least –cost path analysis, application in Sinai Peninsula, Egypt. The Egyptian Journal of Remote Sensing and Space Sciences, 16, 141- 151.
  • Kara, F., Usul, N., 2012. Highway Route Design Through The Use Of GIS AndMulticriteria Analysıs: A Case Study Of Istanbul. Ozean Journal of Applied Sciences 5(1), 71-84.
  • Lee, J., Stucky, D., 1998. On applying viewshed analysis for determining least-cost paths on digital elevation models. Int. J. Geogr. Inform. Systems 12 (8), 891–905.
  • Nader, M, F., 2006. Computers and Communication Networks, Prentice Hall, ISBN-13: 978-0131389106.
  • Rees, W.G., 2004. Least cost paths in mountainous terrain. Computers & Geosciences, 30, 203-209. Saaty, T. L., 1977. A scaling method for priorities in hierarchical structures. Journal of Mathematical Psychology, 15, 234–281.
  • Saaty, T. L. 1980. The analytical hierarchy process. New York: Wiley. Saaty, T. L. 1994. Fundamentals of Decision Making and Priority Theory With The Analytical Hierarchy Process, RWS Publ. Pittsburg, ,s 69-84, 1994.
  • Saaty, T.L., Vargas, L.G., 1991. Prediction, Projection and Forecasting. Kluwer Academic Publishers, Dordrecht, 251 pp.
  • Stefanakis, E., Kavouras, M., 1995.On the determination of the optimum path in space. In: Proceedings of the European Conference on Spatial Information Theory, COSIT 95, Lecture Notes in Computer Science. Springer, Berlin.
  • URL 1, Turkish Statistical Institute Official website, http://www.tuik.gov.tr/Start.do , (Last visited 11.01.2016).
  • URL 2 Arcgis Help Center, http://desktop.arcgis.com/en/arcmap/10.3/tools/spatial- analyst-toolbox/how-the-cost-distance-tools- work.htm#ESRI_SECTION1_F6B0C27F739748A5BD6 C8E4BB651E453
  • URL 3 Arcgis Help Center, http://desktop.arcgis.com/en/arcmap/10.3/tools/spatial- analyst-toolbox/understanding-cost-distance- analysis.htm