A MODIFIED HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM FOR SOLVING THE TRAVELING SALESMEN PROBLEM

The traveling salesman problem (TSP) is a well-known NP-hard combinatorial optimization problem. The problem is easy to state, but hard to solve. Many r eal-world problems can be formulated as instances o f the TSP, for example, computer wiring, vehicle routing, crystallography, robot control, drilling of printe d circuit boards and chronological sequencing. In thi s paper, we present a modified hybrid Particle Swar m Optimization (MHPSO) algorithm in which we combine some principles of Particle Swarm Optimization (PSO), the Crossover operation of the Genetic Algor ithm and 2-opt improvement heuristic. The main feature of our approach is that it allows avoiding a major problem of metaheuristics: the parameters s etting. In the aim to prove the performance and convergence of the proposed algorithm, we have used it to solv e some TSP instances taken from TSPLIB library. Moreover, we have compared our results with those obtained by other algorithms based PSO.

[1]  Ying Zhang,et al.  An Improved Genetic Algorithm for the Traveling Salesman Problem , 2007, ICIC.

[2]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[3]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[4]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[5]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

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

[7]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[8]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[9]  Zhao Hui Li,et al.  An Improved Hybrid Discrete Particle Swarm Optimization Algorithm to Solve the TSP Problem , 2011 .

[10]  P. Balasubramanie,et al.  A Genetic Algorithm with a Tabu Search (GTA) for Traveling Salesman Problem , 2009 .

[11]  M. A. Khanesar,et al.  A novel binary particle swarm optimization , 2007, 2007 Mediterranean Conference on Control & Automation.

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Salim Chikhi,et al.  BPSO Algorithms for Knapsack Problem , 2011, WiMo/CoNeCo.

[17]  Wang Cheng,et al.  Solving traveling salesman problems with time windows by genetic particle swarm optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[18]  Jinglu Hu,et al.  An Improved Discrete Particle Swarm Optimization Based on Cooperative Swarms , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[19]  Qiu Zu-lian,et al.  Particle Swarm Optimization Algorithm Based on the Idea of Simulated Annealing , 2006 .

[20]  Gevork B. Gharehpetian,et al.  Application of particle swarm optimization for distribution feeder reconfiguration considering distributed generators , 2008, Appl. Math. Comput..