DocumentCode
412657
Title
Proposal of probabilistically and dynamically separating GA
Author
Nakayama, Koichi ; Shimohara, Katsunori ; Katai, Osamu
Author_Institution
Graduate Sch. of Informatics, Kyoto Univ., Japan
Volume
2
fYear
2003
fDate
8-12 Dec. 2003
Firstpage
1323
Abstract
We propose a "probabilistically and dynamically-separating genetic algorithm (pDS-GA)" that is applied to a multi-agent system (MAS). The proposed pDS-GA holds two advantages over a conventional DS-GA: (1) evolution of cooperation can be realized without using a gene network. Therefore, the communication cost between agents as well as the calculation cost will be mitigated. (2) Dynamic separation is based on probability. Therefore, there is no need to always grasp the number of agents in a colony. We verified the character of pDS-GA experimentally, finding that organization by division of work could be realized as a result of the evolution of cooperation.
Keywords
genetic algorithms; learning (artificial intelligence); multi-agent systems; probability; gene network; multi-agent system; probabilistically and dynamically-separating genetic algorithm; Biological system modeling; Cells (biology); Costs; Evolution (biology); Genetic algorithms; Humans; Informatics; Multiagent systems; Organisms; Proposals;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN
0-7803-7804-0
Type
conf
DOI
10.1109/CEC.2003.1299822
Filename
1299822
Link To Document