Published July 21, 2007
| Version 4895
Journal article
Open
Genetic Algorithms with Oracle for the Traveling Salesman Problem
Description
By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms.
Files
4895.pdf
Files
(887.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:6c79aee0a941a10ae50ab779d6b4930f
|
887.8 kB | Preview Download |
Additional details
References
- Robin Gremlich, Andreas Hamfelt, and Vladislav Valkovsky, "Prediction of the Optimal Decision Distribution for the Traveling Salesman Problem", Proceedings of IPSI International Conf., Sveti Stefan, Montenegro, 2004.
- Papadimitriou C.H., Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice Hall, 1982.
- http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/
- Gutin, Punnen (eds.), The Travelling Salesman Problem and its Variations, Kluwer Academic Publishers, 2002.
- http://www.tsp.gatech.edu/
- http://en.wikipedia.org/wiki/Genetic_algorithm
- http://tracer.ull.es/academic/Travelling_Salesman_Problem.html
- http://en.wikipedia.org/wiki/Local_optimum
- http://en.wikipedia.org/wiki/Nearest_neighbour_algorithm