Review of Traveling Salesman Problem for the genetic algorithms

  • Blerina Zanaj Department of Mathematics and Informatics, Agricultural University of Tirana, Albania
  • Elma Zanaj Departament of Electronics and Telecommunications, Polytechnic University of Tirana, Albania
Keywords: Genetic algorithms, TSP, crossover, mutation, selection.

Abstract

Genetic Algorithms (GAs) are an evolutionary technique that uses the operators like mutation, crossover and the selection of the most fitted element as solution for problems optimization. The Traveling Salesman Problem (TSP) finds a path with minimal length, closed within a weighted graph in all its nodes and it visits each of them once. This problem is found in many real world applications and where a good solution might help. There are applied many methods for finding a solution for the TSP, but during this study GAs are used as an approximate method of TSP.

Downloads

Download data is not yet available.

References

Falkenauer E. (1998). Genetic Algorithms and Grouping Problems. John Wiley and Sons.

David E. Goldberg (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.

Homaifar A., Guan Sh., and E. Liepins G. (1992).Schema analysis of the traveling salesman problem using genetic algorithms. Complex Systems.

Jog P., Y. Suh J., and Van Gucht D. (1991) Parallel genetic algorithms applied to the traveling salesman problem. SIAM Journal of Optimization.

Junger M., Thienel S., and Reinelt G.(1994). Provably good solutions for the traveling salesman problem. Mathematical Methods of Operations Research.

Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. (1986) The Traveling Salesman. John Wiley and Sons.

Michalewicz Z..(1994) Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 2nd edition.

Reinelt G.(1994) The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag.

Wroblewski J. (1996). Theoretical foundations of order-based genetic algorithms. Fundament Informatica.

Gen M., Cheng R. (2000) Genetic.Algorithms and Engineering.Optimization.Wiley

Mitchell M. (1991) An Introduction to Genetic Algorithms. 5ed.

Affenzeller M., S Wagner, S Winkler, A Beham (2009) Genetic Algorithms and Genetic Programming. Crc Press.

Haupt R.L. and Haupt S.E. (2004) Practical Genetic Algorithms. 2ed. Wiley

http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

Published
2016-07-01
How to Cite
Zanaj, B., & Zanaj, E. (2016). Review of Traveling Salesman Problem for the genetic algorithms. Journal of Information Sciences and Computing Technologies, 5(3), 534-545. Retrieved from http://scitecresearch.com/journals/index.php/jisct/article/view/829
Section
Articles