Solving the traveling salesman problem through genetic algorithms with changing crossover operators

Proceedings - ICMLA 2005: Fourth International Conference on Machine Learning and Applications

Volumn 2005, Issue , 2005, Pages 319-324

  Takahashi, Ryouei ^a  

^a HACHINOHE INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Changing crossover operators; GAs; TSP

Indexed keywords

CHANGING CROSSOVER OPERATORS; CHANGING CROSSOVER OPERATORS (CXO);

C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 33847312342     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2005.58     Document Type: Conference Paper

References (12)

1. J. H. Holland, Adaptation in Natural and Artificial Systems, Univ. of Michigan Press (1975), MIT Press (1992).
2. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, Inc., 1989.
3. J. Grefenstette, R. Gopal, B. Rosmaita, D. Van Gucht, "Genetic Algorithms for the Traveling Salesman Problem", Proc. of 1 st Int. Conf. on Genetic Algorithms and Their Applications, pp.160 -168, 1985.
4. I. M. Oliver, D. J. Smith, and J. R. C. Holland, "A Study of Permutation Crossover Operations on the Traveling Salesman Problem", Proc. Of 2nd Int. Conf. on Genetic Algorithms, pp. 224- 230, 1987.
5. L. Davis, "Applying Adaptive Algorithms to Epistatic Domains", Proc. Of 9th Int. Joint Conf. on Artificial Intelligence, pp. 162-164, 1985.
6. D. Whitley, T. Starkweather and D'Ann Fuquary, "Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operation", Proc. of 3rd Int. Conf. on Genetic Algorithms, pp. 133-140 (1989).
7. M. Yamamura, I. Ono and S. Kobayashi, "Emergent Search on Double Circle TSPs using Subtour Exchange Crossover", Proc. of 1996 IEEE Int. Conf. on Evolutionary Computation, pp.535-540 (1996).
8. K. Maekawa, N. Mori, H. Tamaki, H. Kita and Y. Nishikawa, "A Genetic Solution for the Traveling Salesman Problem by means of a Thermodynamical Selection Rule", Proceedings of the 1996 IEEE International Conference on Evolutionary Computation (ICEC'96), pp. 529-534, 1996.
9. M. Garey, and D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H Freeman and Company, 1979.
10. S. J. Russell and P. Norvig, Artificial Intelligence - A Modern Approach, Prentice Hall, Upper Saddle River, New Jersey, 1995.
11. R. L. Haupt and S. E. Haupt, Practical Genetic Algorithms, John Wiley & Sons, Inc., 2004.
12. E. Aarts and J. K. Lenstra, Local Search in Combinatorial Optimization, Princeton University Press, 2003.