Skip to main content
Top
Published in: International Journal of Machine Learning and Cybernetics 4/2021

06-10-2020 | Original Article

A hybrid many-objective competitive swarm optimization algorithm for large-scale multirobot task allocation problem

Authors: Fei Xue, Tingting Dong, Siqing You, Yan Liu, Hengliang Tang, Lei Chen, Xi Yang, Juntao Li

Published in: International Journal of Machine Learning and Cybernetics | Issue 4/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Large-scale multi-robot task allocation (MRTA) problem is an important part of intelligent logistics scheduling. And the load capacity of robot and picking station are important factors affecting the MRTA problem. In this paper, the MRTA problem is built as a many-objective optimization model with four objectives, which takes the load capacity of single robot, single picking station, all robots and all picking stations into account. To solve the model, a hybrid many-objective competitive swarm optimization (HMaCSO) algorithm is designed. The novel selection method employing two different measurement mechanisms will form the mating selection operation. Then the population will be updated by employing the competitive swarm optimization strategy. Meanwhile, the environment selection will play a role in choosing the excellent solution. To prove the superiority of our approach, there are two series of experiments are carried out. On the one hand, our approach is compared with other five famous many-objective algorithms on benchmark problem. On the other hand, the involved algorithms are applied in solving large-scale MRTA problem. Simulation results prove that the performance of our approach is superior than other algorithms.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Show more products
Literature
1.
go back to reference Xue F, Tang HL, Su QH, Liu T (2019) Task allocation of intelligent warehouse picking system based on multi-robot coalition. KSII Trans Internet Inf Syst 13(7):3566–3582 Xue F, Tang HL, Su QH, Liu T (2019) Task allocation of intelligent warehouse picking system based on multi-robot coalition. KSII Trans Internet Inf Syst 13(7):3566–3582
2.
go back to reference Dai W, Lu HM, Xiao JH, Zheng ZQ (2019) Task allocation without communication based on incomplete information game theory for multi-robot systems. J Intell Robot Syst 94(3–4):841–856 Dai W, Lu HM, Xiao JH, Zheng ZQ (2019) Task allocation without communication based on incomplete information game theory for multi-robot systems. J Intell Robot Syst 94(3–4):841–856
3.
go back to reference Talebpour Z, Martinoli A (2019) Adaptive risk-based replanning for human-aware multi-robot task allocation with local perception. IEEE Robot Autom Lett 4(4):3844–3851 Talebpour Z, Martinoli A (2019) Adaptive risk-based replanning for human-aware multi-robot task allocation with local perception. IEEE Robot Autom Lett 4(4):3844–3851
4.
go back to reference Mitiche H, Boughaci D, Gini M (2019) Iterated local search for time-extended multi-robot task allocation with spatio-temporal and capacity constraints. J Intell Syst 28(2):347–360 Mitiche H, Boughaci D, Gini M (2019) Iterated local search for time-extended multi-robot task allocation with spatio-temporal and capacity constraints. J Intell Syst 28(2):347–360
5.
go back to reference Li JX, Moghaddam M, Nof SY (2016) Dynamic storage assignment with product affinity and ABC classification—a case study. Int J Adv Manuf Technol 84(9–12):2179–2194 Li JX, Moghaddam M, Nof SY (2016) Dynamic storage assignment with product affinity and ABC classification—a case study. Int J Adv Manuf Technol 84(9–12):2179–2194
6.
go back to reference Zhou X, Wang HM, Ding B, Hu TJ, Shang SN (2019) Balanced connected task allocations for multi-robot systems: an exact flow-based integer program and an approximate tree-based genetic algorithm. Expert Syst Appl 116:10–20 Zhou X, Wang HM, Ding B, Hu TJ, Shang SN (2019) Balanced connected task allocations for multi-robot systems: an exact flow-based integer program and an approximate tree-based genetic algorithm. Expert Syst Appl 116:10–20
7.
go back to reference Chen XY, Zhang P, Du GL, Li F (2019) A distributed method for dynamic multi-robot task allocation problems with critical time constraints. Robot Auton Syst 118:31–46 Chen XY, Zhang P, Du GL, Li F (2019) A distributed method for dynamic multi-robot task allocation problems with critical time constraints. Robot Auton Syst 118:31–46
8.
go back to reference Nagarajan T, Thondiyath A (2013) Heuristic based task allocation algorithm for multiple robots using agents. Proced Eng 64:844–853 Nagarajan T, Thondiyath A (2013) Heuristic based task allocation algorithm for multiple robots using agents. Proced Eng 64:844–853
9.
go back to reference Elango M, Nachiappan S, Tiwari MK (2011) Balancing task allocation in multi-robot systems using-means clustering and auction based mechanisms. Expert Syst Appl 38(6):6486–6491 Elango M, Nachiappan S, Tiwari MK (2011) Balancing task allocation in multi-robot systems using-means clustering and auction based mechanisms. Expert Syst Appl 38(6):6486–6491
11.
go back to reference Liu C, Kroll A (2015) Memetic algorithms for optimal task allocation in multi-robot systems for inspection problems with cooperative tasks. Soft Comput 19(3):567–584 Liu C, Kroll A (2015) Memetic algorithms for optimal task allocation in multi-robot systems for inspection problems with cooperative tasks. Soft Comput 19(3):567–584
12.
go back to reference Lamballais T, Roy D, De Koster MBM (2017) Estimating performance in a robotic mobile fulfillment system. Eur J Oper Res 256(3):976–990MATH Lamballais T, Roy D, De Koster MBM (2017) Estimating performance in a robotic mobile fulfillment system. Eur J Oper Res 256(3):976–990MATH
13.
go back to reference Chen JP, Wang JB, Xiao QJ, Chen CX (2018) A multi-robot task allocation method based on multi-objective optimization. In: International conference on control, automation, robotics and vision, 2018: pp 1868–1873 Chen JP, Wang JB, Xiao QJ, Chen CX (2018) A multi-robot task allocation method based on multi-objective optimization. In: International conference on control, automation, robotics and vision, 2018: pp 1868–1873
14.
go back to reference Cui ZH, Li FX, Zhang WS (2019) Bat algorithm with principal component analysis. Int J Mach Learn Cybern 10(3):603–622 Cui ZH, Li FX, Zhang WS (2019) Bat algorithm with principal component analysis. Int J Mach Learn Cybern 10(3):603–622
15.
go back to reference Cui ZH, Zhang MQ, Wang H, Cai XJ, Zhang WS (2019) A hybrid many-objective cuckoo search algorithm. Soft Comput 23(21):10681–10697 Cui ZH, Zhang MQ, Wang H, Cai XJ, Zhang WS (2019) A hybrid many-objective cuckoo search algorithm. Soft Comput 23(21):10681–10697
16.
go back to reference Cai XJ, Zhang JJ, Liang H, Wang L, Wu QD (2019) An ensemble bat algorithm for large-scale optimization. Int J Mach Learn Cybern 11(10):3099–3113 Cai XJ, Zhang JJ, Liang H, Wang L, Wu QD (2019) An ensemble bat algorithm for large-scale optimization. Int J Mach Learn Cybern 11(10):3099–3113
17.
go back to reference Lee DH (2018) Resource-based task allocation for multi-robot systems. Robot Auton Syst 103:151–161 Lee DH (2018) Resource-based task allocation for multi-robot systems. Robot Auton Syst 103:151–161
18.
go back to reference Jang I, Shin HS, Tsourdos A (2018) Anonymous hedonic game for task allocation in a large-scale multiple agent system. IEEE Trans RobOT 34(6):1534–1548 Jang I, Shin HS, Tsourdos A (2018) Anonymous hedonic game for task allocation in a large-scale multiple agent system. IEEE Trans RobOT 34(6):1534–1548
19.
go back to reference Ren L, Yu YY, Cao ZQ, Wu ZY, Yu JZ, Zhou C, Tan M (2018) An optimal task allocation approach for large-scale multiple robotic systems with hierarchical framework and resource constraints. IEEE Syst J 12(4):3877–3880 Ren L, Yu YY, Cao ZQ, Wu ZY, Yu JZ, Zhou C, Tan M (2018) An optimal task allocation approach for large-scale multiple robotic systems with hierarchical framework and resource constraints. IEEE Syst J 12(4):3877–3880
20.
go back to reference Nikitenko A, Lavendelis E, Ekmanis M, Rumba R (2018) Task allocation methods for homogeneous multi-robot systems: feed pushing case study. Autom Control Comput Sci 52(5):371–381 Nikitenko A, Lavendelis E, Ekmanis M, Rumba R (2018) Task allocation methods for homogeneous multi-robot systems: feed pushing case study. Autom Control Comput Sci 52(5):371–381
21.
go back to reference Brian P, Gerkey MJM (2004) A formal analysis and taxonomy of task allocation in multi-robot systems. Int J Robot Res 23(9):939–954 Brian P, Gerkey MJM (2004) A formal analysis and taxonomy of task allocation in multi-robot systems. Int J Robot Res 23(9):939–954
22.
go back to reference Cai XJ, Wang PH, Du L, Cui ZH, Zhang WS, Chen JJ (2019) Multi-objective 3-dimensional DV-hop localization algorithm with NSGA-II. IEEE Sens J 19(21):10003–10015 Cai XJ, Wang PH, Du L, Cui ZH, Zhang WS, Chen JJ (2019) Multi-objective 3-dimensional DV-hop localization algorithm with NSGA-II. IEEE Sens J 19(21):10003–10015
23.
go back to reference Cui ZH, Du L, Wang PH, Cai XJ, Zhang WS (2019) Malicious code detection based on CNNs and multi-objective algorithm. J Parallel Distrib Comput 129:50–58 Cui ZH, Du L, Wang PH, Cai XJ, Zhang WS (2019) Malicious code detection based on CNNs and multi-objective algorithm. J Parallel Distrib Comput 129:50–58
25.
go back to reference Luo LZ, Chakraborty N, Sycara K (2015) Distributed algorithms for multirobot task assignment with task deadline constraints. IEEE Trans Autom Sci Eng 12(3):876–888 Luo LZ, Chakraborty N, Sycara K (2015) Distributed algorithms for multirobot task assignment with task deadline constraints. IEEE Trans Autom Sci Eng 12(3):876–888
27.
go back to reference Yang SX, Li MQ, Liu XH, Zheng JH (2013) A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 17(5):721–736 Yang SX, Li MQ, Liu XH, Zheng JH (2013) A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 17(5):721–736
28.
go back to reference Li MQ, Yang SX, Liu XH (2014) Shift-based density estimation for pareto-based algorithms in many-objective optimization. IEEE Trans Evol Comput 18(3):348–365 Li MQ, Yang SX, Liu XH (2014) Shift-based density estimation for pareto-based algorithms in many-objective optimization. IEEE Trans Evol Comput 18(3):348–365
29.
go back to reference Cui ZH, Chang Y, Zhang JJ, Cai XJ, Zhang WS (2019) Improved NSGA-III with selection-and-elimination operator. Swarm Evol Comput 49:23–33 Cui ZH, Chang Y, Zhang JJ, Cai XJ, Zhang WS (2019) Improved NSGA-III with selection-and-elimination operator. Swarm Evol Comput 49:23–33
30.
go back to reference Xiang Y, Zhou Y, Li M, Chen Z (2017) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evol Comput 21(1):131–152 Xiang Y, Zhou Y, Li M, Chen Z (2017) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evol Comput 21(1):131–152
31.
go back to reference Cheng R, Jin YC, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773–791 Cheng R, Jin YC, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773–791
32.
go back to reference Liu HL, Gu FQ, Zhang QF (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans Evol Comput 18(3):450–455 Liu HL, Gu FQ, Zhang QF (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans Evol Comput 18(3):450–455
33.
go back to reference Cai XY, Mei ZM, Fan Z (2018) A Decomposition-based many-objective evolutionary algorithm with two types of adjustments for direction vectors. IEEE Trans Cybern 48(8):2335–2348 Cai XY, Mei ZM, Fan Z (2018) A Decomposition-based many-objective evolutionary algorithm with two types of adjustments for direction vectors. IEEE Trans Cybern 48(8):2335–2348
34.
go back to reference Li K, Deb K, Zhang QF (2015) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694–716 Li K, Deb K, Zhang QF (2015) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694–716
35.
go back to reference Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. Parallel Probl Solv Nat PPSN VIII 3242:832–842 Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. Parallel Probl Solv Nat PPSN VIII 3242:832–842
36.
go back to reference Bader J, Zitzler E (2011) HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76 Bader J, Zitzler E (2011) HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76
38.
go back to reference Galué L, Al-Zamel A, Kalla SL (2019) Further results on the generalised hypergeometric matrix functions. Int J Comput Sci Math 10(1):1–10MathSciNet Galué L, Al-Zamel A, Kalla SL (2019) Further results on the generalised hypergeometric matrix functions. Int J Comput Sci Math 10(1):1–10MathSciNet
39.
go back to reference He C, Tian Y, Jin YC, Zhang XY, Pan LQ (2017) A radial space division based evolutionary algorithm for many-objective optimization. Appl Soft Comput 61:603–621 He C, Tian Y, Jin YC, Zhang XY, Pan LQ (2017) A radial space division based evolutionary algorithm for many-objective optimization. Appl Soft Comput 61:603–621
40.
go back to reference Liu HF, Li JL, Zhang KW, Yang DH (2019) Theoretical analysis of the magnetic field and eddy current within a rectangular giant magnetostrictive material plate. Int J Comput Sci Math 10(3):248–260MathSciNetMATH Liu HF, Li JL, Zhang KW, Yang DH (2019) Theoretical analysis of the magnetic field and eddy current within a rectangular giant magnetostrictive material plate. Int J Comput Sci Math 10(3):248–260MathSciNetMATH
41.
go back to reference Azari H, Moradipour M (2019) Using kernel-based collocation methods to solve a delay partial differential equation with application to finance. Int J Comput Sci Math 10(1):105–114MathSciNetMATH Azari H, Moradipour M (2019) Using kernel-based collocation methods to solve a delay partial differential equation with application to finance. Int J Comput Sci Math 10(1):105–114MathSciNetMATH
42.
go back to reference Cao Y, Ding ZM, Xue F, Rong XT (2018) An improved twin support vector machine based on multi-objective cuckoo search for software defect prediction. Int J Bio-Inspired Comput 11(4):282–291 Cao Y, Ding ZM, Xue F, Rong XT (2018) An improved twin support vector machine based on multi-objective cuckoo search for software defect prediction. Int J Bio-Inspired Comput 11(4):282–291
43.
go back to reference Lin QZ, Liu SB, Zhu QL, Tang CY, Song RZ, Chen JY, Coello CAC, Wong KC, Zhang J (2018) Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans Evol Comput 22(1):32–46 Lin QZ, Liu SB, Zhu QL, Tang CY, Song RZ, Chen JY, Coello CAC, Wong KC, Zhang J (2018) Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans Evol Comput 22(1):32–46
44.
go back to reference Nebro AJ, Durillo JJ, Garcia-Nieto J, Coello CAC, Luna F, Alba E (2009) SMPSO: a new PSO-based metaheuristic for multi-objective optimization. In: IEEE symposium on computational intelligence in multi-criteria decision-making (MCDM), 2009, pp 66–73. https://doi.org/10.1109/MCDM.2009.4938830 Nebro AJ, Durillo JJ, Garcia-Nieto J, Coello CAC, Luna F, Alba E (2009) SMPSO: a new PSO-based metaheuristic for multi-objective optimization. In: IEEE symposium on computational intelligence in multi-criteria decision-making (MCDM), 2009, pp 66–73. https://​doi.​org/​10.​1109/​MCDM.​2009.​4938830
46.
go back to reference Lin QZ, Li JQ, Du ZH, Chen JY, Ming Z (2015) A novel multi-objective particle swarm optimization with multiple search strategies. Eur J Oper Res 247(3):732–744MathSciNetMATH Lin QZ, Li JQ, Du ZH, Chen JY, Ming Z (2015) A novel multi-objective particle swarm optimization with multiple search strategies. Eur J Oper Res 247(3):732–744MathSciNetMATH
47.
go back to reference Al Moubayed N, Petrovski A, McCall J (2014) D2MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces. Evol Comput 22(1):47–77 Al Moubayed N, Petrovski A, McCall J (2014) D2MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces. Evol Comput 22(1):47–77
48.
go back to reference Cai XJ, Wang H, Cui ZH, Cai JH, Xue Y, Wang L (2018) Bat algorithm with triangle-flipping strategy for numerical optimization. Int J Mach Learn Cybern 9(2):199–215 Cai XJ, Wang H, Cui ZH, Cai JH, Xue Y, Wang L (2018) Bat algorithm with triangle-flipping strategy for numerical optimization. Int J Mach Learn Cybern 9(2):199–215
50.
go back to reference Zhang GF, Chen Y, Li Y, Yu HN, Hu HS, Wu SM (2019) Intelligent swarm firefly algorithm for the prediction of China’s national electricity consumption. Int J Bio-Inspired Comput 13(2):111–118 Zhang GF, Chen Y, Li Y, Yu HN, Hu HS, Wu SM (2019) Intelligent swarm firefly algorithm for the prediction of China’s national electricity consumption. Int J Bio-Inspired Comput 13(2):111–118
51.
go back to reference Cai XJ, Gao XZ, Xue Y (2016) Improved bat algorithm with optimal forage strategy and random disturbance strategy. Int J Bio-inspired Comput 8(4):205–214 Cai XJ, Gao XZ, Xue Y (2016) Improved bat algorithm with optimal forage strategy and random disturbance strategy. Int J Bio-inspired Comput 8(4):205–214
52.
go back to reference Cheng R, Jin YC (2014) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191–204 Cheng R, Jin YC (2014) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191–204
53.
go back to reference Zeng GQ, Cheng J, Li LM, Chen MR, Wu L, Dai YX, Zheng CW (2016) An improved multi-objective population-based extremal optimization algorithm with polynomial mutation. Inf Sci 330:49–73 Zeng GQ, Cheng J, Li LM, Chen MR, Wu L, Dai YX, Zheng CW (2016) An improved multi-objective population-based extremal optimization algorithm with polynomial mutation. Inf Sci 330:49–73
54.
go back to reference Sato H, Aguirre HE, Tanaka K, Tanaka HSEA (2010) Self-controlling dominance area of solutions in evolutionary many-objective optimization. Simulated evolution and learning. Springer, Berlin, pp 455–465 Sato H, Aguirre HE, Tanaka K, Tanaka HSEA (2010) Self-controlling dominance area of solutions in evolutionary many-objective optimization. Simulated evolution and learning. Springer, Berlin, pp 455–465
55.
go back to reference Sato H, Aguirre HE, Tanaka K, Tanaka HSEA (2007) Controlling dominance area of solutions and its impact on the performance of MOEAs. Evolutionary multi-criterion optimization. Springer, Berlin, pp 5–20 Sato H, Aguirre HE, Tanaka K, Tanaka HSEA (2007) Controlling dominance area of solutions and its impact on the performance of MOEAs. Evolutionary multi-criterion optimization. Springer, Berlin, pp 5–20
56.
go back to reference Niu Y, Tian ZY, Zhang MQ, Cai XJ, Li JW (2018) Adaptive two-SVM multi-objective cuckoo search algorithm for software defect prediction. Int J Comput Sci Math 9(6):547–554MathSciNetMATH Niu Y, Tian ZY, Zhang MQ, Cai XJ, Li JW (2018) Adaptive two-SVM multi-objective cuckoo search algorithm for software defect prediction. Int J Comput Sci Math 9(6):547–554MathSciNetMATH
57.
go back to reference Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601 Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601
58.
go back to reference Liu YP, Gong DW, Sun XY, Zhang Y (2017) Many-objective evolutionary optimization based on reference points. Appl Soft Comput 50:344–355 Liu YP, Gong DW, Sun XY, Zhang Y (2017) Many-objective evolutionary optimization based on reference points. Appl Soft Comput 50:344–355
59.
go back to reference Meng XB, Li HX, Gao XZ (2019) An adaptive reinforcement learning-based bat algorithm for structural design problems. Int J Bio-Inspired Comput 14(2):114–124 Meng XB, Li HX, Gao XZ (2019) An adaptive reinforcement learning-based bat algorithm for structural design problems. Int J Bio-Inspired Comput 14(2):114–124
60.
go back to reference Dey A, Mondal S, Pal T (2019) Robust and minimum spanning tree in fuzzy environment. Int J Comput Sci Math 10(5):513–524MathSciNetMATH Dey A, Mondal S, Pal T (2019) Robust and minimum spanning tree in fuzzy environment. Int J Comput Sci Math 10(5):513–524MathSciNetMATH
61.
go back to reference Wang R, Purshouse RC, Fleming PJ (2013) Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput 17(4):474–494 Wang R, Purshouse RC, Fleming PJ (2013) Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput 17(4):474–494
62.
go back to reference Sun YA, Yen GG, Zhang Y (2019) IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173–187 Sun YA, Yen GG, Zhang Y (2019) IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173–187
63.
go back to reference Cai XJ, Zhang MQ, Wang H, Xu M, Chen JJ, Zhang WS (2019) Analyses of inverted generational distance for many-objective optimisation algorithms. Int J Bio-Inspired Comput 14(1):62–68 Cai XJ, Zhang MQ, Wang H, Xu M, Chen JJ, Zhang WS (2019) Analyses of inverted generational distance for many-objective optimisation algorithms. Int J Bio-Inspired Comput 14(1):62–68
64.
go back to reference Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271 Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271
Metadata
Title
A hybrid many-objective competitive swarm optimization algorithm for large-scale multirobot task allocation problem
Authors
Fei Xue
Tingting Dong
Siqing You
Yan Liu
Hengliang Tang
Lei Chen
Xi Yang
Juntao Li
Publication date
06-10-2020
Publisher
Springer Berlin Heidelberg
Published in
International Journal of Machine Learning and Cybernetics / Issue 4/2021
Print ISSN: 1868-8071
Electronic ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-020-01213-4

Other articles of this Issue 4/2021

International Journal of Machine Learning and Cybernetics 4/2021 Go to the issue