Discrete Cat Swarm Optimization to Resolve the Traveling Salesman Problem

This research paper presents an adaptation of the cat swarm optimization (CSO) to solve the traveling salesman problem (TSP). This evolutionary algorithm appeared in 2007 by Chu and Tsai for optimization problems in the continuous case. To solve TSP, which is a discrete problem, we will describe the various operators and operations performed in two different modes of this algorithm, which is the searching mode (TM) and the tracing mode (SM). At the end, we will demonstrate the success of the proposed terms.

[1]  Li-Pei Wong,et al.  A Bee Colony Optimization Algorithm for Traveling Salesman Problem , 2008, 2008 Second Asia International Conference on Modelling & Simulation (AMS).

[2]  Yuichi Nagata,et al.  A new genetic algorithm for the asymmetric traveling salesman problem , 2012, Expert Syst. Appl..

[3]  Marco Cesar Goldbarg,et al.  Particle Swarm Optimization Algorithm for the Traveling Salesman Problem , 2008 .

[4]  Zhang Yi,et al.  Application of an Improved Ant Colony Optimization on Generalized Traveling Salesman Problem , 2012 .

[5]  Ricardo Saraiva de Camargo,et al.  A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem , 2013, Electron. Notes Discret. Math..

[6]  Chu-Sing Yang,et al.  A Fast Bee Colony Optimization for Traveling Salesman Problem , 2012, 2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications.

[7]  Chunguo Wu,et al.  Solving traveling salesman problems using generalized chromosome genetic algorithm , 2008 .

[8]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the generalized traveling salesman problem , 2007, GECCO '07.

[9]  Yoonho Seo,et al.  Discrete Optimization An efficient genetic algorithm for the traveling salesman problem with precedence constraints , 2002 .

[10]  TsaiChun-Wei,et al.  A new hybrid heuristic approach for solving large traveling salesman problem , 2004 .

[11]  E. Aarts,et al.  Boltzmann machines for travelling salesman problems , 1989 .

[12]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[13]  Salim Chikhi,et al.  A MODIFIED HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM FOR SOLVING THE TRAVELING SALESMEN PROBLEM , 2012 .

[14]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[15]  Li-Sheng Hu,et al.  A model induced max-min ant colony optimization for asymmetric traveling salesman problem , 2013, Appl. Soft Comput..

[16]  Shyi-Ming Chen,et al.  Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2011, Expert Syst. Appl..

[17]  Kevin Tickle,et al.  Solving the traveling salesman problem using cooperative genetic ant systems , 2012, Expert Syst. Appl..

[18]  James R. A. Allwright,et al.  A distributed implementation of simulated annealing for the travelling salesman problem , 1989, Parallel Comput..

[19]  Li-Pei Wong,et al.  Bee Colony Optimization with local search for traveling salesman problem , 2008, 2008 6th IEEE International Conference on Industrial Informatics.

[20]  Chi-Bin Cheng,et al.  A modified ant colony system for solving the travelling salesman problem with time windows , 2007, Math. Comput. Model..

[21]  Nikbakhsh Javadian,et al.  An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems , 2011, Appl. Soft Comput..

[22]  Bernd Bischl,et al.  Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness , 2012, LION.

[23]  Huilian Fan,et al.  Discrete Particle Swarm Optimization for TSP based on Neighborhood , 2010 .

[24]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[25]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .