Advertisement

Particle Swarms Cooperative Optimization for Coalition Generation Problem

  • Guofu Zhang
  • Jianguo Jiang
  • Na Xia
  • Zhaopin Su
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)

Abstract

In this paper, a Particle Swarms Cooperative Optimization is proposed to solve Coalition Generation Problem in parallel manner with each Agent taking part in several different coalitions and each coalition turning its hand to several different tasks. With a novel two-dimensional binary encoding approach, the algorithm performs well on coalition parallel generation. An adaptive disturbance factor is adopted to force swarms getting out of local optimums quickly. Introduced an active-feedback based on island models, the algorithm has a good cooperative searching characteristic. The effectiveness of the proposed algorithm is proved by experiments.

Keywords

Particle Swarm Coalition Structure Island Model Discrete Particle Swarm Optimization Maximum Iteration Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shehory, O., Kraus, S.: Task allocation via coalition formation among autonomous agents. In: Proceedings of the Fourteenth International Joint Conf. on artificial Intelligence, Montreal, Canada, Morgan Kaufman, pp. 655–661. Morgan Kaufmann, San Francisco (1995)Google Scholar
  2. 2.
    Sen, S., Dutta, P.: Searching for optimal coalition structures. In: Proceedings of the 4th ICMAS, Boston, MA, pp. 287–292. IEEE Press, Los Alamitos (2000)Google Scholar
  3. 3.
    Na, X., Jianguo, J., Yalin, H.: Solution to agent coalition problem using improved ant colony optimization algorithm. In: Intelligent Agent Technology, Beijing, pp. 475–478 (2004)Google Scholar
  4. 4.
    Zhenghu, L.: Research on key issues of mobile Agent system. PhD Thesis, department of Computer and Information Science, Hefei University of Technology, China, pp. 81–98 (2002)Google Scholar
  5. 5.
    Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm optimization algorithm. In: Proceedings of Conf. On Systems, Man, and Cybernetics, Piscataway, pp. 4104–4109 (1997)Google Scholar
  6. 6.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of Conference on Neural Networks, pp. 1942–1948 (1995)Google Scholar
  7. 7.
    Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)Google Scholar
  8. 8.
    Yuhui, S., Eberhart, R.: Parameter selection in particle swarm optimization. In: Proceedings of the 7th Annual Conf. on Evolutionary Programming, pp. 591–600 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Guofu Zhang
    • 1
  • Jianguo Jiang
    • 1
  • Na Xia
    • 1
  • Zhaopin Su
    • 1
  1. 1.School of Computer and InformationHefei University of TechnologyHefeiPR China

Personalised recommendations