A new hybrid genetic and simulated annealing algorithm to solve the traveling salesman problem

WCE 2010 - World Congress on Engineering 2010

Volumn 1, Issue , 2010, Pages 11-14

  Elhaddad, Younis ^a   Sallabi, Omar ^a  

^a UNIVERSITY OF BENGHAZI   (Libyan Arab Jamahiriya)

Author keywords

Genetic algorithm; Simulated annealing; Traveling salesman problem

Indexed keywords

BENCHMARK DATASETS; HYBRID ALGORITHMS; HYBRID GENETIC; LOCAL MINIMUMS; NP-HARD; TRAVELING SALESMAN;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

SIMULATED ANNEALING;

EID: 79959843491     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. P. Larranaga, C.M.H. Kuupers, R.H. Murga, I. Inza and S. Dizdarevic. "Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators," 1999.
2. P. Merz and B. Freisleben. "Genetic Local Search for the TSP:New results" in proceeding of the IEEE International Conference on Evolutionary Computation, pp,159-164,IEEE Press,1977.
3. S. Ray, S. Bandyopadhyay and S.K. Pal. "Genetic operators for combinatorial optimization in TSP and microarray gene ordering," Springer Science + Business Media, LLC, 2007.
4. J. Holland "Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence," The University of Michigan Press, 1975.
5. Y. Habib, M. Sait and H. Adiche, "Evolutionary algorithms, simulated annealing and tabu search: a comparative study," Engineering Applications of Artificial Intelligence 14, pp. 167-181, 2001
6. TSPLIB: http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html
7. J. Zhang and C. Tong. "Solving TSP with Novel Local Search Heuristic Genetic Algorithms" Fourth International Conference on Natural Computation IEEE 2008