Abstract
As cities grow, their complexity and the complexity of their infrastructure for various applications increase. Especially, transportation design is usually a very cumbersome process in current urban development models, and it is becoming more complex. Traditional approaches are not always sufficient to solve such complex problems, therefore, design disciplines like architecture and urban design need new tools to optimize many parameters related to their design. An alternate way to solve this problem can be via finding shortest routes. In this context, this study aims to evaluate different shortest path algorithms within a methodological approach to urban transportation planning via either experimentation or mathematical modeling. Three methods; namely live slime mold plasmodium, Floyd–Warshall algorithm, and ant colony algorithm are used to design a template for routes within the historical Kadifekale district of Izmir, Turkey. The results from these approaches are compared, contrasted, and discussed in terms of their suitability for use as a guide for route creation. In conclusion, the parameters of an algorithm are significant on suggesting routes, thus the strengths and weaknesses of an algorithm should be carefully considered before application in a design problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Abbreviations
- \(D_{ij}\) :
-
The density of pheromone trace between \(i\) and \(j\)
- \(L_{ij}\) :
-
The length matrix of the edges
- \(A_{ij}\) :
-
The result matrix defining shortest paths
- \(p_{ij}^{k}\) :
-
The probability between node \(i\) and node \(j\)
- \(\Delta D_{ij}^{k}\) :
-
The increment of trail level of the edge connecting \(i\) and \(j\) by ant \(k\)
- \(\Delta D_{ij}\) :
-
The total increment of pheromone trace on the edge between \(i\) and \(j\)
- \(\eta_{ij}\) :
-
Visibility from \(i\) to \(j\)
- \(\alpha\) :
-
The parameter regulating the effect of \(D_{ij}\)
- \(\beta\) :
-
The parameter regulating the effect of \(\eta_{ij}\)
- \(Q\) :
-
The pheromone amount produced per tour by ant
- \(l_{k}\) :
-
The tour length of ant \(k\)
- \(k\) :
-
Number of ants
- \(\lambda\) :
-
Evaporation rate
- \(t\) :
-
Number of iterations
References
Aziz HA, Park BH, Morton A, Stewart RN, Hilliard M, Maness M (2018) A high resolution agent-based model to support walk-bicycle infrastructure investment decisions: a case study with New York city. Transp Res Part C Emerg Technol 86:280–299
Cubukcu E (2013) Walking for sustainable living. Procedia Soc Behav Sci 85:33–42
Matsumoto T, Tamaki H, Inamoto T (2010) Autonomous decentralized simulation model of city and urban traffic. In: Proceedings of SICE annual conference 2010, IEEE, pp 1021–1026
Pradhan A, Mahinthakumar G (2012) Finding all-pairs shortest path for a large-scale transportation network using parallel FW and parallel Dijkstra algorithms. J Comput Civ Eng 27(3):263–273
Tero A, Kobayashi R, Nakagaki T (2006) Physarum solver: a biologically inspired method of road-network navigation. Phys A Stat Mech Appl 363(1):115–119
Haoxiong Y, Yang H (2015) Congested traffic based on ant colony algorithm for shortest path algorithm. In: Logistics, informatics and service sciences (LISS), IEEE, pp 1–3
Adamatzky A, Akl S, Alonso-Sanz R, Van Dessel W, Ibrahim Z, Ilachinski A, Jones J, Kayem AV, Martínez GJ, De Oliveira P, Prokopenko M (2013) Are motorways rational from slime mould’s point of view? Int J Parallel Emergent Distrib Syst 28(3):230–248
McCormack GR, Rock M, Toohey AM, Hignell D (2010) Characteristics of urban parks associated with park use and physical activity: a review of qualitative research. Health Place 16(4):712–726
Gonzalez MC, Hidalgo CA, Barabasi AL (2008) Understanding individual human mobility patterns. Nature 453:779–782
Fatnassi E, Chaouachi J, Klibi W (2015) Planning and operating a shared goods and passengers on-demand rapid transit system for sustainable city-logistics. Transp Res Part B Methodological 81:440–460
Meng Q, Weng J (2011) An improved cellular automata model for heterogeneous work zone traffic. Transp Res Part C Emerg Technol 19(6):1263–1275
Kır S, Yazgan HR, Tüncel E (2017) A novel heuristic algorithm for capacitated vehicle routing problem. J Ind Eng Int 13(3):323–330
Pattnaik SB, Mohan S, Tom VM (1998) Urban bus transit route network design using genetic algorithm. J Transp Eng 124(4):368–375
Zhang X, Adamatzky A, Chan FT, Deng Y, Yang H, Yang XS, Mahadevan S (2015) A biologically inspired network design model. Scientific reports, 5
Adamatzky A (ed) (2016) Advances in physarum machines: sensing and computing with slime mould. Springer, Berlin
Altun A, Köktürk G, Özkaban F, Deniz Can İ, Tokuç A, Kale İ (2019) Physarum Polycephalum Cıvık Mantarları Kullanılarak Yol İzlerinin Bulunması: İzmir Örneği et al. Scientific report
Mączka M (2016) Accessibility model for the evaluation of transport infrastructure policy. Trans Inst Aviat 4(245):116–133
European Commission (2011) White paper, roadmap to a single European transport area—towards a competitive and resource efficient transport system. Retrieved from http://ec.europa.eu/transport/themes/strategies/2011_white_paper_en.htm. Accessed 1.05.2019
Sangaiah AK, Han M, Zhang S (2014) An investigation of Dijkstra and Floyd algorithms in national city traffic advisory procedures. Int J Comput Sci Mob Comput 3(2):124–138
Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66
Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Comput Intell Mag 1556–603X:28–39
Wang H, Wang Z, Yu L, Wang X, Liu C (2018) Ant colony optimization with improved potential field heuristic for robot path planning. In: Proceedings of the 37th Chinese control conference, July 25–27, Wuhan, China
Liu Z, Yawei K, Bin S (2016) An improved genetic algorithm based on the shortest path problem. In: 2016 IEEE international conference on information and automation (ICIA), pp 328–332
Ma S, Li X, Cai Y (2017) Delimiting the urban growth boundaries with a modified ant colony optimization model. Comput Environ Urban Syst 62:146–155
Musa R, Arnaout JP, Jung H (2010) Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Comput Ind Eng 59(1):85–92
Forcael E, González V, Orozco F, Vargas S, Pantoja A, Moscoso P (2014) Ant colony optimization model for tsunamis evacuation routes. Comput Aided Civ Infrastruct Eng 29(10):723–737
Afshar A, Massoumi F, Afshar A, Mariño MA (2015) State of the art review of ant colony optimization applications in water resource management. Water Resour Manage 29(11):3891–3904
Gomez JF, Khodr HM, De Oliveira PM, Ocque L, Yusta JM, Villasana R, Urdaneta AJ (2004) Ant colony system algorithm for the planning of primary distribution circuits. IEEE Trans Power Syst 19(2):996–1004
Mi N, Hou J, Mi W, Song N (2015) Optimal spatial land-use allocation for limited development ecological zones based on the geographic information system and a genetic ant colony algorithm. Int J Geogr Inf Sci 29(12):2174–2193
Kefayat M, Ara AL, Niaki SN (2015) A hybrid of ant colony optimization and artificial bee colony algorithm for probabilistic optimal placement and sizing of distributed energy resources. Energy Convers Manage 92:149–161
Zhang Z, Gao C, Liu Y, Qian T (2014) A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model. Bioinspiration Biomimetics 9(3):036006
Li D (2011) Shortest paths through a reinforced random walk. Uppsala University project report
Dokuz Eylul University, Faculty of Architecture (2015) Izmir-history project Anafartalar street 2nd stage and 1st circle pre-planning of housing pattern through operational plan final report, Izmir
Jones J (2015) From pattern formation to material computation: multi-agent modelling of physarum polycephalum. Springer Publishing, Berlin, ISBN 978-3-319-16823-4
Dorigo M, Stutzle T (2004) Ant colony optimization. MIT Press, Cambridge, MA
Söyler H, Keskintürk T (2007) Karinca Kolonisi Algoritmasi ile Gezen Satici Probleminin Çözümü. 8. Türkiye Ekonometri ve İstatistik Kongresi, 24–25 Mayıs 2007, İnönü Üniversitesi, Malatya
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Köktürk, G. et al. (2020). Experimental and Numerical Shortest Route Optimization in Generating a Design Template for a Recreation Area in Kadifekale. In: Dincer, I., Colpan, C., Ezan, M. (eds) Environmentally-Benign Energy Solutions. Green Energy and Technology. Springer, Cham. https://doi.org/10.1007/978-3-030-20637-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-20637-6_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20636-9
Online ISBN: 978-3-030-20637-6
eBook Packages: EnergyEnergy (R0)