Traveling Salesman Problem: A Case Study

In this paper assignment based integer linear formulation presented for solving traveling salesman problem. Unfortunately, the assignment model can lead to infeasible solutions. Infeasibility removes by introducing additional constraints. Then this linear problem solved by open source software. General Terms Optimization technique, Linear Programming, Assignment problem. TSP, combinatorial optimization problem

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

[2]  Chryssi Malandraki,et al.  Time dependent vehicle routing problems : formulations, solution algorithms and computational experiments , 1989 .

[3]  D. E. Goldberg,et al.  Genetic Algorithm in Search , 1989 .

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

[5]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[6]  Nikolaos V. Sahinidis,et al.  Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem , 1995, Transp. Sci..

[7]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[8]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[10]  In-Chan Choi,et al.  A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem , 2003, Comput. Oper. Res..

[11]  Sanghamitra Bandyopadhyay,et al.  New operators of genetic algorithms for traveling salesman problem , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

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

[13]  Moustapha Diaby,et al.  The traveling salesman problem: A Linear programming formulation of , 2006, ArXiv.

[14]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[15]  P. Ji,et al.  The Traveling Salesman and the Quadratic Assignment Problems : Integration , Modeling and Genetic Algorithm , 2006 .

[16]  Shlomi Dolev,et al.  Optical solution for bounded NP-complete problems. , 2007, Applied optics.

[17]  C. Ding,et al.  Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs , 2007 .

[18]  Buthainah Fahran Al-Dulaimi,et al.  Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA) , 2008 .

[19]  Z H Ahmed,et al.  GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM USING SEQUENTIAL CONSTRUCTIVE CROSSOVER , 2010 .

[20]  W. Marsden.  I and J , 2012 .