A genetic algorithm that adaptively mutates and never revisits

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 2, 2009, Pages 454-472

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

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Adaptive mutation; Binary space partitioning; Diversity maintenance; Genetic algorithm; No revisits; Premature convergence

Indexed keywords

ADAPTIVE MUTATION; BINARY SPACE PARTITIONING; DIVERSITY MAINTENANCE; NO REVISITS; PREMATURE CONVERGENCE;

COVARIANCE MATRIX; GENETIC ALGORITHMS; KNOWLEDGE BASED SYSTEMS; MAINTENANCE; PARTICLE SWARM OPTIMIZATION (PSO); PARTITIONS (BUILDING);

CONVERGENCE OF NUMERICAL METHODS;

EID: 67349219650     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2008.2003008     Document Type: Article

References (33)

1. F. Glover and M. Laguna, Tabu search. Norwell, MA: Kluwer, 1997.
2. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.
3. J. H. Holland, Adaptation in natural and artificial systems. Ann Arbor, MI: Univ. of Michigan Press, 1975.
4. A. E. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 124-141, Jul. 1999.
5. Parameter setting in evolutionary algorithms, G. F. Lobo, C. F. Lima, and Z. Michalewicz, Eds. New York: Springer, 2007.
6. A. E. Eiben and J. E. Smith, Introduction to evolutionary computing New York: Springer, 2003.
7. M. L. Mauldin, "Maintaining diversity in genetic search," in Proc. National Conf. Artif. Intell., 1984, pp. 247-250.
8. L. Davis, Handbook of genetic algorithms. New York: Van Nostrand Reinhold, 1991.
9. T. Friedrich, N. Hebbinghaus, and F. Neumann, "Rigorous analyses of simple diversity mechanisms," in Proc. Genetic Evol. Comput. Conf. Jul. 2007, pp. 1219-1225.
10. S. Ronald, "Duplicate genotypes in a genetic algorithm," in Proc. IEEE Int. Conf. Evol. Comput., 1998, pp. 793-798.
11. R. J. Povinelli and X. Feng, "Improving genetic algorithms performance by hashing fitness values," in Proc. Artif. Neural Netw. Eng., 1999, pp. 399-404.
12. J. Kratica, "Improving performances of the genetic algorithm by caching," Comput. Artif. Intell., vol. 18, no. 3, pp. 271-283, 1999.
13. D. E. Goldberg and J. Richardson, "Genetic algorithms with sharing for multimodal function optimization," in Proc. Int. Conf. Genetic Algorithms, Lawrence Erlbaum, 1987, pp. 41-49.
14. E. Alba and M. Tomassini, "Parallelism and evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, no. 5, pp. 443-462, 2002.
15. N. Hansen and A. Ostermeier, "Completely derandomized self-adaptation in evolutionary strategies," Evol. Comput., vol. 9, no. 2, pp. 159-195, 2001.
16. C. K. Chow, H. T. Tsui, and T. Lee, "Surface registration using a dynamic genetic algorithm," Pattern Recognition, vol. 37, no. 1, pp. 105-117, 2004.
17. K. F. Fong, V. I. Hanby, and T. T. Chow, "HVAC system optimization for energy management by evolutionary programming," Energy and Buildings vol. 38, no. 3, pp. 220-231, 2006.
18. I. Wegener, Complexity theory. New York: Springer, 2005.
19. P. V. Beek, "Backtracking search algorithms," in Handbook of Constraint Programming, F. Rossi, P. Beek, and T. Walsh, Eds. New York: Elsevier, 2006.
20. A. Plaat, J. Schaeffer, W. Pijls, and A. Debruin, "Best-first fixed-depth minimax algorithms," Artif. Intell., vol. 87, no. 1-2, pp. 255-293, 1996.
21. S. Y. Yuen and C. K. Chow, "A non-revisiting simulated annealing," in Proc. IEEE Congr. Evol. Comput., 2008, pp. 1886-1892.
22. C. K. Chowand S. Y. Yuen, "A non-revisiting particle swarm optimization," in Proc. IEEE Congr. Evol. Comput., 2008, pp. 1879-1885.
23. S. Y. Yuen and C. K. Chow, "A non-revisiting genetic algorithm," in Proc. IEEE Congr. Evol. Comput., 2007, pp. 4583-4590.
24. D. Hearn and M. P. Baker, Computer Graphics with OpenGl, 3rd Ed ed. Upper Saddle River, NJ: Prentice-Hall, 2004.
25. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational geometry, algorithms and applications, 2nd Ed ed. New York: Springer, 2000.
26. X. Yao, Y. Liu, and G. M. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 82-102, Apr. 1999.
27. P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger, and S. Tiwari, "Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization," Nanyang Technological Univ., Singapore, 2005, Tech. Rep..
28. X. F. Xie, W. J. Zhang, and Z. L. Yang, "A dissipative particle swarm optimization," in Proc. IEEE Congr. Evol. Comput., 2002, pp. 1666-1670.
29. T. Krink, J. S. Vesterstrom, and J. Riget, "Particle swarm optimization with spatial particle extension," in Proc. IEEE Congr. Evol. Comput. 2002, pp. 1474-1497.
30. J. Liu, X. Fan, and Z. Qu, "An improved particle swarm optimization with mutation based on similarity," in Proc. IEEE Int. Conf. Natural Comput., 2007, pp. 824-828.
31. N. Hansen, "The CMA evolutionary strategy: A tutorial," 2007 [Online]. Wvailable: Link: www.bionik.tu-berlin.de/user/niko/ cmatutorial.pdf
32. C. W. Sung and S. Y. Yuen, "On the analysis of the (1 + 1) evolutionary algorithm with short-term memory," in Proc. IEEE Congr. Evol. Comput., Jun. 2008, pp. 235-241.
33. S. Y. Yuen and C. K. Chow, "Applying non-revisiting genetic algorithm to traveling salesman problem," in Proc. IEEE Congr. Evol. Comput. Jun. 2008, pp. 2217-2224.