| 一种求旅行商问题的离散粒子群算法 |
| |
| 引用本文： | 邓伟林,胡桂武. 一种求旅行商问题的离散粒子群算法[J]. 计算机与现代化, 2012, 0(3): 1-4 |
| |
| 作者姓名： | 邓伟林 胡桂武 |
| |
| 作者单位： | 广东轻工职业技术学院计算机系;广东商学院数学与计算科学系 |
| |
| 基金项目： | 广东省自然科学基金资助项目(06301003);广东轻工职业技术学院科研启动基金资助项目(KY200817) |
| |
| 摘 要： | 针对旅行商问题提出一种离散粒子群算法。算法重新定义了速度及其与粒子位置的相关算子,设计了"距离排序矩阵"(保存距离城市由近到远的其他城市的矩阵),并根据它生成可动态变化的优秀基因库来指导粒子高效地进行全局搜索。本文用TSPLIB中的部分案例进行实验,实验结果表明,该算法在求解旅行商问题上有很好的性能,并且具有很好的鲁棒性。
|
| 关 键 词： | 群体智能算法 离散粒子群算法 优化算法 旅行商问题 进化计算 |
Discrete Particle Swarm Optimization Algorithm for TSP |
| |
| DENG Wei-lin,HU Gui-wu. Discrete Particle Swarm Optimization Algorithm for TSP[J]. Computer and Modernization, 2012, 0(3): 1-4 |
| |
| Authors: | DENG Wei-lin HU Gui-wu |
| |
| Affiliation: | 1.Department of Computing,Guangdong Industry Technical College,Guangzhou 510300,China; 2.Department of Mathematics and Computer Science,Guangdong University of Business Studies,Guangzhou 510320,China) |
| |
| Abstract: | A discrete particle swarm optimization algorithm is proposed for solving traveling salesman problem(TSP).It defines a newly velocity.It also defines some new operators between particle and velocity.A matrix,which keeps the sorted ascending edges by distance for each city is created,and a variable size of gene pool is implemented to direct the particle to search around the space.In this paper,some cases from TSPLIB are tested;the experiments results show that the algorithm has good performance and good rudeness for solving TSP. |
| |
| Keywords: | swarm intelligence algorithm discrete particle swarm optimization optimization algorithm traveling salesman problem evolutionary computation |
| 本文献已被 CNKI 维普 等数据库收录！ |
