首页 | 本学科首页   官方微博 | 高级检索  
     

基于离散粒子群算法求解复杂联盟生成问题
引用本文:张国富,蒋建国,夏娜,苏兆品.基于离散粒子群算法求解复杂联盟生成问题[J].电子学报,2007,35(2):323-327.
作者姓名:张国富  蒋建国  夏娜  苏兆品
作者单位:合肥工业大学计算机与信息学院,安徽合肥 230009;安全关键工业测控技术教育部工程研究中心,安徽合肥 230009
基金项目:国家自然科学基金,高等学校博士学科点专项科研项目
摘    要:针对联盟生成问题现有解决方案的不足,提出复杂联盟和虚拟Agent的概念,设计一种基于多粒子群协同优化的复杂联盟串行生成算法,实现一个Agent可以加入多个联盟和一个联盟可以承担多个任务,在一定程度上解决了Agent资源和能力的浪费问题.实验结果证明了算法的有效性.

关 键 词:多Agent系统  复杂联盟  虚拟Agent  离散粒子群优化  
文章编号:0372-2112(2007)02-0323-05
收稿时间:2006-04-25
修稿时间:2006-04-252006-10-20

Solutions of Complicated Coalition Generation Based on Discrete Particle Swarm Optimization
ZHANG Guo-fu,JIANG Jian-guo,XIA Na,SU Zhao-pin.Solutions of Complicated Coalition Generation Based on Discrete Particle Swarm Optimization[J].Acta Electronica Sinica,2007,35(2):323-327.
Authors:ZHANG Guo-fu  JIANG Jian-guo  XIA Na  SU Zhao-pin
Affiliation:School of Computer and Information Science,Hefei University of Technology,Hefei,Anhui 230009,China;Engineering Research Center of Safety Critical Industrial Measurement and Control Technology,Ministry of Education,Hefei,Anhui 230009,China
Abstract:In order to tackle the shortage of existing researches in Coalition Generation Problem, a novel Complicated Coalition and a novel Virtual Agent are proposed. Then a Particle Swarms Cooperative Optimization algorithm applied to solving serial Complicated Coalition Generation Problem is put forward on the basis of the analysis of the standard discrete particle swarm opti- mization. The new algorithm realizes the condition that an Agent can take part in several different coalitions and a coalition can turn its hand to several different tasks and partly reduces the waste of resource and ability. The effectiveness of the algorithm is proved by experiments.
Keywords:multi-agent system  complicated coalition  virtual agent  discrete particle swarm optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号