Skip to main content
Log in

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

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

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.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. 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

    Google Scholar 

  2. 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

    Google Scholar 

  3. 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

    Google Scholar 

  4. 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

    Google Scholar 

  5. 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

    Google Scholar 

  6. 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

    Google Scholar 

  7. 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

    Google Scholar 

  8. Nagarajan T, Thondiyath A (2013) Heuristic based task allocation algorithm for multiple robots using agents. Proced Eng 64:844–853

    Google Scholar 

  9. 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

    Google Scholar 

  10. Zhou LW, Shi YY, Wang JL, Yang P (2014) A balanced heuristic mechanism for multirobot task allocation of intelligent warehouses. Math Probl Eng. https://doi.org/10.1155/2014/380480

    Article  Google Scholar 

  11. 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

    Google Scholar 

  12. Lamballais T, Roy D, De Koster MBM (2017) Estimating performance in a robotic mobile fulfillment system. Eur J Oper Res 256(3):976–990

    MATH  Google Scholar 

  13. 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. Cui ZH, Li FX, Zhang WS (2019) Bat algorithm with principal component analysis. Int J Mach Learn Cybern 10(3):603–622

    Google Scholar 

  15. Cui ZH, Zhang MQ, Wang H, Cai XJ, Zhang WS (2019) A hybrid many-objective cuckoo search algorithm. Soft Comput 23(21):10681–10697

    Google Scholar 

  16. 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

    Google Scholar 

  17. Lee DH (2018) Resource-based task allocation for multi-robot systems. Robot Auton Syst 103:151–161

    Google Scholar 

  18. 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

    Google Scholar 

  19. 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

    Google Scholar 

  20. 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

    Google Scholar 

  21. 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

    Google Scholar 

  22. 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

    Google Scholar 

  23. 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

    Google Scholar 

  24. Zhang JJ, Xue F, Cai XJ, Cui ZH, Chang Y, Zhang WS, Li WZ (2019) Privacy protection based on many-objective optimization algorithm. Concurr Comput Pract Exp 1(20):e5342. https://doi.org/10.1002/cpe.5342

    Article  Google Scholar 

  25. 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

    Google Scholar 

  26. Cui ZH, Zhang JJ, Wang YC, Cao Y, Cai XJ, Zhang WS, Chen JJ (2019) A pigeon-inspired optimization algorithm for many-objective optimization problems. Sci China Inf Sci 62(7):070212. https://doi.org/10.1007/s11432-018-9729-5

    Article  Google Scholar 

  27. 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

    Google Scholar 

  28. 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

    Google Scholar 

  29. 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

    Google Scholar 

  30. 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

    Google Scholar 

  31. 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

    Google Scholar 

  32. 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

    Google Scholar 

  33. 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

    Google Scholar 

  34. 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

    Google Scholar 

  35. Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. Parallel Probl Solv Nat PPSN VIII 3242:832–842

    Google Scholar 

  36. Bader J, Zitzler E (2011) HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76

    Google Scholar 

  37. Tian Y, Zheng XT, Zhang XY, Jin YC (2019) Efficient large-scale multiobjective optimization based on a competitive swarm optimizer. IEEE Trans Cybern. https://doi.org/10.1109/TCYB.2019.2906383

    Article  Google Scholar 

  38. Galué L, Al-Zamel A, Kalla SL (2019) Further results on the generalised hypergeometric matrix functions. Int J Comput Sci Math 10(1):1–10

    MathSciNet  Google Scholar 

  39. 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

    Google Scholar 

  40. 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–260

    MathSciNet  MATH  Google Scholar 

  41. 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–114

    MathSciNet  MATH  Google Scholar 

  42. 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

    Google Scholar 

  43. 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

    Google Scholar 

  44. 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

  45. Walha C, Bezine H, Alimi AM (2013) A multi-objective particle swarm optimization approach to robotic grasping. In: International conference on individual and collective behaviors in robotics (ICBR). 2013. Sousse, pp 120–125. https://doi.org/10.1109/ICBR.2013.6729267

  46. 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–744

    MathSciNet  MATH  Google Scholar 

  47. 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

    Google Scholar 

  48. 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

    Google Scholar 

  49. Cui ZH, Cao Y, Cai XJ, Cai JH, Chen JJ (2019) Optimal LEACH protocol with modified bat algorithm for big data sensing systems in Internet of Things. J Parallel Distrib Comput 132:217–229. https://doi.org/10.1016/j.jpdc.2017.12.014

    Article  Google Scholar 

  50. 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

    Google Scholar 

  51. 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

    Google Scholar 

  52. Cheng R, Jin YC (2014) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191–204

    Google Scholar 

  53. 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

    Google Scholar 

  54. 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

    Google Scholar 

  55. 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

    Google Scholar 

  56. 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–554

    MathSciNet  MATH  Google Scholar 

  57. 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

    Google Scholar 

  58. Liu YP, Gong DW, Sun XY, Zhang Y (2017) Many-objective evolutionary optimization based on reference points. Appl Soft Comput 50:344–355

    Google Scholar 

  59. 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

    Google Scholar 

  60. Dey A, Mondal S, Pal T (2019) Robust and minimum spanning tree in fuzzy environment. Int J Comput Sci Math 10(5):513–524

    MathSciNet  MATH  Google Scholar 

  61. Wang R, Purshouse RC, Fleming PJ (2013) Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput 17(4):474–494

    Google Scholar 

  62. 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

    Google Scholar 

  63. 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

    Google Scholar 

  64. 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

    Google Scholar 

Download references

Acknowledgements

This paper is supported by Humanity and Social Science Research of Ministry of Education (20YJCZH200), Beijing Intelligent Logistics System Collaborative Innovation Center Open Topic (No. BILSCIC-2019KF- 05), General Program of Science and Technology Development Project of Beijing Municipal Education Commission of China (No. KM201810037002), Grass-roots Academic Team Building Project of Beijing Wuzi University (No. 2019XJJCTD04), Beijing Youth Top-notch Talent Plan of High-Creation Plan (No. 2017000026833ZK25), Canal Plan-Leading Talent Project of Beijing Tongzhou District (No. YHLB2017038).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tingting Dong.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xue, F., Dong, T., You, S. et al. A hybrid many-objective competitive swarm optimization algorithm for large-scale multirobot task allocation problem. Int. J. Mach. Learn. & Cyber. 12, 943–957 (2021). https://doi.org/10.1007/s13042-020-01213-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-020-01213-4

Keywords

Navigation