| 一种基于博弈的任意时间演化优化算法 |
| |
| 引用本文： | 徐敏,张四海,王煦法.一种基于博弈的任意时间演化优化算法[J].中国科学技术大学学报,2007,37(2):177-183. |
| |
| 作者姓名： | 徐敏 张四海 王煦法 |
| |
| 作者单位： | 中国科学技术大学计算机科学与技术系,安徽合肥,230027 |
| |
| 基金项目： | 国家自然科学基金委员会海外青年学者合作研究基金 |
| |
| 摘 要： | 提出了一种基于多人博弈的演化优化方法(EAMG),用于解决旅行商问题(TSP).将TSP看作n个人(n个城市)之间的非合作博弈,通过主体的理性行为来对问题的解进行优化.详细介绍了该算法的设计思想和具体实验,从理论上分析了算法的性能和时间复杂度.为了体现一定的多样性,在EAMG的基础上进一步提出了多群体EAMG算法,并将两种算法的实验结果与已有的优化算法相比较.实验结果表明,EAMG和MEAMG在实际应用中具有很强的问题求解能力.
|
| 关 键 词： | 博弈论 纳什均衡 任意时间算法 |
| 文章编号： | 0253-2778(2007)02-0177-07 |
| 修稿时间： | 10 28 2005 12:00AM |
An anytime evolutionary optimization algorithm based on game theory |
| |
| XU Min,ZHANG Si-hai,WANG Xu-fa.An anytime evolutionary optimization algorithm based on game theory[J].Journal of University of Science and Technology of China,2007,37(2):177-183. |
| |
| Authors: | XU Min ZHANG Si-hai WANG Xu-fa |
| |
| Abstract: | An evolutionary algorithm based on multi-player game theory(EAMG) for the TSP was proposed.In EAMG model,agents' rational behaviors led total system to the optimal solution of the traveling salesman problem.The design and experiments of EAMG were introduced in detail,and its ability and time complexity was analyzed.The presented algorithm was compared with some other optimization algorithms.Based on EAMG,a multi-crowd EAMG for diversity of solutions was proposed.The theoretical analysis and experiment results show that EAMG and MEAMG are strongly capable of problem solving. |
| |
| Keywords: | TSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
