Paper Title:
Particle Swarm Optimization Combined with Ant Colony Optimization for the Multiple Traveling Salesman Problem
  Abstract

A lot of practical problem, such as the scheduling of jobs on multiple parallel production lines and the scheduling of multiple vehicles transporting goods in logistics, can be modeled as the multiple traveling salesman problem (MTSP). Due to the combinatorial complexity of the MTSP, it is necessary to use heuristics to solve the problem, and a discrete particle swarm optimization (DPSO) algorithm is employed in this paper. Particle swarm optimization (PSO) in the continuous space has obtained great success in resolving some minimization problems. But when applying PSO for the MTSP, a difficulty rises, which is to find a suitable mapping between sequence and continuous position of particles in particle swarm optimization. For overcoming this difficulty, PSO is combined with ant colony optimization (ACO), and the mapping between sequence and continuous position of particles is established. To verify the efficiency of the DPSO algorithm, it is used to solve the MTSP and its performance is compared with the ACO and some traditional DPSO algorithms. The computational results show that the proposed DPSO algorithm is efficient.

  Info
Periodical
Materials Science Forum (Volumes 626-627)
Edited by
Dongming Guo, Jun Wang, Zhenyuan Jia, Renke Kang, Hang Gao, and Xuyue Wang
Pages
717-722
DOI
10.4028/www.scientific.net/MSF.626-627.717
Citation
H. K. Feng, J. S. Bao, J. Ye, "Particle Swarm Optimization Combined with Ant Colony Optimization for the Multiple Traveling Salesman Problem", Materials Science Forum, Vols. 626-627, pp. 717-722, 2009
Online since
August 2009
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zhi Gang Zhou
Abstract:Combined with the idea of the particle swarm optimization (PSO) algorithm, the ant colony optimization (ACO) algorithm is presented to solve...
1354
Authors: Ai Jia Ouyang, Yong Quan Zhou
Abstract:In this paper, an improved particle swarm optimization-ant colony algorithm (PSO-ACO) is presented by inserting delete-crossover strategy...
1154
Authors: Li Huo, Bo Jiang, Tao Ning
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:A new algorithm for TSP which is an improved ACO combined with MMAS and CSDT is proposed. MMAS can prevent the search from local optimum and...
1504