Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages

The traveling salesman problem (TSP) is one of the most famous problems. Many applications and programming tools have been developed to handle TSP. However, it seems to be essential to provide easy programming tools according to state-of-theart algorithms. Therefore, we have collected and programmed new easy tools by the three object-oriented languages. In this paper, we present ADT (abstract data type) of developed tools at first; then we analyze their performance by experiments. We also design a hybrid genetic algorithm (HGA) by developed tools. Experimental results show that the proposed HGA is comparable with the recent state-of-the-art applications.

[1]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[2]  Kai Zhao,et al.  Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search , 2011, Appl. Soft Comput..

[3]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[4]  Jon Louis Bentley,et al.  K-d trees for semidynamic point sets , 1990, SCG '90.

[5]  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).

[6]  Kamran Zamanifar,et al.  Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem , 2012, ArXiv.

[7]  Novruz Allahverdi,et al.  Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms , 2011, Expert Syst. Appl..

[8]  Zhou Tao.  TSP Problem Solution Based on Improved Genetic Algorithm , 2008, 2008 Fourth International Conference on Natural Computation.

[9]  Doug Hains,et al.  A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover , 2010, PPSN.

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

[11]  Dervis Karaboga,et al.  A combinatorial Artificial Bee Colony algorithm for traveling salesman problem , 2011, 2011 International Symposium on Innovations in Intelligent Systems and Applications.

[12]  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..

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

[14]  Lionel Amodeo,et al.  A new approach for workshop design , 2011, J. Intell. Manuf..

[15]  Kamran Zamanifar,et al.  Using ants as a genetic crossover operator in GLS to solve STSP , 2010, 2010 International Conference of Soft Computing and Pattern Recognition.

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

[17]  Andrew Lim,et al.  Sexual Selection for Genetic Algorithms , 2003, Artificial Intelligence Review.

[18]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[19]  N. Jawahar,et al.  Iterated fast local search algorithm for solving quadratic assignment problems , 2008 .

[20]  Swagatam Das,et al.  A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem , 2013, Int. J. Bio Inspired Comput..

[21]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[22]  Beatrice M. Ombuki-Berman,et al.  Dynamic vehicle routing using genetic algorithms , 2007, Applied Intelligence.

[23]  Kamran Zamanifar,et al.  Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, Using Symmetric Travelling Salesman Problem , 2013, ArXiv.

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

[25]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[26]  Beatrice M. Ombuki-Berman,et al.  Local Search Genetic Algorithms for the Job Shop Scheduling Problem , 2004, Applied Intelligence.

[27]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

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

[29]  Juan F. Jiménez,et al.  Ant Colony Extended: Experiments on the Travelling Salesman Problem , 2015, Expert Syst. Appl..

[30]  Yong Ming Wang,et al.  Genetic algorithm with new encoding scheme for job shop scheduling , 2009 .

[31]  Bryant A. Julstrom,et al.  Very greedy crossover in a genetic algorithm for the traveling salesman problem , 1995, SAC '95.

[32]  Sanghamitra Bandyopadhyay,et al.  Genetic operators for combinatorial optimization in TSP and microarray gene ordering , 2007, Applied Intelligence.

[33]  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.