Skip to main content
Erschienen in: Natural Computing 4/2020

31.01.2019

A survey on traffic optimization problem using biologically inspired techniques

verfasst von: Sweta Srivastava, Sudip Kumar Sahana

Erschienen in: Natural Computing | Ausgabe 4/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Abdulaal M, LeBlanc L (1979) Continuous equilibrium network design models. Transp Res Part B 13:19–32MATH Abdulaal M, LeBlanc L (1979) Continuous equilibrium network design models. Transp Res Part B 13:19–32MATH
Zurück zum Zitat 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–264 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–264
Zurück zum Zitat 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–688 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–688
Zurück zum Zitat Babazadeh A, Poorzahedy H, Nikoosokhan S (2011) ‘Application of particle swarm optimization to transportation network design problem. J King Saud Univ—Sci 23:293–300 Babazadeh A, Poorzahedy H, Nikoosokhan S (2011) ‘Application of particle swarm optimization to transportation network design problem. J King Saud Univ—Sci 23:293–300
Zurück zum Zitat 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, USA 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, USA
Zurück zum Zitat Baskan O (2014a) An evaluation of heuristic methods for determining optimal link capacity expansions on road network. Int J Transp 2:77–94 Baskan O (2014a) An evaluation of heuristic methods for determining optimal link capacity expansions on road network. Int J Transp 2:77–94
Zurück zum Zitat Baskan O, Ceylan H (2014) Modified differential evaluation algorithm for the continuous network design problem. Procedia—Soc Behav Sci 111:48–57 Baskan O, Ceylan H (2014) Modified differential evaluation algorithm for the continuous network design problem. Procedia—Soc Behav Sci 111:48–57
Zurück zum Zitat 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–19 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–19
Zurück zum Zitat 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-2 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-2
Zurück zum Zitat 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-8 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-8
Zurück zum Zitat 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–1695MATH 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–1695MATH
Zurück zum Zitat Ceylan H (2006) Developing combined genetic algorithm–hill-climbing optimization method for area traffic control. J Trans Eng 132(8):663–671 Ceylan H (2006) Developing combined genetic algorithm–hill-climbing optimization method for area traffic control. J Trans Eng 132(8):663–671
Zurück zum Zitat Ceylan H (2013) Optimal design of signal controlled road networks using differential evaluation optimization algorithm. Math Probl Eng 2013:1–11MathSciNetMATH Ceylan H (2013) Optimal design of signal controlled road networks using differential evaluation optimization algorithm. Math Probl Eng 2013:1–11MathSciNetMATH
Zurück zum Zitat Ceylan H, Bell MGH (2004) Traffic signal timing optimisation based on genetic algorithm approach, including drivers’ routing. Trans Res Part B 38(4):329–342 Ceylan H, Bell MGH (2004) Traffic signal timing optimisation based on genetic algorithm approach, including drivers’ routing. Trans Res Part B 38(4):329–342
Zurück zum Zitat 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–167 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–167
Zurück zum Zitat Chen S, Chen R, Gao J (2017) ‘A monarch butterfly optimization for the dynamic vehicle routing problem. Algorithms 10(3):107MathSciNetMATH Chen S, Chen R, Gao J (2017) ‘A monarch butterfly optimization for the dynamic vehicle routing problem. Algorithms 10(3):107MathSciNetMATH
Zurück zum Zitat 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 X 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 X
Zurück zum Zitat Daganzo CF, Sheffi Y (1977) On stochastic models of traffic assignment. Transp Sci 11(3):253–274 Daganzo CF, Sheffi Y (1977) On stochastic models of traffic assignment. Transp Sci 11(3):253–274
Zurück zum Zitat 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–17 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–17
Zurück zum Zitat 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–678 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–678
Zurück zum Zitat 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–442MathSciNetMATH 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–442MathSciNetMATH
Zurück zum Zitat Dorigo M (1992) Optimization, learning and natural algorithms’, Ph.D. Thesis, Politecnico DI Milano, Italy Dorigo M (1992) Optimization, learning and natural algorithms’, Ph.D. Thesis, Politecnico DI Milano, Italy
Zurück zum Zitat Dorigo M, Stutzle T (2004) ‘Ant colony optimization-a bradford book’. The MIT Press, Cambridge, ISBN 0-262-04219-3 Dorigo M, Stutzle T (2004) ‘Ant colony optimization-a bradford book’. The MIT Press, Cambridge, ISBN 0-262-04219-3
Zurück zum Zitat 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–13 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–13
Zurück zum Zitat Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on, vol. 4, ISBN: 0-7803-2768-3 Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on, vol. 4, ISBN: 0-7803-2768-3
Zurück zum Zitat Elbeltagia E, Hegazyb T, Griersonb D (2004) Comparison among five evolutionary -based optimization algorithms. Adv Eng Inform 19(2005):43–53 Elbeltagia E, Hegazyb T, Griersonb D (2004) Comparison among five evolutionary -based optimization algorithms. Adv Eng Inform 19(2005):43–53
Zurück zum Zitat Farahani RZ, Miandoabchi E, Szeto WY, Rashidi H (2013) A review of urban transportation network design problems. Eur J Oper Res 229(2):281–302MathSciNetMATH Farahani RZ, Miandoabchi E, Szeto WY, Rashidi H (2013) A review of urban transportation network design problems. Eur J Oper Res 229(2):281–302MathSciNetMATH
Zurück zum Zitat 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–1634 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–1634
Zurück zum Zitat Fisk CS (1988) On combining maximum entropy trip matrix estimation with user assignment. Transp Res 22B:69–73MathSciNet Fisk CS (1988) On combining maximum entropy trip matrix estimation with user assignment. Transp Res 22B:69–73MathSciNet
Zurück zum Zitat Friesz TL (1985) Transportation network equilibrium, design and aggregation: key developments and research opportunities. Transp Res Part A 19(5–6):413–427 Friesz TL (1985) Transportation network equilibrium, design and aggregation: key developments and research opportunities. Transp Res Part A 19(5–6):413–427
Zurück zum Zitat 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–26MATH 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–26MATH
Zurück zum Zitat 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–283 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–283
Zurück zum Zitat Goldberg DE (2006) Genetic algorithms. Pearson Education India, Delhi, ISBN 817758829X, 9788177588293 Goldberg DE (2006) Genetic algorithms. Pearson Education India, Delhi, ISBN 817758829X, 9788177588293
Zurück zum Zitat Hirulkar P, Deshpande R, Bajaj P (2013) Optimization of traffic flow through signalized intersections using PSO. Int J Comput Sci Appl 3:434–437 Hirulkar P, Deshpande R, Bajaj P (2013) Optimization of traffic flow through signalized intersections using PSO. Int J Comput Sci Appl 3:434–437
Zurück zum Zitat Hu H (2009) A particle swarm optimization algorithm for bi-level programming models in urban traffic equilibrium network design. ICCTP 2009:1–7 Hu H (2009) A particle swarm optimization algorithm for bi-level programming models in urban traffic equilibrium network design. ICCTP 2009:1–7
Zurück zum Zitat 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–185 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–185
Zurück zum Zitat 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–664 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–664
Zurück zum Zitat Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687–697 Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687–697
Zurück zum Zitat 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-9 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-9
Zurück zum Zitat Koza JR (1992) Genetic programming- on the programming of computers by means of natural selection. MIT Press Edition, Cambridge. ISBN 0-262-11170-5MATH Koza JR (1992) Genetic programming- on the programming of computers by means of natural selection. MIT Press Edition, Cambridge. ISBN 0-262-11170-5MATH
Zurück zum Zitat LeBlanc LJ (1975) An algorithm for the discrete network design problem. Transp Sci 9:183–199 LeBlanc LJ (1975) An algorithm for the discrete network design problem. Transp Sci 9:183–199
Zurück zum Zitat 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/10 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/10
Zurück zum Zitat 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–215 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–215
Zurück zum Zitat Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1–55 Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1–55
Zurück zum Zitat Mathew TV, Shrama S (2009) Capacity expansion problem for large urban transportation networks. J Transp Eng 135(7):406–415 Mathew TV, Shrama S (2009) Capacity expansion problem for large urban transportation networks. J Transp Eng 135(7):406–415
Zurück zum Zitat Miandoabchi E, Farahani RZ (2010) Optimizing reserve capacity of urban road networks in a discrete network design problem. Adv Eng Softw 42(12):1041–1050MATH Miandoabchi E, Farahani RZ (2010) Optimizing reserve capacity of urban road networks in a discrete network design problem. Adv Eng Softw 42(12):1041–1050MATH
Zurück zum Zitat Migdalas A (1995) Bilevel programming in traffic planning: models, methods and challenge. J Glob Optim 7:381–405MathSciNetMATH Migdalas A (1995) Bilevel programming in traffic planning: models, methods and challenge. J Glob Optim 7:381–405MathSciNetMATH
Zurück zum Zitat 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-9 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-9
Zurück zum Zitat Poorzahedy H, Abulghasemi F (2005b) Application of ant system to network design problem. Transportation 32:251–273 Poorzahedy H, Abulghasemi F (2005b) Application of ant system to network design problem. Transportation 32:251–273
Zurück zum Zitat Poorzahedy H, Rouhani OM (2007a) Hybrid meta-heuristic algorithms for solving network design problem. Eur J Oper Res 182(2):578–596MathSciNetMATH Poorzahedy H, Rouhani OM (2007a) Hybrid meta-heuristic algorithms for solving network design problem. Eur J Oper Res 182(2):578–596MathSciNetMATH
Zurück zum Zitat Poorzahedy H, Rouhani OM (2007b) Hybrid meta-heuristic algorithms for solving network design problems. Eur J Oper Res 182:578–596MathSciNetMATH Poorzahedy H, Rouhani OM (2007b) Hybrid meta-heuristic algorithms for solving network design problems. Eur J Oper Res 182:578–596MathSciNetMATH
Zurück zum Zitat 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, https://doi.org/10.1007/978-81-322-2205-7_3 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, https://​doi.​org/​10.​1007/​978-81-322-2205-7_​3
Zurück zum Zitat Shefi Y (1985) ‘Urban transportation network: equilibrium analysis with mathematical programming method. Traffic engineering control, Prentice-Hall, ISBN 0-13-93-9729 Shefi Y (1985) ‘Urban transportation network: equilibrium analysis with mathematical programming method. Traffic engineering control, Prentice-Hall, ISBN 0-13-93-9729
Zurück zum Zitat 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-3736 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-3736
Zurück zum Zitat Simaan M, Cruz JB Jr (1973) On the Stackelberg strategy in nonzero-sum games. J Optim Theory Appl 11:533–555MathSciNetMATH Simaan M, Cruz JB Jr (1973) On the Stackelberg strategy in nonzero-sum games. J Optim Theory Appl 11:533–555MathSciNetMATH
Zurück zum Zitat Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin, ISBN10:354073189X, online ISBN 978-3-540-73190-0 Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin, ISBN10:354073189X, online ISBN 978-3-540-73190-0
Zurück zum Zitat Srivastava S, Sahana SK (2015) ‘ACONN—a multicast routing implementation. Comput Intell Data Min 2:133–141 Srivastava S, Sahana SK (2015) ‘ACONN—a multicast routing implementation. Comput Intell Data Min 2:133–141
Zurück zum Zitat Srivastava S, Sahana S (2016) Nested hybrid evolutionary model for traffic signal optimization. Applied intelligence. Springer, Berlin, pp 1–11 Srivastava S, Sahana S (2016) Nested hybrid evolutionary model for traffic signal optimization. Applied intelligence. Springer, Berlin, pp 1–11
Zurück zum Zitat 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–8 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–8
Zurück zum Zitat Storn and Price (1995) ‘Differential evaluation—a simple and efficient adaptive scheme for global optimization over continuous spaces’. J Glob Optim 23(1) Storn and Price (1995) ‘Differential evaluation—a simple and efficient adaptive scheme for global optimization over continuous spaces’. J Glob Optim 23(1)
Zurück zum Zitat Sun Z (2016) Continuous transportation network design problem based on bilevel programming model. Procedia Eng 137:277–282 Sun Z (2016) Continuous transportation network design problem based on bilevel programming model. Procedia Eng 137:277–282
Zurück zum Zitat Suwansirikul C, Friesz TL, Tobin RL (1987) Equilibrium decomposed optimisation: a heuristic for the continuous equilibrium network design problem. Transp Sci 21(4):254–263MATH Suwansirikul C, Friesz TL, Tobin RL (1987) Equilibrium decomposed optimisation: a heuristic for the continuous equilibrium network design problem. Transp Sci 21(4):254–263MATH
Zurück zum Zitat 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–2741 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–2741
Zurück zum Zitat 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–752 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–752
Zurück zum Zitat Wang G-G (2016a) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164 Wang G-G (2016a) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164
Zurück zum Zitat Wang G-G (2016b) ‘A new metaheuristic optimisation algorithm motivated by elephant herding behaviour. Int J Bio-Inspir Comput 8:394–409 Wang G-G (2016b) ‘A new metaheuristic optimisation algorithm motivated by elephant herding behaviour. Int J Bio-Inspir Comput 8:394–409
Zurück zum Zitat Wang J, Deng W (2018) Optimizing capacity of signalized road network with reversible lanes. Transport 33(1):1–11 Wang J, Deng W (2018) Optimizing capacity of signalized road network with reversible lanes. Transport 33(1):1–11
Zurück zum Zitat 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–871 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–871
Zurück zum Zitat 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–11MATH 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–11MATH
Zurück zum Zitat 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–2462MathSciNetMATH 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–2462MathSciNetMATH
Zurück zum Zitat 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–14 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–14
Zurück zum Zitat 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–1220 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–1220
Zurück zum Zitat Wang G-G, Deb S, Cui Z (2015) ‘Monarch butterfly optimization’ Neural Comput Appl, 1–20 Wang G-G, Deb S, Cui Z (2015) ‘Monarch butterfly optimization Neural Comput Appl, 1–20
Zurück zum Zitat 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–285 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–285
Zurück zum Zitat 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–1006 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–1006
Zurück zum Zitat 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–299 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–299
Zurück zum Zitat Wang G-G, Deb S, Zhao X, Cui Z (2016d) A new monarch butterfly optimization with an improved crossover operator. Oper Res 18:1–25 Wang G-G, Deb S, Zhao X, Cui Z (2016d) A new monarch butterfly optimization with an improved crossover operator. Oper Res 18:1–25
Zurück zum Zitat 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–22 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–22
Zurück zum Zitat Yu X, Gen M (2010) ‘Introduction to evolutionary algorithms’. Springer, London, ISBN 978-1-84996-128-8 Yu X, Gen M (2010) ‘Introduction to evolutionary algorithms’. Springer, London, ISBN 978-1-84996-128-8
Zurück zum Zitat 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–1328 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–1328
Zurück zum Zitat 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–74 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–74
Zurück zum Zitat Yang XS, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29(5):464–483 Yang XS, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29(5):464–483
Zurück zum Zitat Zhang H, Gao Z (2007) Two-way road network design problem with variable lanes. J Syst Sci Syst Eng 16(1):50–61 Zhang H, Gao Z (2007) Two-way road network design problem with variable lanes. J Syst Sci Syst Eng 16(1):50–61
Zurück zum Zitat Zhang J, Wang G (2012) Image matching using a bat algorithm with mutation. Appl Mech Mater 203:88–93 Zhang J, Wang G (2012) Image matching using a bat algorithm with mutation. Appl Mech Mater 203:88–93
Metadaten
Titel
A survey on traffic optimization problem using biologically inspired techniques
verfasst von
Sweta Srivastava
Sudip Kumar Sahana
Publikationsdatum
31.01.2019
Verlag
Springer Netherlands
Erschienen in
Natural Computing / Ausgabe 4/2020
Print ISSN: 1567-7818
Elektronische ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-019-09731-z

Weitere Artikel der Ausgabe 4/2020

Natural Computing 4/2020 Zur Ausgabe

EditorialNotes

Preface

Premium Partner