Applying non-revisiting genetic algorithm to traveling salesman problem

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 2217-2224

  Yuen, Shiu Yin ^a   Chow, Chi Kin ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS;

ADAPTIVE MUTATIONS; AUTOMATIC MECHANISMS; BENCH MARKS; COMBINATORIAL OPTIMIZATION PROBLEMS; DIVERSITY MAINTENANCES; MUTATION OPERATORS; PREMATURE CONVERGENCES; REAL WORLDS; SUPERIOR PERFORMANCES; TEST FUNCTIONS; TRAVELING SALESMAN;

TRAVELING SALESMAN PROBLEM;

EID: 55749096202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4631093     Document Type: Conference Paper

References (21)

1. S.Y. Yuen and C.K. Chow, "A Non-revisiting genetic algorithm," in Proc. of IEEE CEC Conf., pp. 4583-4590, 2007.
2. F. Glover and M. Laguna, Tabu search, Kluwer Academic Publishers, 1997.
3. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. on Evolutionary Computation, vol. 1, no. 1, pp. 67-82, 1997.
4. A.E. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms", IEEE Transactions on Evolutionary Computation, vol. 3(2), pp. 124-141, 1999.
5. F.G. Lobo, C.F. Lima and Z. Michalewicz (Eds.), Parameter setting in evolutionary algorithms, Springer, 2007.
6. A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing, Springer 2003.
7. M. L. Mauldin, "Maintaining diversity in genetic search," Proc. National Conference on Artificial Intelligence, pp. 247-250, 1984.
8. L. Davis, Handbook of genetic algorithms, Van Nostrand Reinhold, New York, 1991.
9. T. Friedrich, N. Hebbinghaus and F. Neumann, "Rigorous analyses of simple diversity mechanisms," Proc. GECCO, July 2007.
10. S. Ronald, "Duplicate genotypes in a Genetic algorithm," In Proc. IEEE Int. Conf. on Evolutionary Computation, pp. 793-98, 1998.
11. R. J. Povinelli and X. Feng, "Improving genetic algorithms performance by hashing fitness values," Proc. Artificial Neural Networks in Engineering, pp. 399-404, 1999.
12. J. Kratica, "Improving performances of the genetic algorithm by caching," Computers and Artificial Intelligence, vol. 18, no. 3, pp. 271-283, 1999.
13. nd Int. Conf. on Genetic Algorithms, Lawrence Erlbaum, pp. 41-49, 1987.
14. E. Alba and M. Tomassini, "Parallelism and evolutionary algorithms," IEEE Trans. Evolutionary Computation, vol. 6, no. 5, pp. 443-462, 2002.
15. rd Ed., 2004.
16. H.D. Nguyen, I. Yoshihara, K. Yamamori and M. Yasunaga, "Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems," IEEE Trans. on Systems, Man and Cybernetics, part B, vol. 37, no. 1, pp. 92-99, Feb. 2007.
17. TSPLIB homepage: http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib. html
18. J. H. Holland, Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, 1975.
19. W. Banzhaf, "The "Molecular" Traveling Salesman," Biological Cybernetics, vol. 64, pp. 7-147, 1990.
20. Z. Michalewicz, Genetic Algorithm + Data Structure = Evolution Programs. Springer Verlag, Berlin Heidelberg, 1992.
21. nd Ed. 2000.