摘要
针对与联盟值有关的联盟结构生成算法,通过归纳总结整数划分数与联盟结构图中各层联盟结构数之间的对应规律,并利用已知联盟值之间的信息对解空间进行充分剪枝,快速获得不同大小的联盟结构局部最优解,从而计算出全局最优解。通过剪枝示例统计验证算法效果,剪枝优化后的搜索空间减少50%。
The paper discussed the coalition structure generation algorithm related to coalition values. It summarized the corresponding regulation between the number of integer division and the number of coalition structure in each layer of coalition structure graph. It made use of known information among the coalition value. The solution space was fully pruned. Then it quickly got the different sizes of partial optimal solution of coalition structure, and computing the superior solution in overall. It statistically verified algorithm effect by pruning sample. And the searching space after pruning optimization reduced 50 %.
出处
《莆田学院学报》
2015年第5期32-35,共4页
Journal of putian University
基金
福建省科技厅资助项目(2015H0033)
关键词
多AGENT
联盟结构
整数划分
剪枝搜索
算法优化
multi agent
coalition structure
integer division
pruning search
algorithm optimization
