| 差分演化算法求解旅行商问题 |
| |
| 引用本文： | 胡中波,熊盛武.差分演化算法求解旅行商问题[J].计算机应用与软件,2008,25(7). |
| |
| 作者姓名： | 胡中波 熊盛武 |
| |
| 作者单位： | 1. 孝感学院数学系,湖北,孝感,432100
2. 武汉理工大学计算机科学与技术学院,湖北,武汉,430070 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划)
,
国家自然科学基金
,
湖北省教育厅中青年人才基金 |
| |
| 摘 要： | 设计了基于差分演化算法的新算法来求解旅行商问题.在新算法中,旅行商问题的城市的个数作为向量的维数,每个向量的元素的大小顺序作为旅行商问题的一个可行解.实验表明,该算法能够成功求解小规模的旅行商问题,而且算法稳健性好;再与同类算法的优化结果相比较,表明了该算法计算量小、收敛速度快的优点.
|
| 关 键 词： | 差分演化算法 旅行商问题 组合优化 |
DIFFERENTIAL EVOLUTION ALGORITHM FOR TRAVELLING SALESMAN PROBLEMS |
| |
| Hu Zhongbo,Xiong Shengwu.DIFFERENTIAL EVOLUTION ALGORITHM FOR TRAVELLING SALESMAN PROBLEMS[J].Computer Applications and Software,2008,25(7). |
| |
| Authors: | Hu Zhongbo Xiong Shengwu |
| |
| Affiliation: | Hu Zhongbo1 Xiong Shengwu21(Department of Mathematics,Xiaogan University,Xiaogan 432100,Hubei,China)2(School of Computer Science , Technology,Wuhan University of Technology,Wuhan 430070,China) |
| |
| Abstract: | A new strategy based on differential evolution algorithm is designed to solve travelling salesman problems(TSP).In the strategy,the number of TSP's cities is the dimension of vectors,and the precedence order of all the members of each vector is a feasible solution of the problems.The experimental results show that the robust strategy can succeed in solving small-scale travelling salesman problems.Compared with particle swarm optimization algorithm and ant algorithms,the proposed method is of smaller computa... |
| |
| Keywords: | Differential evolution algorithm Travelling salesman problem Combinational optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
