Bio-inspired Algorithms for TSP and Generalized TSP

The Traveling Salesman Problem (TSP) is to find a Hamiltonian tour of minimal length on a fully connected graph. The TSP is a NP-Complete, and there is no polynomial algorithm to find the optimal result. Many bio-inspired algorithms has been proposed to address this problem. Generally, generic algorithm (GA), ant colony optimization (ACO) and particle swarm optimization (PSO) are three typical bio-inspired algorithm for TSP. In this section we will give a brief introduction to the above three bio-inspired algorithms and their application to the TSP.

[1]  L. Darrell Whitley,et al.  Advanced Correlation Analysis of Operators for the Traveling Salesman Problem , 1994, PPSN.

[2]  Walter J. Gutjahr,et al.  ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

[3]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[4]  Li Liao,et al.  Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem , 2007, 2007 IEEE International Conference on Automation and Logistics.

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Bernd Freisleben,et al.  Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..

[7]  L. Darrell Whitley,et al.  Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem , 1992, PPSN.

[8]  Stefka Fidanova.  Convergence Proof for a Monte Carlo Method for Combinatorial Optimization Problems , 2004, International Conference on Computational Science.

[9]  Toshio Fukuda,et al.  Virus-evolutionary genetic algorithm for a self-organizing manufacturing system , 1996 .

[10]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[12]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[13]  Bin Shen,et al.  Heuristic Information Based Improved Fuzzy Discrete PSO Method for Solving TSP , 2006, PRICAI.

[14]  Shigenobu Kobayashi,et al.  Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.

[15]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[16]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[17]  Károly F. Pál,et al.  Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation , 1993, Biological Cybernetics.

[18]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[19]  Byung-Ro Moon,et al.  The natural crossover for the 2D Euclidean TSP , 2000 .

[20]  Mitsuo Gen,et al.  Resource Constrained Project Scheduling Problem using Genetic Algorithms , 1997, Intell. Autom. Soft Comput..

[21]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

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

[23]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[24]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[25]  Chunguo Wu,et al.  Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[27]  Isao Ono,et al.  Emergent search on double circle TSPs using subgour exchange crossover , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

[29]  Funda Samanlioglu,et al.  A hybrid random-key genetic algorithm for a symmetric travelling salesman problem , 2007 .

[30]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[31]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[32]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[33]  Hiroaki SENGOKU,et al.  A Fast TSP Solver Using GA on JAVA , 1999 .

[34]  Funda Samanlioglu,et al.  A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem , 2008, Comput. Ind. Eng..

[35]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[36]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[37]  Jacques Renaud,et al.  An efficient composite heuristic for the symmetric generalized traveling salesman problem , 1998, Eur. J. Oper. Res..

[38]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[39]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[40]  P. W. Poon,et al.  Genetic algorithm crossover operators for ordering applications , 1995, Comput. Oper. Res..

[41]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[42]  L. Darrell Whitley,et al.  A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[43]  Yong Qin,et al.  An ACO Algorithm with Adaptive Volatility Rate of Pheromone Trail , 2007, International Conference on Computational Science.

[44]  Riccardo Poli,et al.  Particle Swarm Optimisation , 2011 .

[45]  Ahmed Fahmy,et al.  A proof of convergence for Ant algorithms , 2004, Inf. Sci..

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

[47]  Cliff T. Ragsdale,et al.  A new approach to solving the multiple traveling salesperson problem using genetic algorithms , 2006, Eur. J. Oper. Res..

[48]  K. Katayama,et al.  The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem , 2000 .

[49]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

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

[51]  Zhifeng Hao,et al.  ACO for Continuous Optimization Based on Discrete Encoding , 2006, ANTS Workshop.

[52]  Xiaowei Yang,et al.  A Novel ACO Algorithm with Adaptive Parameter , 2006, ICIC.

[53]  Gunar E. Liepins,et al.  Greedy Genetics , 1987, ICGA.

[54]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[55]  Liangsheng Qu,et al.  A Synergetic Approach to Genetic Algorithms for Solving Traveling Salesman Problem , 1999, Inf. Sci..

[56]  Mitsuo Gen,et al.  Crossover on intensive search and traveling salesman problem , 1994 .

[57]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[58]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[59]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for TSP , 2006 .

[60]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[61]  Moritoshi Yasunaga,et al.  Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[62]  Godfrey C. Onwubolu,et al.  New optimization techniques in engineering , 2004, Studies in Fuzziness and Soft Computing.

[63]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[64]  Stefka Fidanova.  ACO Algorithm with Additional Reinforcement , 2002, Ant Algorithms.

[65]  Han Huang,et al.  Hybrid Chromosome Genetic Algorithm for Generalized Traveling Salesman Problems , 2005, ICNC.

[66]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[67]  Jun Sun,et al.  A new pheromone updating strategy in ant colony optimization , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[68]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[69]  I. Yoshihara,et al.  Modified edge recombination operators of genetic algorithms for the traveling salesman problem , 2000, 2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies.

[70]  Mitsuo Gen,et al.  Film-copy deliverer problem using genetic algorithms , 1995 .

[71]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[72]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

[73]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[74]  Hao Chen,et al.  An Improved Swarm Intelligence Algorithm for Solving TSP Problem , 2007, ICIC.

[75]  Yuichi Nagata,et al.  The EAX Algorithm Considering Diversity Loss , 2004, PPSN.

[76]  Zhifeng Hao,et al.  A Time Complexity Analysis of ACO for Linear Functions , 2006, SEAL.

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

[78]  R Knosala,et al.  A production scheduling problem using genetic algorithm , 2001 .

[79]  Lawrence V. Snyder,et al.  A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..

[80]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[81]  Yasunaga Moritoshi,et al.  Greedy Genetic Algorithms for Symmetric and Asymmetric TSPs (特集 進化的計算) , 2002 .