Solution of Overlapping Coalition Formation Based on Discrete Particle Swarm Optimization

Author

Xu, Jinyou ; Li, Wenli

Author_Institution

Inst. of Syst. Eng., Dalian Univ. of Technol., Dalian

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

4

Abstract

In order to tackle the shortage of existing research on coalition formation, where one agent only can take part in a coalition, this paper introduces overlapping coalition, and presents a novel way to settle the problem of overlapping coalition formation with Subagent. Then a particle swarm algorithm with dynamic weight value based on the similarity calculation is applied to solve overlapping coalition formation of serial tasks, which realizes an Agent takes part in several different coalitions, reducing the waste of agent resource in a certain extent. Finally, the effectiveness of this method is proved by an experiment.

Keywords

discrete systems; multi-agent systems; particle swarm optimisation; agent resource; discrete particle swarm optimization; dynamic weight value; overlapping coalition formation; serial tasks; subagent; Collaboration; Costs; Heuristic algorithms; Multiagent systems; Particle swarm optimization; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.2895

Filename

4681084