J4

• • 上一篇    下一篇

粒子群优化算法求解旅行商问题

黄岚, 王康平, 周春光, 庞巍, 董龙江, 彭利   

  1. 吉林大学计算机科学与技术学院, 长春 130012
  • 收稿日期:2003-07-10 修回日期:1900-01-01 出版日期:2003-10-26 发布日期:2003-10-26
  • 通讯作者: 周春光

Particle Swarm Optimization for Traveling Salesman Problems

HUANG Lan, WANG Kang-ping, ZHOU Chun-guang, PANG Wei, DONG Long-jiang, PENG Li   

  1. College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2003-07-10 Revised:1900-01-01 Online:2003-10-26 Published:2003-10-26
  • Contact: ZHOU Chun-guang

摘要: 首先介绍粒子群优化的搜索策略与基本算法, 然后通过引入交换子和交换序的概念, 构造一种特殊的粒子群优化算法, 并用于求解旅行商问题. 实验表明了在求解组合优化问题中的有效性.

关键词: 粒子群优化算法, 旅行商问题, 组合优化

Abstract: This paper introduces the basic algorithm and search strategies of particle swarm optimization (PSO), via presenting the concepts of swap operator and swap sequence an algorithm of a kind of special particle swarm optimization is constructed and then proposes its application to traveling salesman problems(TSP). The experiments show the new PSO can achieve good results.

Key words: particle swarm optimization, traveling salesman problem, combinatorial optimization

中图分类号: 

  • TP31