Memetic algorithms for continuous optimisation based on local search chains

Evolutionary Computation

Volumn 18, Issue 1, 2010, Pages 27-63

  Molina, Daniel ^a   Lozano, Manuel ^b   García Martínez, Carlos ^c   Herrera, Francisco ^a  

^a UNIVERSITY OF CÁDIZ   (Spain)

^b UNIVERSITY OF GRANADA   (Spain)

^c UNIVERSITY OF CÓRDOBA   (Spain)

Author keywords

Adaptive local search intensity; Continuous local search algorithms; Continuous optimisation; Genetic algorithms; Memetic algorithms

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER SIMULATION; METHODOLOGY; SEARCH ENGINE; THEORETICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; MODELS, THEORETICAL; SEARCH ENGINE;

EID: 77749289802     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2010.18.1.18102     Document Type: Article

References (87)

1. Abramowitz, M. (1974). Handbook of mathematical functions, with formulas, graphs, and mathematical tables. Dover Publications.
2. Auger, A., and Hansen, N. (2005a). A restart CMA evolution strategy with increasing population size. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 1769-1776.
3. Auger, A., and Hansen, N. (2005b). Performance evaluation of an advanced local search evolutionary algorithm. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 1777-1784.
4. Auger, A., Schoenauer, M., and Vanhaecke, N. (2004). LS-CMAES: A second-order algorithm for covariance matrix adaptation. In Proceedings of the Parallel Problem Solving for Nature PPSN VIII, Birmingham, AL.
5. Ballester, P. J., Stephenson, J., Carter, J., and Gallager, K. (2005). Real-parameter optimization performance study on the CEC-2005 benchmark with SPC-PNX. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 498-505.
6. Bambha, N. K., Bhattacharyya, S. S., Teich, J., and Zitzler, E. (2004). Systematic integration of parameterized local search into evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 8(2):137-155.
7. Beyer, H. G., and Deb, K. (2001). On self-adaptive features in real-parameter evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 5(3):250-270.
8. Beyer, H. G., and Schwefel, H. P. (2002). Evolution strategies. Natural Computing, 1:3-52.
9. Bonissone, P. P., Subbu, R., Eklund, N., and Kiehl, T. R. (2006). Evolutionary algorithms + domain knowledge = real-world evolutionary computation. IEEE Transactions on Evolutionary Computation, 10(3):256-280.
10. Burke, E., and Smith, A. (2000). Hybrid evolutionary techniques for the maintenance scheduling problem. IEEE Transactions on Power Systems, 15(1):122-128.
11. Caponio, A., Cascella, G. L., Neri, F., Salvatore, N., and Sumner, M. (2007). A fast adaptive memetic algorithm for online and offline control design of PMSM drives. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 37(1):28-41.
12. Chelouah, R., and Siarry, P. (2003). Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. European Journal of Operational Research, 148(2):335-348.
13. Davis, L. (1991). Handbook of genetic algorithms. New York: Van Nostrand Reinhold.
14. Deb, K., Anand, A., and Joshi, D. (2002). A computationally efficient evolutionary algorithm for real-parameter evolution. Evolutionary Computation Journal, 10(4):371-395.
15. Eshelman, L. J. (1991). The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In G. J. E. Rawlin (Ed.), Foundations of Genetic Algorithms 1 (pp. 265-283). San Mateo, CA: Morgan Kaufmann.
16. Eshelman, L. J., and Schaffer, J. D. (1993). Real-coded genetic algorithms and interval-schemata. In L. D. Whitley (Ed.), Foundations of Genetic Algorithms 2 (pp. 187-202). San Mateo, CA: Morgan Kaufmann.
17. Fernandes, C., and Rosa, A. (2001). A study on non-random mating and varying population size in genetic algorithms using a royal road function. In Proceedings of the 2001 Congress on Evolutionary Computation (pp. 60-66). Piscataway, NJ: IEEE Press.
18. García, S., Molina, D., Lozano, M., and Herrera, F. (2009). A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: A case study on the CEC'2005 special session on real parameter optimization. Journal of Heuristics, 15:617-644.
19. García-Martínez, C., and Lozano, M. (2005). Hybrid real-coded genetic algorithms with female and male differentiation. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 896-903.
20. Goldberg, D. E., and Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins (Ed.), Foundations of genetic algorithms (pp. 69-93). San Mateo, CA: Morgan Kaufmann.
21. Goldberg, D. E., and Voessner, S. (1999). Optimizing global-local search hybrids. In W. Banzhaf et al. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference'99 (pp. 220-228). San Mateo, CA: Morgan Kaufmann.
22. Hansen, N. (2005). Compilation of results on the CEC benchmark function set. Technical Report. Institute of Computational Science, ETH Zurich, Switerland. Retrieved from http://www.ntu.edu.sg/home/epnsugan/indexfiles/CEC-05/compareresults.pdf.
23. Hansen, N., and Kern, S. (2004). Evaluating the CMA evolution strategy on multimodal test functions. In Xin Yao et al. (Eds.), Proceedings of the Parallel Problem Solving for Nature, PPSN VIII, LNCS 3242, pp. 282-291. Berlin: Springer.
24. Hansen, N., Müller, S. D., and Koumoutsakos, P. (2003). Reducing the time complexity of the derandomizedevolutionstrategywithcovariancematrixadaptation(CMA-ES).Evolutionary Computation, 11(1):1-18.
25. Hansen, N., and Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation 9(2):159-195.
26. Hart, W. E. (1994). Adaptive global optimization with local search. Ph.D. Thesis, University of California, San Diego.
27. Hart, W. E., Krasnogor, N., and Smith, J. E. (Eds.). (2004a). Recent advances in memetic algorithms. Studies in Fuzzyness and Soft Computing Series, Vol. 166. Berlin: Springer. New York: Heidelberg.
28. Hart, W. E., Krasnogor, N., and Smith, J. E. (2004b). Editorial introduction special issue on memetic algorithms. Evolutionary Computation, 12(3): v-vi.
29. Hart, W. E., Rosin, C. R., Belew, R. K., and Morris, G. M. (2000). Improved evolutionary hybrids for flexible ligand docking in autodock. In Proceedings of the International Conference on Optimization in Computational Chemistry and Molecular Biology, pp. 209-230.
30. Herrera, F., Lozano, M., and Verdegay, J. L. (1998). Tackling real-coded genetic algorithms: Operators and tools for the behavioral analysis. Artificial Intelligence Review, 12(4):265-319.
31. Houck, C. R., Joines, J. A., Kay, M. G., and Wilson, J. R. (1997). Empirical investigation of the benefits of partial Lamarckianism. Evolutionary Computation, 5(1):31-60.
32. Iman, R. L., and Davenport, J. M. (1980). Approximations of the critical region of the Friedman statistic. Communications in Statistics, 18:571-595.
33. Ishibuchi, H., Yoshida, T., and Murata, T. (2003). Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation, 7(2):204-223.
34. Joines, J. A., and Kay, G. M. (2002). Hybrid genetic algorithms and random linkage. In Proceedings of the 2002 Congress of Evolutionary Computation, pp. 1733-1738. Piscataway, NJ: IEEE Press.
35. Kennedy, J., and Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of the IEEE International Conference of Neural Networks, pp. 1942-1948.
36. Kita, H. (2001). A comparison study of self-adaptation in evolution strategies and real-coded genetic algorithms. Evolutionary Computation, 9(2):223-241.
37. Krasnogor, N. (2002). Studies on the theory and design space of memetic algorithms. Ph.D. Thesis, University of the West of England, Bristol, United Kingdom.
38. Krasnogor, N., and Gustafson, S. (2004). A study on the use of self-generation in memetic algorithms. Natural Computing, 3(1):53-76.
39. Krasnogor, N., and Smith, J. (2000). A memetic algorithm with self-adapting local search: TSP as a case study. In Proceedings of the 2000 International Conference on Genetic and Evolutionary Computation, pp. 987-994. San Mateo, CA: Morgan Kaufmann.
40. Krasnogor, N., and Smith J. E. (2001). Emergence of profitable search strategies based on a simple inheritance mechanism. In Proceedings of the 2001 International Conference on Genetic and Evolutionary Computation, pp. 432-439. San Mateo, CA: Morgan Kaufmann.
41. Krasnogor, N., and Smith, J. E. (2005). A tutorial for competent memetic algorithms: Model, taxonomy, and design issue. IEEE Transactions on Evolutionary Computation, 9(5):474-488.
42. Laguna, M., and Martí, R. (2003). Scatter search. Methodology and implementation in C. Dordrecht, The Netherlands: Kluwer Academic Publishers.
43. Land, M. W. S. (1998). Evolutionary algorithms with local search for combinatorial optimization. Ph.D. Thesis, University of California, San Diego.
44. Langdon, W. B., and Poli, R. (2008). Evolving problems to learn about particle swarm optimizers and other search algorithms. IEEE Transactions on Evolutionary Computation, 11(5):561-578.
45. Lee, C.-Y., and Yao, X. (2004). Evolutionary programming using mutations based on the Levy probability distribution. IEEE Transactions on Evolutionary Computation, 8(1):1-13.
46. Liang, J. J., and Suganthan, P. N. (2005). Dynamic multi-swarm particle swarm optimizer with local search. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 522-528.
47. Liu, D., Tan, K. C., Goh, C. K., and Ho, W. K. (2007). A multiobjective memetic algorithm based on particle swarm optimization. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 37(1):42-50.
48. Lozano, M., Herrera, F., Krasnogor, N., and Molina, D. (2004). Real-coded memetic algorithms with crossover hill-climbing. Evolutionary Computation, 12(3):273-302.
49. Lunacek, M., and Whitley, D. (2006). The dispersion metric and the CMA evolution strategy. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 477-484.
50. Lunacek, M., Whitley, D., and Knight, J. N. (2005). Measuring mobility and the performance of global search algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005), pp. 1209-1216.
51. Merz, P. (2000). Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies. Ph.D. Thesis, University of Siegen, Germany.
52. Molina, D., Herrera, F., and Lozano, M. (2005). Adaptive local search parameters for real-coded memetic algorithms. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 888-895.
53. Moscato, P. A. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report. Caltech Concurrent Computation Program Report 826, Caltech, Pasadena, CA.
54. Moscato, P. A. (1999). Memetic algorithms: A short introduction. In D. Corne, M. Dorigo, and F. Glower (Eds.), New ideas in optimization (pp. 219-234). New York: McGraw-Hill.
55. Moscato, P. A., and Cotta, C. (2003). A gentle introduction to memetic algorithms. In F. Glover and G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 105-144). Dordrecht, The Netherlands: Kluwer Academic Publishers.
56. Mühlenbein, H., and Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm in continuous parameter optimization. Evolutionary Computation, 1:25-49.
57. Mühlenbein, H., Schomisch, M., and Born, J. (1991). The parallel genetic algorithm as function optimizer. In R. Belew and L. B. Booker (Eds.), Fourth International Conference on Genetic Algorithms (pp. 271-278). San Mateo, CA: Morgan Kaufmann.
58. Noman, N., and Iba, H. (2005). Enhancing differential evolution performance with local search for high dimensional function optimization. In Proceedings of the 2005 Conference on Genetic and Evolutionary Computation (GECCO 2005), pp. 967-974.
59. Noman, N., and Iba, H. (2008). Accelerating differential evolution using an adaptive local search. IEEE Transactions on Evolutionary Computation, 12(1):107-125.
60. Nomura, T., and Shimohara, K. (2001). An analysis of two-parent recombinations for real-valued chromosomes in an infinite population. Evolutionary Computation, 9(3):283-308.
61. Ong, Y. S., and Keane, A. J. (2004). Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation, 4(2):99-110.
62. Ong, Y. S., Krasnogor, N., and Ishibuchi, H. (2007). Guest editorial: Special issue on memetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 37(1):2-5.
63. Ong, Y. S., Lim, M.-H., Zhu, N., and Wong, K. W. (2006). Classification of adaptive memetic algorithms: A comparative study. IEEE Transactions on Systems, Man, and Cybernetics, 36(1):141-152.
64. Posik, P. (2005). Real parameter optimisation using mutation step co-evolution. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 872-879.
65. Qin, A.K., and Suganthan, P. N. (2005). Self-adaptive differential evolution algorithm for numerical optimization. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 1785-1791.
66. Renders, J. M., and Bersini, H. (1994). Hybridizing genetic algorithms with hill-climbing methods for global optimization: Two possible ways. In Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 312-317. Piscataway, NJ: IEEE Press.
67. Renders, J. M., and Flasse, S. P. (1996). Hybrid methods using genetic algorithms for global optimization. IEEE Transactions on Systems, Man, and Cybernetics, 26(2):243-258.
68. Ronkkonen, J., Kukkonen, S., and Price, K.V. (2005).Real-parameteroptimizationwithdifferential evolution. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 506-513.
69. Rosin, C. D., Halliday, R. S., Hart, W. E., and Belew, R. K. (1997). A comparison of global and local search methods in drug docking. In T. Bäck (Ed.), Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 221-228. San Mateo, CA: Morgan Kaufmann.
70. Sheskin, D. J. (2003). Handbook of parametric and nonparametric statistical procedures. Boca Raton, FL: CRC Press.
71. Shimodaira, H. (1996). A new genetic algorithm using large mutation rates and population-elitist selection (GALME). In Proceedings of the International Conference on Tools with Artificial Intelligence, pp. 25-32.
72. Sinha, A., Tiwari, S., and Deb, K. (2005). A population-based, steady-state procedure for realparameter optimization. In 2005 IEEE Congress on Evolutionary Computation, pp. 514-521.
73. Smith, J. E. (2007). Coevolving memetic algorithms: A review and progress report. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 37(1):6-17.
74. Solis, F. J., and Wets, R. J.-B. (1981). Minimization by random search techniques. Mathematical Operations Research, 6:19-30.
75. Storn, R., and Price, K. V. (1997). Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4):341-359.
76. Suganthan, P. N., Hansen, N., Liang, J. J., Deb, K., Chen, Y. P., Auger, A., and Tiwari, S. (2005). Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization. Technical Report. Nanyang Technological University. Retrieved from http://www.ntu.edu.sg/home/epnsugan/indexfiles/CEC-05/Tech-Report-May-30-05.pdf.
77. Sywerda, G. (1989). Uniform crossover in genetic algorithms. In Proceedings of the International Conference on Genetic Algorithms, pp. 2-9. San Mateo, CA: Morgan Kaufmann.
78. Tang, J., Lim, M. H., and Ong, Y. S. (2007). Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Computing, 11(9):873-888.
79. Tsutsui, S., Yamamura, M., and Higuchi, T. (1999). Multi-parent recombination with simplex crossover in real-coded genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pp. 657-664. San Mateo, CA: Morgan Kaufmann.
80. Wei, L., and Zhao, M. (2005). A niche hybrid genetic algorithm for global optimization of continuous multimodal functions. Applied Mathematics and Computation, 160(3):649-661.
81. Whitley, D. (1989). The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In Proceedings of the International Conference on Genetic Algorithms, pp. 116-121. San Mateo, CA: Morgan Kaufmann.
82. Whitley, D., Rana, S., Dzubera, J., and Mathias, E. (1996). Evaluating evolutionary algorithms. Artificial Intelligence, 85:245-276.
83. Wolpert, D. H., and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82.
84. Yang, J.-M., and Kao, C.-Y. (2000). Integrating adaptive mutations and family competition into genetic algorithms as function optimiser. Soft Computing, 4:89-102.
85. Yuan, B., and Gallagher, M. (2005). Experimental results for the special session on real-parameter optimization at CEC 2005: A simple, continuous EDA. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 1792-1799.
86. Zar, J. H. (1999). Biostatistical analysis. Englewood, NJ: Prentice Hall.
87. Zhang, C.-K., and Shao, H. H. (2001). A hybrid strategy: Real-coded genetic algorithm and chaotic search. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics 2001, pp. 2361-2364.