期刊论文

Wu, Da-Qing

英文

东华大学学报(英文版)

1672-5220

2014

31

3

362-367

10.19884/j.1672-5220.2014.03.026

National Natural Science Foundation of China（No.70971020）； the Subject of Ministry of Education of Hunan Province,China（No.13C818）； the Project of Industrial Science and Technology Support of Hengyang City,Hunan Province,China（No.2013KG63）； the Open Project Program of Artificial Intelligence Key Laboratory of Sichuan Province,Sichuan University of Science and Engineering,China（No.2012RYJ03）； the Fund Project of Humanities and Social Sciences,Ministry of Education of China（No.13YJCZH147）； the Special Fund for Shanghai Colleges’ Outstanding Young Teachers’ Scientific Research Projects,China（No.ZZGJD12033）；

本校为其他机构

The traveling salesman problem（ TSP） is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization（ DMPSO-ACO） was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer（ DMPSO） and the stochastic exploitation of the ant colony optimization（ ACO） for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO wa...