科研之友
微信
新浪微博
Facebook
分享链接
摘要
A kind of parallel genetic algorithm based on the idea of multi-agent cooperation was described. The algorithm consists of several computing units, in each of which a simple genetic algorithm is maintained, thus each computing unit can be regarded as an independent autonomous agent. The algorithm allocates computing resources to each unit according to the resource-allocating vector and carries through exchange of individuals between units with respect to the individual-migrating matrix. From the viewpoint of multi-agent system, the allocation of computing resource represents the coordination between agents, while the migration of individuals represents the collaboration between them. The algorithm can be implemented easily in a serial computer and it has the quasi-parallel feature in this case. The analysis of two-dimensional quasi-parallel genetic algorithm shows that since the cooperation between computing agents is taken into account, the computing resources can be utilized in a more effective way and thus better performances is presented when the algorithm deals with different kinds of optimizing problems.
- 出版日期2002
- 单位清华大学
