A survey on traffic optimization problem using biologically inspired techniques

  • Sweta SrivastavaEmail author
  • Sudip Kumar Sahana


Nature is a great source of inspirations for solving complex computational problems. The inspirations can come from any source like some theory of physics or chemistry, a mathematical concept or from the biological world. Several biologically inspired techniques are implemented in various areas of research and development. These technologies can be grouped into two broad segments: Evolutionary and Swarm based depending on the nature of inspiration. This paper presents an overview of these biologically inspired techniques and its various implementations for traffic optimization with an objective to optimize congestion, minimize wait time, improve safety and reduce pollution.


Biological inspiration Genetic algorithm Genetic programming Ant colony optimization Differential evolution Particle swarm optimization Artificial bee colony Traffic optimization Network design problem 



  1. Abdulaal M, LeBlanc L (1979) Continuous equilibrium network design models. Transp Res Part B 13:19–32zbMATHGoogle Scholar
  2. Allsop RE, Charlesworth JA (1977) Traffic in a signal-controlled road network: an example of different signal timings including different routings. Traffic Eng Control 18(5):262–264Google Scholar
  3. Alves D, Jelmer V, Zhe C, De Schutter B, Babushka R (2010) Ant colony optimization for traffic dispersion routing. In: 13th international IEEE, annual conference on intelligent transportation systems 2013, pp 683–688Google Scholar
  4. Babazadeh A, Poorzahedy H, Nikoosokhan S (2011) ‘Application of particle swarm optimization to transportation network design problem. J King Saud Univ—Sci 23:293–300Google Scholar
  5. Barra1 A, Carvalho L, Teypaz N, Cung VD, Balassiano R (2007) Solving the transit network design problem with constraint programming. In: 11th world conference in transport research-WCTR. University of California, Berkeley, USAGoogle Scholar
  6. Baskan O (2014a) An evaluation of heuristic methods for determining optimal link capacity expansions on road network. Int J Transp 2:77–94Google Scholar
  7. Baskan O (2014b) ‘Harmony search algorithm for continuous network design problem with link capacity expansions. KSCE J Civ Eng 18(1):273–283. Google Scholar
  8. Baskan O, Ceylan H (2014) Modified differential evaluation algorithm for the continuous network design problem. Procedia—Soc Behav Sci 111:48–57Google Scholar
  9. Baskan O, Dell’Orco M (2012) Artificial bee colony algorithm for continuous network design problem with link capacity expansions. In: 10th international congress on advances in civil engineering, Middle East Technical University, Ankara, Turkey, pp17–19Google Scholar
  10. Baskan O, Haldenbilen S (2011) Ant colony optimization approach for optimizing traffic signal timings. In: Ant colony optimization-methods and application, InTech, pp 205–220, ISBN 978-953-307-157-2Google Scholar
  11. Baskan O, Haldenbilen S, Ceylan H, Ceylan H (2009) A new solution algorithm for improving performance of ant colony optimization. Appl Math Comput 211(1):75–84. MathSciNetzbMATHGoogle Scholar
  12. Bedi P et al. (2007) Avoiding traffic jam using ant colony optimization—a novel approach. In: International conference on computational intelligence and multimedia applications, 2007, vol 1, pp 61–67, ISBN:0-7695-3050-8Google Scholar
  13. Bhattacharjee K, Naskar N, Roy S, Das S (2018) A survey of cellular automata: types, dynamics, non-uniformity and applications’ natural computing. Springer, Netherlands. Google Scholar
  14. Cantarella GE, Pavone G, Vitetta A (2006) Heuristics for urban road network design: lane layout and signal settings. Eur J Oper Res 175(3):1682–1695zbMATHGoogle Scholar
  15. Ceylan H (2006) Developing combined genetic algorithm–hill-climbing optimization method for area traffic control. J Trans Eng 132(8):663–671Google Scholar
  16. Ceylan H (2013) Optimal design of signal controlled road networks using differential evaluation optimization algorithm. Math Probl Eng 2013:1–11MathSciNetzbMATHGoogle Scholar
  17. Ceylan H, Bell MGH (2004) Traffic signal timing optimisation based on genetic algorithm approach, including drivers’ routing. Trans Res Part B 38(4):329–342Google Scholar
  18. Ceylan H, Ceylan H (2012) A hybrid harmony search and TRANSYT hill climbing algorithm for signalized stochastic equilibrium transportation networks. Transp Res Part C 25:152–167Google Scholar
  19. Chen S, Chen R, Gao J (2017) ‘A monarch butterfly optimization for the dynamic vehicle routing problem. Algorithms 10(3):107MathSciNetzbMATHGoogle Scholar
  20. Creel ND, Maker MJ, Paechter B (1998) ‘The continuous equilibrium optimal network design problem: a genetic approach’ transportation network: recent methodological advances. In: Proceedings of the 4th Euro Transportation Meeting, ISBN:0 08 043052 XGoogle Scholar
  21. Daganzo CF, Sheffi Y (1977) On stochastic models of traffic assignment. Transp Sci 11(3):253–274Google Scholar
  22. Dantzig GB, Harvey RP, Lansdowne ZF, Robinson DW, Maier SF (1979) Formulating and solving the network design problem by decomposition. Transp Res Part B 13(1):5–17Google Scholar
  23. Dell’Orco M, Baskan Ö, Marinel M (2014) ‘Artificial bee colony-based algorithm for optimising traffic signal timings. Adv Intell Syst Comput, pp 327–337.
  24. Dimitriou L, Tsekeris T, Stathopoulos A (2008) ‘Genetic computation of road network design and pricing Stackelberg games with multi-class users. Applications of evolutionary computing of the series. Lecture Notes in Computer Science, vol 4974, pp 669–678Google Scholar
  25. Dinu S, Bordea G (2011) A new genetic approach for transport network design and optimization. Bull Pol Acad Sci Tech Sci 59(3):263–272. zbMATHGoogle Scholar
  26. Divsalar M, Hassanzadeh R, Mahdavi I, Shirazi B (2016) A stochastic user equilibrium assignment problem in discrete network design problem. Int J Oper Res 26(4):422–442MathSciNetzbMATHGoogle Scholar
  27. Dorigo M (1992) Optimization, learning and natural algorithms’, Ph.D. Thesis, Politecnico DI Milano, ItalyGoogle Scholar
  28. Dorigo M, Stutzle T (2004) ‘Ant colony optimization-a bradford book’. The MIT Press, Cambridge, ISBN 0-262-04219-3Google Scholar
  29. Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern- Part B 26(1):1–13Google Scholar
  30. Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on, vol. 4, ISBN: 0-7803-2768-3Google Scholar
  31. Elbeltagia E, Hegazyb T, Griersonb D (2004) Comparison among five evolutionary -based optimization algorithms. Adv Eng Inform 19(2005):43–53Google Scholar
  32. Farahani RZ, Miandoabchi E, Szeto WY, Rashidi H (2013) A review of urban transportation network design problems. Eur J Oper Res 229(2):281–302MathSciNetzbMATHGoogle Scholar
  33. Feng Y, Wang G-G, Deb S, Mei L, Zhao X-J (2017) Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28(7):1619–1634Google Scholar
  34. Fisk CS (1988) On combining maximum entropy trip matrix estimation with user assignment. Transp Res 22B:69–73MathSciNetGoogle Scholar
  35. Friesz TL (1985) Transportation network equilibrium, design and aggregation: key developments and research opportunities. Transp Res Part A 19(5–6):413–427Google Scholar
  36. Friesz TL, Cho HJ, Mehta NJ, Tobin RL, Anandalingam G (1992) A simulated annealing approach to the network design problem with variational inequality constraints. Transp Sci 26(1):18–26zbMATHGoogle Scholar
  37. Garcia Nieto J, Alba E, Olivera AC (2010) Swarm intelligence for traffic light scheduling: application to real urban area. Eng Appl Artif Intell 25:274–283Google Scholar
  38. Goldberg DE (2006) Genetic algorithms. Pearson Education India, Delhi, ISBN 817758829X, 9788177588293Google Scholar
  39. Hirulkar P, Deshpande R, Bajaj P (2013) Optimization of traffic flow through signalized intersections using PSO. Int J Comput Sci Appl 3:434–437Google Scholar
  40. Hu H (2009) A particle swarm optimization algorithm for bi-level programming models in urban traffic equilibrium network design. ICCTP 2009:1–7Google Scholar
  41. Hu W, Wang H, Yan L, B Du (2016) A swarm intelligent method for traffic light scheduling: application to real urban traffic networks. Appl Intell 44:208–231. Google Scholar
  42. Jintamuttha K, Watanapa B, Charoenkitkarn N (2016) ‘Dynamic traffic light timing optimization model using bat algorithm. In: 2nd international conference on control science and systems engineering, pp 181–185Google Scholar
  43. Kanoh H, Hara K (2008) Hybrid genetic algorithm for dynamic multi-objective route planning with predicted traffic in a real-world road network’. In: GECCO’08, Atlanta, Georgia, USA, pp 657–664Google Scholar
  44. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687–697Google Scholar
  45. Koh A (2007) Solving transportation Bi-level problem with differential evaluation. In: IEEE congress on evolutionary computing, pp 2243–2250, ISBN-978-1-4244-1340-9Google Scholar
  46. Koza JR (1992) Genetic programming- on the programming of computers by means of natural selection. MIT Press Edition, Cambridge. ISBN 0-262-11170-5zbMATHGoogle Scholar
  47. LeBlanc LJ (1975) An algorithm for the discrete network design problem. Transp Sci 9:183–199Google Scholar
  48. Liangzhi Z, Minai H (2010) Study on road network Bi-level programming under the traffic flow guidance. In: International conference on measuring technology and mechatronics automation. pp 631–634.
  49. Liangzhi Z, Lutao B, Liangzhi Z (2010) Model for road network equilibrium Bi-level programming based on rough genetic algorithm. Adv Comput Control (ICACC), pp 83–85, ISSN978-1-4244-5848-6/10Google Scholar
  50. Liu Q, Xu J (2012) ‘Traffic signal timing optimization for isolated intersections based on differential evaluation bacteria foraging algorithm’. In: Proceeding—social and behavioural sciences, 8th international conference on traffic and transportation studies, vol 43, pp 210–215Google Scholar
  51. Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1–55Google Scholar
  52. Mathew TV, Shrama S (2009) Capacity expansion problem for large urban transportation networks. J Transp Eng 135(7):406–415Google Scholar
  53. Miandoabchi E, Farahani RZ (2010) Optimizing reserve capacity of urban road networks in a discrete network design problem. Adv Eng Softw 42(12):1041–1050zbMATHGoogle Scholar
  54. Migdalas A (1995) Bilevel programming in traffic planning: models, methods and challenge. J Glob Optim 7:381–405MathSciNetzbMATHGoogle Scholar
  55. Montana DJ, Czerwinski S (1996) Evolving control laws for a network of traffic signals. In: Proceedings of the 1st annual conference on genetic programming. pp 333–338, ISBN:0-262-61127-9Google Scholar
  56. Poorzahedy H, Abulghasemi F (2005a) Application of ant system to network design problem. Transportation 32(3):251–273. Google Scholar
  57. Poorzahedy H, Abulghasemi F (2005b) Application of ant system to network design problem. Transportation 32:251–273Google Scholar
  58. Poorzahedy H, Rouhani OM (2007a) Hybrid meta-heuristic algorithms for solving network design problem. Eur J Oper Res 182(2):578–596MathSciNetzbMATHGoogle Scholar
  59. Poorzahedy H, Rouhani OM (2007b) Hybrid meta-heuristic algorithms for solving network design problems. Eur J Oper Res 182:578–596MathSciNetzbMATHGoogle Scholar
  60. Sahana SK, Kumar K (2014) ‘Hybrid synchronous discrete distance time model for traffic signal optimization’, In: Series smart innovation, systems and technologies, book computational intelligence in data mining, Springer India, vol 31, pp 23–33. Print: ISBN- 978-81-322-2204-0, Online: ISBN- 978-81-322-2205-7,
  61. Shefi Y (1985) ‘Urban transportation network: equilibrium analysis with mathematical programming method. Traffic engineering control, Prentice-Hall, ISBN 0-13-93-9729Google Scholar
  62. Shen-Pei Z, Xin-Ping Y (2009) ‘The fusion algorithm of genetic and ant colony and its application. In: Fifth international conference on natural computation, pp 76–80, 978-0-7695-3736Google Scholar
  63. Simaan M, Cruz JB Jr (1973) On the Stackelberg strategy in nonzero-sum games. J Optim Theory Appl 11:533–555MathSciNetzbMATHGoogle Scholar
  64. Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin, ISBN10:354073189X, online ISBN 978-3-540-73190-0Google Scholar
  65. Srivastava S, Sahana SK (2015) ‘ACONN—a multicast routing implementation. Comput Intell Data Min 2:133–141Google Scholar
  66. Srivastava S, Sahana S (2016) Nested hybrid evolutionary model for traffic signal optimization. Applied intelligence. Springer, Berlin, pp 1–11Google Scholar
  67. Srivastava Sweta, Sahana Sudip, Pant Durgesh, Mahanti Prabhat (2015) Hybrid synchronous discrete distance, time model for traffic signal optimization. J Next Gener Inf Technol 6:1–8Google Scholar
  68. Storn and Price (1995) ‘Differential evaluation—a simple and efficient adaptive scheme for global optimization over continuous spaces’. J Glob Optim 23(1)Google Scholar
  69. Sun Z (2016) Continuous transportation network design problem based on bilevel programming model. Procedia Eng 137:277–282Google Scholar
  70. Suwansirikul C, Friesz TL, Tobin RL (1987) Equilibrium decomposed optimisation: a heuristic for the continuous equilibrium network design problem. Transp Sci 21(4):254–263zbMATHGoogle Scholar
  71. Tianze X, Wei H, Wang Z-D (2009) Study on continuous network design problem using simulated annealing and genetic algorithm’. Expert Syst Appl 36:2735–2741Google Scholar
  72. Ukkusuri S, Kien Doan HM, Aziz A (2013) A Bi-level formulation for the combined dynamic equilibrium based traffic signal control. Procedia—Soc Behav Sci 80:729–752Google Scholar
  73. Wang G-G (2016a) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164Google Scholar
  74. Wang G-G (2016b) ‘A new metaheuristic optimisation algorithm motivated by elephant herding behaviour. Int J Bio-Inspir Comput 8:394–409Google Scholar
  75. Wang J, Deng W (2018) Optimizing capacity of signalized road network with reversible lanes. Transport 33(1):1–11Google Scholar
  76. Wang G-G, Guo L, Wang H, Duan H, Liu L, Li J (2012) ‘Incorporating mutation scheme into krill herd algorithm for global numerical optimization. Neural Comput Appl 24(3–4):853–871Google Scholar
  77. Wang G-G, Guo L, Gandomi AH, Alavi AH, Duan H (2013a) Simulated annealing-based krill herd algorithm for global optimization. Hindawi Publ Corp Abstr Appl Anal 2013:1–11zbMATHGoogle Scholar
  78. Wang G-G, Gandomi AH, Alavi AH (2013b) An effective krill herd algorithm with migration operator in biogeography-based optimization. Appl Math Model 38:2454–2462MathSciNetzbMATHGoogle Scholar
  79. Wang G, Guo L, Gandomi AH, Cao L, Alavi AH, Duan H, Li J (2013c) ‘Lévy-flight krill herd algorithm. Math Probl Eng 2013:1–14Google Scholar
  80. Wang G-G, Gandomi AH, Yang X-S, Alavi AH (2014) A novel improved accelerated particle swarm optimization algorithm for global numerical optimization. Eng Comput Int J Comput-Aided Eng Softw 31(7):1198–1220Google Scholar
  81. Wang G-G, Deb S, Cui Z (2015) ‘Monarch butterfly optimization Neural Comput Appl, 1–20Google Scholar
  82. Wang G-G, Gandomi AH, Zhao X, Chu HCE (2016a) ‘Hybridizing harmony search algorithm with cuckoo search for global numerical optimization. Soft Comput 20(1):273–285Google Scholar
  83. Wang G-G, Gandomi AH, Alavi AH, Deb S (2016b) A hybrid method based on krill herd and quantum-behaved particle swarm optimization. Neural Comput Appl 27(4):989–1006Google Scholar
  84. Wang G-G, Gandomi AH, Yang X-S, Alavi AH (2016c) A new hybrid method based on krill herd and cuckoo search for global optimisation tasks. Int J Bio-Inspir Comput 8(5):286–299Google Scholar
  85. Wang G-G, Deb S, Zhao X, Cui Z (2016d) A new monarch butterfly optimization with an improved crossover operator. Oper Res 18:1–25Google Scholar
  86. Wang G-G, Deb S, dos Coelho LS (2018) Earthworm optimization algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Int J Bio-Inspir Comput 12(1):1–22Google Scholar
  87. Yu X, Gen M (2010) ‘Introduction to evolutionary algorithms’. Springer, London, ISBN 978-1-84996-128-8Google Scholar
  88. Xu T, Wei H, Hu G (2009) Study on continuous network design problem using simulated annealing and genetic algorithm. Expert Syst Appl 36(2, Part 1):1322–1328Google Scholar
  89. Yang XS (2010) ‘A new metaheuristic bat-inspired algorithm. In: Gonzalez JR et al (eds) Nature inspired cooperative strategies for optimization’ (NISCO 2010), studies in computational intelligence, vol 284. Springer, Berlin, pp 65–74Google Scholar
  90. Yang XS, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29(5):464–483Google Scholar
  91. Zhang H, Gao Z (2007) Two-way road network design problem with variable lanes. J Syst Sci Syst Eng 16(1):50–61Google Scholar
  92. Zhang J, Wang G (2012) Image matching using a bat algorithm with mutation. Appl Mech Mater 203:88–93Google Scholar

Copyright information

© Springer Nature B.V. 2019

Authors and Affiliations

  1. 1.Department of CSEASET, Amity UniversityNoidaIndia
  2. 2.Department of CSEBIT MesraRanchiIndia

Personalised recommendations