Skip to main content
SpringerLink
Log in

Flow Shop Scheduling By Nature-Inspired Algorithms

  • Chapter
  • First Online:
Nature-Inspired Computation in Navigation and Routing Problems

Part of the book series: Springer Tracts in Nature-Inspired Computing ((STNIC))

  • 368 Accesses

Abstract

Flow shop scheduling is one of the widely handled problem types of operations research which generally seen in manufacturing and production environment addressed by several researchers. A wide variety of flow shop scheduling problems was presented with different objective purposes. Due to the complexity of the problem, many heuristics and metaheuristics were developed by the researchers to handle the problem. In this chapter, an extensive review of recently developed nature-inspired algorithms to solve the flow shop scheduling problems is given. We reviewed about 20 nature-inspired algorithms and their variants to solve the flow shop scheduling problems. More than 90 papers are reviewed in this chapter to describe different flow shop scheduling environment such as flow shop scheduling with sequence-dependent setup time, blocking, lot-streaming and no-wait flow shop are addressed. The future scope of nature-inspired algorithms is also addressed.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S (2018) A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener Comput Syst 85:129–145

    Article  Google Scholar 

  2. Anandaraman C (2011) An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems. Int J Ind Eng Computations 2(4):749–764

    Article  Google Scholar 

  3. Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm. Comput Struct 169:1–12

    Article  Google Scholar 

  4. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York

    Google Scholar 

  5. Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154–160

    Article  MATH  Google Scholar 

  6. Benkalai I, Rebaine D, Gagné C, Baptiste P (2017) Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times. Int J Prod Res 55(20):6145–6157

    Article  Google Scholar 

  7. Chakaravarthy GV, Marimuthu S, Ponnambalam SG, Kanagaraj G (2014) Improved sheep flock heredity algorithm and artificial bee colony algorithm for scheduling m-machine flow shops lot streaming with equal size sub-lot problems. Int J Prod Res 52(5):1509–1527

    Article  Google Scholar 

  8. Chakaravarthy GV, Marimuthu S, Sait AN (2012) Comparison of firefly algorithm and artificial immune system algorithm for lot streaming in m-machine flow shop scheduling. Int J Comput Intell Syst 5(6):1184–1199

    Article  Google Scholar 

  9. Chen CL, Huang SY, Tzeng YR, Chen CL (2014) A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem. Soft Comput 18(11):2271–2282

    Article  Google Scholar 

  10. Dasgupta P, Das S (2015) A discrete inter-species cuckoo search for flowshop scheduling problems. Comput Oper Res 60:111–120

    Article  MathSciNet  MATH  Google Scholar 

  11. Deb S, Tian Z, Fong S, Tang R, Wong R, Dey N (2018) Solving permutation flow-shop scheduling problem by rhinoceros search algorithm. Soft Comput 22(18):6025–6034

    Article  Google Scholar 

  12. Dorigo M, Di Caro G (1999) Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol 2, pp 1470–1477. IEEE

    Google Scholar 

  13. Duman E, Uysal M, Alkaya AF (2011) Migrating birds optimization: a new meta-heuristic approach and its application to the quadratic assignment problem. In: European conference on the applications of evolutionary computation. Springer, Berlin, Heidelberg, pp 254–263

    Chapter  Google Scholar 

  14. Eusuff MM, Lansey KE (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manage 129(3):210–225

    Article  Google Scholar 

  15. Gajpal Y, Rajendran C, Ziegler H (2006) An ant colony algorithm for scheduling in flow shops with sequence dependent setup of jobs. Int J Adv Manuf Technol 30(5):416–442

    Article  Google Scholar 

  16. Gao KZ, Suganthan PN, Chua TJ (2013) An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem. In: 2013 IEEE symposium on computational intelligence in scheduling (CISched). IEEE, pp 9–13

    Google Scholar 

  17. Gong D, Han Y, Sun J (2018) A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems. Knowl-Based Syst 148:115–130

    Article  Google Scholar 

  18. Han Y, Li J, Sang H, Tian T, Bao Y, Sun Q (2018) An improved discrete migrating birds optimization for lot-streaming flow shop scheduling problem with blocking. In: International conference on intelligent computing. Springer, Cham, pp 780–791

    Chapter  Google Scholar 

  19. Han YY, Gong D, Sun X (2015) A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking. Eng Optim 47(7):927–946

    Article  MathSciNet  Google Scholar 

  20. Jafarzadeh H, Moradinasab N, Gerami A (2017) Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete multi objective invasive weed optimization and fuzzy dominance approach. J Ind Eng Manage 10(5):887–918

    Google Scholar 

  21. Jarboui B, Ibrahim S, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving permutation flow shop problems. Comput Ind Eng 54(3):526–538

    Article  Google Scholar 

  22. Jeet K (2017) Fuzzy flow shop scheduling using grey wolf optimization algorithm. Indian J Sci Res 7(2):167–171

    Google Scholar 

  23. Johnson SM (1954) Optimal two and three stage production schedules with setup times included. Naval Res Logistics Q 1(1):61–68

    Article  MATH  Google Scholar 

  24. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks. IEEE Service Center, Piscataway, NJ, pp 1942–1948

    Google Scholar 

  25. Komaki GM, Kayvanfar V (2015) Grey wolf optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time. J Comput Sci 8:109–120

    Article  Google Scholar 

  26. Komaki GM, Teymourian E, Kayvanfar V, Booyavi Z (2017) Improved discrete cuckoo optimization algorithm for the three-stage assembly flowshop scheduling problem. Comput Ind Eng 105:158–173

    Article  Google Scholar 

  27. Lei D, Tan X (2016) Shuffled frog-leaping algorithm for order acceptance and scheduling in flow shop. In: 2016 35th Chinese control conference (CCC). IEEE, pp 9445–9450

    Google Scholar 

  28. Lei D, Guo X (2015) A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents. Expert Syst Appl 42(23):9333–9339

    Article  Google Scholar 

  29. Li X, Ma S (2016) Multi-objective memetic search algorithm for multi-objective permutation flow shop scheduling problem. IEEE Access 4:2154–2165

    Article  Google Scholar 

  30. Li X, Yin M (2013) A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem. Int J Prod Res 51(16):4732–4754

    Article  Google Scholar 

  31. Lian Z, Gu X, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Solitons Fractals 35(5):851–861

    Article  MATH  Google Scholar 

  32. Lian Z, Gu X, Jiao B (2006) A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Appl Math Comput 175(1):773–785

    MathSciNet  MATH  Google Scholar 

  33. Ling-Fang C, Ling W, Jing-jing W (2018) A two-stage memetic algorithm for distributed no-idle permutation flowshop scheduling problem. In: 2018 37th Chinese control conference (CCC). IEEE, pp 2278–2283

    Google Scholar 

  34. Liu YF, Liu SY (2013) A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl Soft Comput 13(3):1459–1463

    Article  Google Scholar 

  35. Lo HL, Fong S, Zhuang Y, Wang X, Hanne T (2015) Applying a chaos-based firefly algorithm to the permutation flow shop scheduling problem. In: 2015 3rd international symposium on computational and business intelligence (ISCBI). IEEE, pp 51–57

    Google Scholar 

  36. Marichelvam MK, Prabaharan T, Geetha M (2015) Firefly algorithm for flow shop optimization. In: Recent advances in swarm intelligence and evolutionary computation. Springer, Cham, pp 225–243

    Google Scholar 

  37. Marichelvam MK, Azhagurajan A, Geetha M (2017) A hybrid fruit fly optimisation algorithm to solve the flow shop scheduling problems with multi-objectives. Int J Adv Intell Paradigms 9(2–3):164–185

    Article  Google Scholar 

  38. Marichelvam MK, Geetha M (2018) A hybrid crow search algorithm to minimise the weighted sum of makespan and total flow time in a flow shop environment. Int J Comput Aided Eng Technol 10(6):636–649

    Article  Google Scholar 

  39. Marichelvam MK, Geetha M (2016) A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time. Int J Bio-Inspired Comput 8(5):318–325

    Article  Google Scholar 

  40. Marichelvam MK, Geetha M (2013) Solving flowshop scheduling problems using a discrete African wild dog algorithm. ICTACT J Soft Comput 3(3):555–559

    Article  Google Scholar 

  41. Marichelvam MK, Tosun Ö, Geetha M (2017) Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Appl Soft Comput 55:82–92

    Article  Google Scholar 

  42. Marichelvam MK (2012) An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems. Int J Bio-Inspired Comput 4(4):200–205

    Article  Google Scholar 

  43. Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1(4):355–366

    Article  Google Scholar 

  44. Meng T, Duan JH, Pan QK (2017) An enhanced migrating birds optimization for a lot-streaming flow shop scheduling problem. In: 2017 29th Chinese control and decision conference (CCDC). IEEE, pp 4687–4691

    Google Scholar 

  45. Meng T, Pan QK, Li JQ, Sang HY (2018) An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evol Comput 38:64–78

    Article  Google Scholar 

  46. Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67

    Article  Google Scholar 

  47. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Article  Google Scholar 

  48. Nara K, Takeyama T, Kim H (1999) A new evolutionary algorithm based on sheep flocks heredity model and its application to scheduling problem. In: IEEE SMC’99 conference proceedings. 1999 ieee international conference on systems, man, and cybernetics (Cat. No. 99CH37028), vol 6. IEEE, pp 503–508

    Google Scholar 

  49. Pan QK, Wang L, Gao L, Li J (2011) An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem. Int J Adv Manuf Technol 52(5–8):699–713

    Article  Google Scholar 

  50. Pan WT (2011) Fruit fly optimization algorithm. Tsang Hai Book Publishing Co., Taipei

    Google Scholar 

  51. Pan YX, Pan QK, Li JQ (2011) Shuffled frog-leaping algorithm for multi-objective no-wait flow-shop scheduling. Control Theor Appl 28(11):1363–1370

    MATH  Google Scholar 

  52. Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst Mag 22(3):52–67

    Article  MathSciNet  Google Scholar 

  53. Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, New Jersey

    MATH  Google Scholar 

  54. Qu C, Fu Y, Yi Z, Tan J (2018) Solutions to no-wait flow shop scheduling problem using the flower pollination algorithm based on the hormone modulation mechanism. Complexity

    Google Scholar 

  55. Rahimi-Vahed A, Dangchi M, Rafiei H, Salimi E (2009) A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. Int J Adv Manuf Technol 41(11–12):1227–1239

    Article  Google Scholar 

  56. Rahimi-Vahed AR, Mirghorbani SM (2007) A multi-objective particle swarm for a flow shop scheduling problem. J Comb Optim 13(1):79–102

    Article  MathSciNet  MATH  Google Scholar 

  57. Rajendran C, Ziegler H (2009) A multi-objective ant-colony algorithm for permutation flow shop scheduling to minimize the makespan and total flow time of jobs, chapter: computational intelligence in flow shop and job shop scheduling, vol 230. Springer, Berlin, pp 53–99

    Chapter  Google Scholar 

  58. Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155(2):426–438

    Article  MATH  Google Scholar 

  59. Rajendran C, Ziegler H (2005) Two ant colony algorithms for minimizing total flow time in permutation flow shops. Comput Ind Eng 48(4):789–797

    Article  Google Scholar 

  60. Ramya G, Chandrasekaran M (2014) An evolutionary sheep flock heredity model algorithm for minimizing manufacturing cost in job shop scheduling. Int J Adv Mech Automobile Eng 1(1):16–20

    Google Scholar 

  61. Ribas I, Companys R, Martorell XT (2015) An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flow time minimization. Expert Syst Appl 42(15):6155–6167

    Article  Google Scholar 

  62. Sang HY, Pan QK (2013) An effective invasive weed optimization algorithm for the flow shop scheduling with intermediate buffers. In: 2013 25th Chinese control and decision conference (CCDC). IEEE, pp 861–864

    Google Scholar 

  63. Sang HY, Duan PY, Li JQ (2016) A discrete invasive weed optimization algorithm for the no-wait lot-streaming flow shop scheduling problems. In: International conference on intelligent computing. Springer, Cham, pp 517–526

    Chapter  Google Scholar 

  64. Sang HY, Pan QK, Duan PY, Li JQ, Duan P (2017) A two-stage invasive weed optimization algorithm for distributed assembly permutation flowshop problem. In: 2017 Chinese automation congress (CAC). IEEE, pp 7051–7056

    Google Scholar 

  65. Sang HY, Pan QK, Duan PY, Li JQ (2018) An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems. J Intell Manuf 29(6):1337–1349

    Article  Google Scholar 

  66. Sang HY, Pan QK, Li JQ, Wang P, Han YY, Gao KZ, Duan P (2019) Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion. Swarm Evol Comput 44:64–73

    Article  Google Scholar 

  67. Sayadi M, Ramezanian R, Ghaffari-Nasab N (2010) A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. Int J Ind Eng Computat 1(1):1–10

    Google Scholar 

  68. Shao Z, Pi D, Shao W, Yuan P (2019) An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem. Eng Appl Artif Intell 78:124–141

    Article  Google Scholar 

  69. Shao Z, Pi D, Shao W (2018) A multi-objective discrete invasive weed optimization for multi-objective blocking flow-shop scheduling problem. Expert Syst Appl 113:77–99

    Article  Google Scholar 

  70. Shao Z, Pi D, Shao W (2018) A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 40:53–75

    Article  Google Scholar 

  71. Shao Z, Pi D, Shao W (2019) A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem. Knowl Based Syst 165:110–131

    Article  Google Scholar 

  72. Shivakumar BL, Amudha T (2013) Enhanced bacterial foraging algorithm for permutation flow shop scheduling problems. ARPN J Eng Appl Sci 8:129–136

    Google Scholar 

  73. Sioud A, Gagné C (2018) Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. Eur J Oper Res 264(1):66–73

    Article  MathSciNet  MATH  Google Scholar 

  74. Subramanian C, Sekar ASS, Subramanian K (2013) A new engineering optimization method: African wild dog algorithm. Int J Soft Comput 8(3):163–170

    Google Scholar 

  75. Sun Z, Gu X (2017) Hybrid algorithm based on an estimation of distribution algorithm and cuckoo search for the no idle permutation flow shop scheduling problem with the total tardiness criterion minimization. Sustainability 9(6):953

    Article  Google Scholar 

  76. Tasgetiren MF, Pan QK, Suganthan PN, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37(10–11):6758–6779

    Article  MathSciNet  MATH  Google Scholar 

  77. Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930–1947

    Article  MATH  Google Scholar 

  78. Tasgetiren MF, Pan QK, Suganthan PN, Chen AH (2011) A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf Sci 181(16):3459–3475

    Article  MathSciNet  Google Scholar 

  79. Tongur V, Ülker E (2014) Migrating birds optimization for flow shop sequencing problem. J Comput Commun 2(04):142

    Article  Google Scholar 

  80. Tosun Ö, Marichelvam MK (2016) Hybrid bat algorithm for flow shop scheduling problems. Int J Math Oper Res 9(1):125–138

    Article  MathSciNet  Google Scholar 

  81. Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297–4307

    Article  Google Scholar 

  82. Wang J, Wang L, Shen J (2016) A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE, pp 2240–2246

    Google Scholar 

  83. Xie J, Zhou Y, Tang Z (2013) Differential lévy-flights bat algorithm for minimization makespan in permutation flow shops. In: International conference on intelligent computing. Springer, Berlin, Heidelberg, pp 179–188

    Chapter  Google Scholar 

  84. Yagmahan B, Yenisey M (2010) A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst Appl 37(2):1361–1368

    Article  Google Scholar 

  85. Yagmahan B, Yenisey MM (2008) Ant colony optimization for multi-objective flow shop scheduling problem. Comput Ind Eng 54(3):411–420

    Article  Google Scholar 

  86. Yang XS (2010) A new metaheuristic bat-inspired algorithm. Nature inspired cooperative strategies for optimization (NICSO 2010). Springer, Berlin, Heidelberg, pp 65–74

    Chapter  Google Scholar 

  87. Yang XS (2012) Flower pollination algorithm for global optimization. In: International conference on unconventional computing and natural computation. Springer, Berlin, Heidelberg, pp 240–249

    Chapter  Google Scholar 

  88. Yang XS, Deb S (2009) Cuckoo search via Lévy flights. In: 2009 world congress on nature & biologically inspired computing (NaBIC). IEEE, pp 210–214

    Google Scholar 

  89. Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, UK

    Google Scholar 

  90. Yang Z, Liu C (2018) A hybrid multi-objective gray wolf optimization algorithm for a fuzzy blocking flow shop scheduling problem. Adv Mech Eng 10(3):1687814018765535

    Article  Google Scholar 

  91. Yun X, Feng X, Lyu X, Wang S, Liu B (2016) A novel water wave optimization based memetic algorithm for flow-shop scheduling. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE, pp 1971–1976

    Google Scholar 

  92. Zhao F, Liu Y, Shao Z, Jiang X, Zhang C, Wang J (2016) A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem. Int J Comput Integr Manuf 29(9):962–981

    Article  Google Scholar 

  93. Zhao RQ, Tang WS (2008) Monkey algorithm for global numerical optimization. J Uncertain Syst 2(3):165–176

    Google Scholar 

  94. Zheng YJ (2015) Water wave optimization: a new nature-inspired metaheuristic. Comput Oper Res 55:1–11

    Article  MathSciNet  MATH  Google Scholar 

  95. Zhou Y, Chen H, Zhou G (2014) Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing 137:285–292

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, 626005, India

    M. K. Marichelvam

  2. Department of Management Information Systems, Faculty of Applied Sciences, Akdeniz University, Antalya, Turkey

    Ömür Tosun

  3. Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, Tamil Nadu, 626001, India

    M. Geetha

Authors
  1. M. K. Marichelvam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ömür Tosun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Geetha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. K. Marichelvam .

Editor information

Editors and Affiliations

  1. School of Science and Technology, Middlesex University, London, UK

    Xin-She Yang

  2. College of Automation, Harbin Engineering University, Harbin, Heilongjiang, China

    Yu-Xin Zhao

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Marichelvam, M.K., Tosun, Ö., Geetha, M. (2020). Flow Shop Scheduling By Nature-Inspired Algorithms. In: Yang, XS., Zhao, YX. (eds) Nature-Inspired Computation in Navigation and Routing Problems. Springer Tracts in Nature-Inspired Computing. Springer, Singapore. https://doi.org/10.1007/978-981-15-1842-3_5

Download citation

Publish with us

Policies and ethics

Search

Navigation