Skip to main content
Springer Nature Link
Log in

A novel approach to task assignment in a cooperative multi-agent design system

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The task assignment problem is an important topic in multi-agent systems research. Distributed real-time systems must accommodate a number of communication tasks, and the difficulty in building such systems lies in task assignment (i.e., where to place the tasks). This paper presents a novel approach that is based on artificial bee colony algorithm (ABC) to address dynamic task assignment problems in multi-agent cooperative systems. The initial bee population (solution) is constructed by the initial task assignment algorithm through a greedy heuristic. Each bee is formed by the number of tasks and agents, and the number of employed bees is equal to the number of onlooker bees. After being generated, the solution is improved through a local search process called greedy selection. This process is implemented by onlooker and employed bees. In greedy selection, if the fitness value of the candidate source is greater than that of the current source, the bee forgets the current source and memorizes the new candidate source. Experiments are performed with two test suites (TIG representing real-life tree and Fork–Join problems and randomly generated TIGs). Results are compared with other nature-inspired approaches, such as genetic and particle swarm optimization algorithms, in terms of CPU time and communication cost. The findings show that ABC improves these two criteria significantly with respect to the other approaches.

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

Access this article

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

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
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Tindell KW, Burns A, Wellings AJ (1992) Allocating hard real-time tasks: an NP-hard problem made easy. Real-Time Syst 4(2):145–165

    Article  Google Scholar 

  2. Kanefsky B, Taylor W (1991) Where the really hard problems are. In: Proceedings of the 12th international joint conference on AI (IJCAI’91), pp 163–169

  3. Burns A (1991) Scheduling hard real-time systems: a review. Softw Eng J 6(3):116–128

    Article  Google Scholar 

  4. Ullman JD (1975) NP-complete scheduling problems. J Comput Syst Sci 10(3):384–393

    Article  MATH  MathSciNet  Google Scholar 

  5. Kartik S, Murthy CSR (1997) Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Trans Comput 46:719–724

    Article  Google Scholar 

  6. Jourdan L, Basseur M, Talbi EG (2009) Hybridizing exact methods and metaheuristics: a taxonomy. Eur J Oper Res 199(3):620–629

    Article  MATH  MathSciNet  Google Scholar 

  7. Pentico DW (2007) Assignment problems: a golden anniversary survey. Eur J Oper Res 176:774–793

    Article  MATH  MathSciNet  Google Scholar 

  8. Lo VM (1988) Heuristic algorithms for task assignment in distributed systems. IEEE Trans Comput 37(11):1384–1397

    Article  MathSciNet  Google Scholar 

  9. Weerdt DM, Mors TA, Witteveen C (2005) Multi-agent planning: an introduction to planning and coordination. In: Handouts of the european agent summer school, pp 1–32

  10. Shatz SM, Wang JP, Goto M (1992) Task allocation for maximizing reliability of distributed computer systems. IEEE Trans Comput 41:1156–1168

    Article  Google Scholar 

  11. Vidyarthi DP, Tripathi AK (2001) Maximizing reliability of distributed c computing systems with task allocation using simple genetic algorithm. J Syst Archit 47:549–554

    Article  Google Scholar 

  12. Attiya G, Hamam Y (2006) Task allocation for maximizing reliability of distributed systems: a simulated annealing approach. J Parallel Distrib Comput 66:1259–1266

    Article  MATH  Google Scholar 

  13. Yin PY et al (2007) Task system using hybrid particle swarm optimization. J Syst Softw 80:724–735

    Article  Google Scholar 

  14. Jong Sd, Tuyls K, Sprinkhuizen-Kuyper IG (2006) Robust and scalable coordination of potential-field driven agents. Proceeding of: computational intelligence for modelling, control and automation. In: IEEE proceedings of international conference on computational intelligence for modelling control and automation and international conference on intelligent agents web technologies and international commerce, pp 230/1-230/8

  15. Strens MJA, Windelinckx N (2005) Combining planning with reinforcement learning for mult-robot task allocation. In: Proceedings of adaptive agents and multi-agent systems, pp 260–274

  16. Brueckner S, Parunak H (2000) Multiple pheromones for improved guidance. In: Proceedings of symposium on advanced enterprise control, Minneapolis

  17. Weyns D, Boucke N, Holvoet T, Schols W (2005) Gradient field-based task assignment in an AGV transportation system. In: Proceedings of 5th international joint conference on autonomous agents and multiagent systems, pp 447–458

  18. Panait L, Luke S (2004) A pheromone-based utility model for collaborative foraging. In: Proceedings of the 3rd international joint conference on autonomous agents and multi-agent systems, pp 36–43

  19. Parunak H, Brueckner S, Sauter J (2002) Synthetic pheromone mechanisms for coordination of unmanned vehicles. In: Proceedings of the 1st international joint conference on autonomous agents and multiagent systems. ACM Press, Bologna, pp 448–450

  20. Dorigo M, Stuetzle T (2004) Ant colony optimization. MIT Press, Cambridge

    Book  MATH  Google Scholar 

  21. Holland OE, Melhuish C (1999) Stigmergy, self-organisation, and sorting in collective robotics. Artif Life 5(2):173–202

    Article  Google Scholar 

  22. Karaboga D, Akay B (2009) A survey: algorithms simulating bee swarm intelligence. Artif Intell Rev 31(1-4):61–85

    Article  Google Scholar 

  23. Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci Swarm Intell Appl 192(1):120–142

    Google Scholar 

  24. Baykasoglu A, Ozbakir L, Tapkan P (2007) Artificial bee colony algorithm and its application to generalized assignment problem. In: Felix T, Chan S, Tiwari MK (eds) Swarm intelligence: focus on Ant and particle swarm optimization. Tech Education and Publishing, pp 113–144

  25. Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21–57

    Article  Google Scholar 

  26. Karaboga D, Ozturk C (2010) Fuzzy clustering with artificial bee colony algorithm. Sci Res Essays 5(41):1899–1902

    Google Scholar 

  27. Ozturk C, Karaboga D, Gorkemli B (2011) Probabilistic dynamic deployment of wireless sensor networks by artificial bee colony algorithm. Sensors 11(6):6056–6065

    Article  Google Scholar 

  28. Tsai PW, Pan JS, Liao BY, Chu SC (2009) Enhanced artificial bee colony optimization. Int J Innov Comput Inf Control 5(12):5081–5092

    Google Scholar 

  29. UCI (2014) UCI Libraries. [online]. Available from: http://www.lib.uci.edu/collections/databases-a-to-z.html

  30. Teodorovic D (2009) Bee colony optimization (BCO). In: Lim CP, Jain LC, Dehuri S (eds) Innovations in swarm intelligence. Springer-Verlag, Berlin, Heidelberg, pp 39–60

    Chapter  Google Scholar 

  31. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department

  32. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471

    Article  MATH  MathSciNet  Google Scholar 

  33. Karaboga D, Basturk B (2008) On the performance of artificial bee colony(ABC) algorithm. Appl Soft Comput 8:687–697

    Article  Google Scholar 

  34. Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214:108–132

    Article  MATH  MathSciNet  Google Scholar 

  35. Sun J, Zhang Q, Tsang EP (2005) DE/EDA: a new evolutionary algorithm for global optimization. Inf Sci 169(3):249– 262

    Article  MathSciNet  Google Scholar 

  36. Lu ML, Xu BL, Sheng AD et al (2014) Modeling analysis of ant system with multiple tasks and its application to spatially adjacent cell state estimate. Appl Intell 41(1):13–29

    Article  Google Scholar 

  37. Zhang R, Wu C (2010) A hybrid approach to large-scale job shop scheduling. Appl Intell 32 (1):47–59

    Article  Google Scholar 

  38. Özbakir L, Baykasoğlu A, Tapkan P (2010) Bees algorithm for generalized assignment problem. Appl Math Comput 215:3782–3795

    Article  MATH  MathSciNet  Google Scholar 

  39. Yeh WC, Hsieh TJ (2011) Solving reliability redundancy allocation problems using an artificial bee colony algorithm. Comput Oper Res 38:1465–1473

    Article  MathSciNet  Google Scholar 

  40. Liu H, Tang MX (2006) Evolutionary design in a multi-agent design environment. Appl Soft Comput 6(2):207–220

    Article  Google Scholar 

  41. Liu H (2010) Context-aware agents in cooperative design environment. Int J Comput Appl Technol 39(4):187–198

    Article  Google Scholar 

  42. Liu H, Tang MX, Frazer J H (2004) Supporting dynamic management in a multi-agent collaborative design system. Adv Eng Softw 35(8-9):493–502

    Article  Google Scholar 

Download references

Acknowledgments

This project is founded by the program of Taishan scholars and supported by National Natural Science Foundation of China (No. 61272094, No. 61472232).

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Shandong Normal University, Jinan, China

    Hong Liu, Peng Zhang, Bin Hu & Philip Moore

  2. Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology, Jinan, China

    Hong Liu, Peng Zhang & Bin Hu

  3. School of Information Science and Engineering, Lanzhou University, Lanzhou, China

    Bin Hu & Philip Moore

Authors
  1. Hong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Philip Moore
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, H., Zhang, P., Hu, B. et al. A novel approach to task assignment in a cooperative multi-agent design system. Appl Intell 43, 162–175 (2015). https://doi.org/10.1007/s10489-014-0640-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-014-0640-z

Keywords