| 求解TSP问题的混合离散粒子群算法 |
| |
| 引用本文： | 王文峰,刘光远,温万惠. 求解TSP问题的混合离散粒子群算法[J]. 西南大学学报(自然科学版), 2007, 29(1): 85-88 |
| |
| 作者姓名： | 王文峰 刘光远 温万惠 |
| |
| 作者单位： | [1]西南大学计算机与信息科学学院,重庆400715 [2]西南大学电子信息工程学院,重庆400715 |
| |
| 基金项目： | 教育部项目（104262）;重庆科技计划项目（CSTC-2004BB2083）;西南师范大学校青年基金资助项目（SWNUQ2005005）. |
| |
| 摘 要： | 重新定义了离散粒子群算法DPSO的速度和位置公式，使其适宜求解离散问题．针对DPSO易早熟、收敛慢的缺陷，建立局部极小区域的扰动机制，在结合局部搜索算法PSEC后，提出了一种混合离散粒子群算法HDPSO．
|
| 关 键 词： | 离散粒子群算法 旅行商同题 组合优化 |
| 文章编号： | 1000-2642（2007）01-0085-04 |
| 修稿时间： | 2006-05-16 |
A Hybrid Discrete Particle Swarm Optimization for TSP |
| |
| WANG Wen-feng, LIU Guang-yuan, WEN Wan-hui. A Hybrid Discrete Particle Swarm Optimization for TSP[J]. Journal of southwest university (Natural science edition), 2007, 29(1): 85-88 |
| |
| Authors: | WANG Wen-feng LIU Guang-yuan WEN Wan-hui |
| |
| Affiliation: | 1. School of Computer and Information 2. School of Electronic and Information Science, Southwest University, Chongqing, 400715, China Engineering, Southwest University, Chongqing, 400715, China |
| |
| Abstract: | To deal with the problem of premature convergence and slow search speed of DPSO(discrete particle swarm optimization),this paper proposes a novel hybrid discrete particle swarm optimization (HDPSO),which integrates the disturbance methods to help the particle escape from the local minima and the local algorithm PSEC to speed up the reach.Experimental simulations show that the proposed HDPSO can not only significantly speed up the convergence,but also effectively solve the problem of premature convergence. |
| |
| Keywords: | discrete particle swarm optimization travel salesman problem combination optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《西南大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《西南大学学报(自然科学版)》下载全文 |
