A probabilistic memetic framework

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 3, 2009, Pages 604-623

  Nguyen, Quang Huy ^a   Ong, Yew Soon ^a   Lim, Meng Hiot ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Hybrid genetic algorithm local search (GA LS); Memetic algorithm (MA); Probabilistic evolutionary algorithms

Indexed keywords

BENCH-MARK PROBLEMS; CULTURAL ALGORITHM; EMPIRICAL STUDIES; GENETIC LOCAL SEARCH; GLOBAL OPTIMUM; HIGH-QUALITY SOLUTIONS; HYBRID GENETIC ALGORITHM-LOCAL SEARCH (GA-LS); INDIVIDUAL LEARNING; LOCAL SEARCH; MEMETIC; MEMETIC ALGORITHM (MA); MEMETIC ALGORITHMS; PROBABILISTIC EVOLUTIONARY ALGORITHMS; REAL-WORLD PROBLEM; RECENT STATE; SEARCH PERFORMANCE; UPPER BOUND;

EDUCATION; PROBABILISTIC LOGICS;

GENETIC ALGORITHMS;

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

References (56)

1. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Sci., vol. 220, no. 4598, pp. 671-680, 1983.
2. T. Back, F. Hoffmeister, and H. Schwefel, "Survey of Evolution Strategies," in Proc. 4th Int. Con. Genetic Algorithms, 1991, pp. 2-9.
3. L. Davis, Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991.
4. Z. Michalewicz, Genetic Algorithms + Data Structures = Evol. Programs 2nd ed. New York: Springer-Verlag 1994.
5. A. Auger and N. Hansen, "Reconsidering the progress rate theory for evolution strategies in finite dimensions," in Proc. Genetic Evol. Comput. Conf. (GECCO 2006), pp. 445-452.
6. Y. S. Ong and A. J. Keane, "Meta-lamarckian learning in memetic algorithms," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 99-110, Apr. 2004.
7. A. Torn and A. Zilinskas, Global Optimization. LNCS vol. 350, New York: Springer-Verlag, 1989.
8. P. Moscato, "On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms," Caltech Concurrent Computation Program, Publication Report 790, 1989.
9. C. Houck, J. Joines, and M. Kay, "Utilizing lamarckian evolution and the baldwin effect in hybrid genetic algorithms," Meta-Heuristic Research and Applicat. Group, Depart. Ind. Eng., North Carolina State Univ., Raleigh, CA, NCSU-IE Tech. Report 96-01, 1996.
10. A. Vicini and D. Quagliarella, "Airfoil and wing design using hybrid optimization strategies," Amer. Inst. Aeronautics Astronautics J. vol. 37, no. 5, pp. 634-641, 1999.
11. Y. S. Ong, P. B. Nair, and A. J. Keane, "Evolutionary optimization of computationally expensive problems via surrogate modeling," Amer. Inst. Aeronautics Astronautics J., vol. 41, no. 4, pp. 687-696, 2003.
12. Z. Z. Zhou, Y. S. Ong, P. B. Nair, A. J. Keane, and K. Y. Lum, "Combining global and local surrogate models to accelerate evolutionary optimization," IEEE Trans. Syst., Man Cybern., Part C: Applicat. Rev., vol. 37, no. 1, pp. 66-76, Jan. 2007.
13. W. E. Hart, "Adaptive global optimization with local search," Ph.D. thesis, Dept. Comput. Sci. Eng., Univ. California, San Diego, 1994.
14. K. W. C. Ku, M. W. Mak, and W. C. Siu, "A study of the lamarckian evolution of recurrent neural networks," IEEE Trans. Evol. Comput. vol. 4, no. 1, pp. 31-42, Apr. 2000.
15. M. W. S. Land, "Evol. algorithms with local search for combinatorial optimization," Ph.D. thesis, Dept. Comput. Sci., Univ. California, San Diego, 1998.
16. N. K. Bambha, S. S. Bhattacharyya, J. Teich, and E. Zitzler, "Systematic integration of parameterized local search in evolutionary algorithm," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 137-155, Apr. 2004.
17. D. E. Goldberg and S. Voessner, "Optimizing global-local search hybrids," in Proc. GECCO '99, vol. 1. San Francisco, CA: Morgan Kaufmann, 1999, pp. 220-228.
18. A. Sinha, Y. Chen, and D. E. Goldberg, "Designing Efficient Genetic and Evolutionary Algorithm Hybrids," in Recent Advances Memetic Algorithms, New York: Springer-Verlag, 2005.
19. X. Yao, "Simulated annealing with extended neighbourhood," Int. J. Com. Math., vol. 40, pp. 169-189, 1999.
20. N. Krasnogor and J. Smith, "A memetic algorithm with self-adaptive local search: TSP as a case study," in Proc. Genetic Evol. Comput. Conf. (GECCO-2000), San Francisco, CA: Morgan Kaufman, 2000, pp. 987-994.
21. N. Krasnogor and J. Smith, "A tutorial for competent memetic algorithms: Model, taxonomy, and design issues," IEEE Trans. Evol. Comput., vol. 9, no. 5, pp. 474-488, Oct. 2005.
22. Y. S. Ong, M. H. Lim, N. Zhu, and K. W. Wong, "Classification of adaptive memetic algorithms: A comparative study," IEEE Trans. Syst., Man Cybern., Part B: Cybern., vol. 36, no. 1, pp. 141-152, Feb. 2006.
23. N. Noman and H. Iba, "Accelerating differential evolution using an adaptive local search," IEEE Trans. Evol. Comput., vol. 12, no. 1, pp. 107-125, Feb. 2008.
24. M. Lozano, F. Herrera, N. Krasnogor, and D. Molina, "Real-coded memetic algorithms with crossover hill-climbing," Evol. Comput. J., vol. 12, no. 3, pp. 273-302, 2004.
25. Y. S. Ong, N. Krasnogor, and H. Ishibuchi, "Special Issue on Memetic Algorithm," IEEE Trans. Syst., Man Cybern., Part B: Cybern., vol. 37, no. 1, pp. 2-5, Feb. 2007.
26. Y. S. Ong, M. H. Lim, F. Neri, and H. Ishibuchi, "Special issue on emerging trends in soft computing: Memetic algorithms," Soft Comput.-A Fusion Found., Methodologies Applicat., vol. 13, no. 8-9, pp. 1-2, Jul. 2009.
27. J. E. Smith, "Co-evolving memetic algorithms: A review and progress report," IEEE Trans. Syst., Man Cybern., Part B: Cybern., vol. 37, no. 1, pp. 6-17, Feb. 2007.
28. A. Caponio, G. L. Cascella, F. Neri, N. Salvatore, and M. Sumne, "A fast adaptive memetic algorithm for online and offline control design of pmsm drives," IEEE Trans. Syst., Man Cybern., Part B: Cybern., vol. 37, no. 1, pp. 28-41, Feb. 2007.
29. D. Liu, K. C. Tan, C. K. Goh, and W. K. Ho, "A multiobjective memetic algorithm based on particle swarm optimization," IEEE Trans. Syst., Man Cybern., Part B: Cybern., vol. 37, no. 1, pp. 42-50, Feb. 2007.
30. M. Tang and X. Yao, "A memetic algorithm for VLSI floorplanning," IEEE Trans. Syst., Man Cybern., Part B: Cybern., vol. 37, no. 1, pp. 62-69, Feb. 2007.
31. J. Tang, M. H. Lim, and Y. S. Ong, "Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems," Soft Comput. J., vol. 11, no. 9, pp. 873-888, Jul. 2007.
32. Z. Zhu, Y. S. Ong, and M. Dash, "Wrapper-filter feature selection algorithm using a memetic framework," IEEE Trans. Syst., Man Cybern., Part B: Cybern., vol. 37, no. 1, pp. 70-76, Feb. 2007.
33. 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. 1996.
34. G. A. Croes, "A method for solving traveling salesman problems," Operations Res., vol. 6, no. 6, pp. 791-812, Nov.-Dec. 1958.
35. H. P. Schwefel, Evolution and Optimum Seeking. New York: Wiley, 1995.
36. J. A. Nelder and R. Meade, "A simplex method for function minimization," Comput. J., vol. 7, no. 4, pp. 308-313, 1965.
37. M. J. D. Powell, "An efficient method for finding the minimum of a function of several variables without calculating derivatives," Comput. J., vol. 7, no. 4, pp. 303-307, 1964.
38. C. Zhu, R. H. Byrd, and J. Nocedal, "L-BFGS-B: Algorithm 778: L-BFGS-B, FORTRAN routines for large scale bound constrained optimization," ACM Trans. Math. Software, vol. 23, no. 4, pp. 550-560, 1997.
39. M. D. McKay, R. J. Beckman, and W. J. Conover, "A comparison of three methods for selecting values of input variables in the analysis of output from a computer code," Technometrics, vol. 21, no. 2, pp. 239-245, 1979.
40. R. Storn. Differential Evolution for Continuous Optimization [Online]. Available: http://www.icsi.berkeley.edu
41. H. Beyer and H. Schwefel, "Evolution strategies - A comprehensive introduction," Natural Comput., vol. 1, no. 1, pp. 3-52, Mar. 2002.
42. J. J. Liang, P. N. Suganthan, and K. Deb, "Novel composition test functions for numerical global optimization," in Proc. IEEE Swarm Intell. Symp., 2005, pp. 68-75.
43. C. Garca-Martnez and M. Lozano, "Hybrid real-coded genetic algorithms with female and male differentiation," in Proc. IEEE Congr. Evol. Comput., vol. 1. Edinburgh, U.K., 2005, pp. 896-903.
44. D. Molina, F. Herrera, and M. Lozano, "Adaptive local search parameters for real-coded memetic algorithms," in Proc. IEEE Congr. Evol. Comput., vol. 1. Edinburgh, U.K., 2005, pp. 888-895.
45. J. J. Liang and P. N. Suganthan, "Dynamic multi-swarm particle swarm optimizer with local search," in Proc. IEEE Congr. Evol. Comput., vol. 1. Edinburgh, U.K., 2005, pp. 522-528.
46. B. Yuan and M. Gallagher, "Experimental results for the special session on real-parameter optimization at CEC 2005: A simple, continuous EDA," in Proc. 2005 Congr. Evol. Comput. (CEC'05), pp. 1792-1799.
47. N. Noman and H. Iba, "Enhancing differential evolution performance with local search for high dimensional function optimization," in Proc. 2005 Congr. Evol. Comput. (CEC'05), pp. 967-974.
48. A. Auger and N. Hansen, "A restart CMA evolution strategy with increasing population size," in Proc. 2005 Congr. Evol. Comput. (CEC'05), pp. 1769-1776.
49. X. Yao and Y. Liu, "Fast evolution strategies," Control Cybern., vol. 26, no. 3, pp. 467-496, 1997.
50. X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 82-102, Jul. 1999.
51. Y. W. Leung and Y. Wang, "An orthogonal genetic algorithm with quantization for numerical optimization," IEEE Trans. Evol. Comput. vol. 5, no. 1, pp. 41-53, Feb. 2001.
52. J. T. Tsai, T. K. Liu, and J. H. Chou, "Hybrid Taguchi-genetic algorithm for global numerical optimization," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 365-377, Apr. 2004.
53. M. H. Lim, S. Gustafson, N. Krasnogor, and Y. S. Ong, "Editorial to the first issue," Memetic Comput., vol. 1, no. 1, pp. 1-2, Mar. 2009.
54. I. Paenke, Y. Jin, and J. Branke, "Balancing population-and individual-level adaptation in changing environments," Adaptive Behavior, vol. 17, no. 2, pp. 153-174, 2009.
55. G. Gutin and D. Karapetyan, "A selection of useful theoretical tools for the design and analysis of optimization heuristics," Memetic Comput., vol. 1, no. 1, pp. 25-34, Mar. 2009.
56. S. Hasan, R. Sarker, D. Essam, and D. Cornforth, "Memetic algorithms for solving job-shop scheduling problems," Memetic Comput., vol. 1, no. 1, pp. 69-83, Mar. 2009.