An intelligent multi-restart memetic algorithm for box constrained global optimisation

Evolutionary Computation

Volumn 21, Issue 1, 2013, Pages 107-147

  Sun, J ^a   Garibaldi, J M ^a   Krasnogor, N ^a   Zhang, Q ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Estimation ofdistribution algorithm; Global numerical optimisation; Local search,memetic algorithm

Indexed keywords

COMPUTATIONAL COSTS; CONTINUOUS OPTIMISATION; ESTIMATION OF DISTRIBUTION ALGORITHM (EDA); GLOBAL OPTIMISATION; MEMETIC ALGORITHMS; OPTIMISATIONS; PROBABILITY MODELS; RESTART MECHANISM;

GLOBAL OPTIMIZATION; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; THEORETICAL MODEL;

ALGORITHMS; MODELS, THEORETICAL;

EID: 84875031227     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00068     Document Type: Article

References (66)

1. Auger, A., and Hansen, N. (2005). A restart CMA evolution strategy with increasing population size. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC2005), pp. 1769-1776.
2. B̈ack, T. (1996). Evolutionary algorithms in theory and practice. Oxford, UK: Oxford University Press.
3. B̈ack, T., Hammel, U., and Schwefel, H.-P. (1997). Evolutionary computation: Comments on the history and current states. IEEE Transactions on Evolutionary Computation, 1(1):3-17.
4. Bambha, N., Bhattacharyya, S., Teich, J., and Zitzler, E. (2004). Systematic integration of parameterized local search into evolutionary algorithm. IEEE Transactions on Evolutionary Computation, 8(2):137-155.
5. Bergh, F., and Engelbrecht, A. (2004). A cooperative approach to particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3):225-239.
6. Bosman, P. A. N., and Thierens, D. (2000). Expanding from discrete to continuous estimation of distribution algorithms: The IDEA. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel (Eds.), Parallel problem solving from nature, PPSN VI. Lecture notes in computer science, Vol. 1917 (pp. 767-776). Berlin: Springer-Verlag.
7. De Jong, K. (1975). An analysis of behavior of a class of genetic adaptive systems. PhD thesis, The University of Michigan, Ann Arbor, Michigan.
8. Dennis, J., Jr., Gay, D., and Welsch, R. (1981). An adaptive nonlinear least-squares algorithm. ACM Transactions on Mathematical Software, 7(3):348-368.
9. Eiben, A. E., and Smith, J. E. (2003). Introduction to evolutionary computing. Berlin: Springer-Verlag.
10. Fogel, D. B. (Ed.). (1999). Evolutionary computation: The fossil record. New York:Wiley.
11. Glover, F. (1998). Atemplate for scatter search and path relinking. In The Third European Conference on Artificial Evolution. Lecture notes in computer science, Vol. 1363 (pp. 13-54). Berlin: Springer-Verlag.
12. Glover, F., and Laguna, M. (1998). TABU search. Norwell, MA: Kluwer Academic Publishers.
13. Hansen, N., Auger, A., Ros, R., Finck, S., and Posik, P. (2010). Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. In Workshop Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2010). ACM.
14. Hansen, N., Finck, S., Ros, R., and Auger, A. (2009). Real-parameter black-box optimization benchmarking 2009: Noiseless function definitions. (Technical Report RR-6829) INRIA, Orsay Cedex, France.
15. Hansen, N., and Kern, S. (2004). Evaluating the CMA evolution strategy on multimodal test functions. In Parallel problem solving from nature, PPSN VIII, Lecture notes in computer science, Vol. 3242 (pp. 282-291). Berlin: Springer-Verlag.
16. Hansen, N., and Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195.
17. Hart, W. (1994). Adaptive global optimization with local search. PhD thesis, University of California, San Diego, California.
18. Hart, W., Krasnogor, N., and Smith, J. E. (Eds.). (2005). Recent advances in memetic algorithms. Studies in fuzziness and soft computing, Vol. 166. Berlin: Springer-Verlag.
19. Houck, C., Joines, J., Kay, M., and Wilson, J. (1997). Empirical investigation of the benefits of partial lamarckianism. Evolutionary Computation, 5(1):31-60.
20. Houck, C., Joines, J., Kay, M., and Wilson, J. (2004). A study on the use of self-generation in memetic algorithms. Natural Computing, 3(1):53-76.
21. Jones, D. (1995). DIRECT. In R. Horst and P. Pardalos (Eds.), Handbook of Global Optimization. Norwell, MA: Kluwer Academic Publishers.
22. Krasnogor, N. (2009). Memetic algorithms. In G. Rozenberg, T. Back, and J. Kok (Eds.), Handbook of natural computation. Berlin: Springer-Verlag.
23. Krasnogor, N., Aragon, A., and Pacheco, J. (2006). Memetic algorithms. In Metaheuristics in neural networks learning. Berlin: Springer-Verlag.
24. Krasnogor, N., and Smith, J. (2000). A memetic algorithm with self-adaptive local search: TSP as a case study. In L. D. Whitley, D. E. Goldberg, E. Cantu-Paz, L. Spector, andH.-G. Beyer (Eds.), Proceedings of Genetic and Evolutionary Computation Conference (GECCO2000), pp. 987-994.
25. Krasnogor, N., and Smith, J. (2005). A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, 9(5):474-488.
26. Larrañaga, P., and Lozano, J. A. (2002). Estimation of distribution algorithms: A new tool for evolutionary computation. Norwell, MA: Kluwer Academic Publishers.
27. Lee, C., and Yao, X. (2004). Evolutionary programming using mutations based on the Ĺevy probability distribution. IEEE Transactions on Evolutionary Computation, 8(1):1-13.
28. Leung, Y.W., andWang, Y. (2001). An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Transactions on Evolutionary Computation, 5:41-51.
29. Lozano, M., Herrera, F., Krasnogor, N., and Molina, D. (2004). Real-coded memetic algorithms with crossover hill-climbing. Evolutionary Computation, 12(3):273-302.
30. Michalewicz, Z. (1996). Genetic algorithm + Data structures = Evolution programs. Berlin: Springer-Verlag.
31. Molina, D., Herrera, F., and Lozano, M. (2005). Adaptive local search parameters for real-coded memetic algorithms. In The 2005 IEEE Congress on Evolutionary Computation, pp. 888-895.
32. Molina, D., Lozano, M., and Garći{dotless}a-Mart́i{dotless}nez, C. (2010). Memetic algorithms for continuous optimization based on local search chains. Evolutionary Computation Journal, 18(1):27-63.
33. Moscato, P. (1989). On evolution, search, optimization, gas and martial arts: Toward memetic algorithms. (Technical report C3P, Vol. 826). California Institute of Technology, Caltech Concurrent Computing Program, Pasadena, California.
34. Mühlenbein, H., and Paaß, G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. In Parallel problem solving from nature, PPSN IV. Lecture notes in computer science, Vol. 1411 (pp. 178-187). Berlin: Springer-Verlag.
35. Nguyen, Q., Ong, Y.-S., and Krasnogor, N. (2007). A study on the design issues of memetic algorithms. In Proceedings of the 2007 IEEE Congress on Evolutionary Computation, pp. 2390-2397.
36. Nguyen, Q., Ong, Y.-S., and Lim, M. (2009). Aprobabilisticmemetic framework. IEEE Transactions on Evolutionary Computation, 13(3):604-623.
37. Nguyen, Q., Ong, Y.-S., Lim, M., and Krasnogor, N. (2007). Adaptive cellularmemetic algorithms. Evolutionary Computation Journal, 17(2):231-256.
38. Noman, N., and Iba, H. (2008). Accelerating differential evolution using an adaptive local search. IEEE Transactions on Evolutionary Computation, 12(1):107-125.
39. Ong, Y., and Keane, A. (2004). Meta-Lamarckian learning inmemetic algorithms. IEEE Transactions on Evolutionary Computation, 8(2):99-110.
40. Ong, Y.-S., Lim, M., Zhu, N., and Wong, K.-W. (2006). Classification of adaptive memetic algorithms: A comparative study. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 36(1):141-152.
41. O'Reilly, U., and Oppacher, F. (1995). Hybridized crossover-based search techniques for program discovery. In Proceedings of the 1995 World Conference on Evolutionary Computation, Vol. 2, pp. 573-578.
42. Powell, M. (2006). The NEWUOA software for unconstrained optimization without derivatives. Nonconvex optimization and its applications, Vol. 83 (pp. 255-297). Berlin: Springer-Verlag.
43. Powell, M. (2008). Developments of NEWUOA for minimization without derivatives. IMA Journal of Numerical Analysis, 28:649-664.
44. Ratnaweera, A., Halgamuge, S., and Watson, H. (2004). Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation, 8(3):240-255.
45. Robert, C., and Casella, G. (2004). Monte Carlo statistical methods, 2nd ed. Berlin: Springer-Verlag.
46. Satoh, H., Yamamura, M., and Kobayashi, S. (1996). Minimal generation gap model for GAs considering both exploration and exploitation. In Proceedings of IIZUKA'96, pp. 494-497.
47. Schwefel, H. (1995). Evolution and optimum seeking. New York:Wiley.
48. Smith, J. (2003). Co-evolving memetic algorithms: A learning approach to robust scalable optimization. In Proceedings of the 2003 Congress on Evolutionary Computation, pp. 498-505.
49. Smith, J. (2007). Coevolvingmemetic algorithms:Areview and progress report. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 37(1):6-17.
50. Sẗutzle, T. (1999). Iterated local search for the quadratic assignment problem. Technical Report AIDA-99-03, Darmstadt University of Technology, Computer Science Department, Intellectics Group.
51. Sudholt, D. (2006). Local search in evolutionary algorithms: The impact of the local search frequency. In Proceedings of the 17th International Symposium on Algorithms and Computation. Lecture notes in computer science. Vol. 4288 (pp. 259-368). Berlin: Springer-Verlag.
52. Sudholt, D. (2009). The impact of parameterization in memetic evolutionary algorithms. Theoretical Computer Science, 410:2511-2528.
53. Suganthan, P., Hansen, N., Liang, 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, Singapore.
54. Sun, J., Zhang, Q., and Tsang, E. (2005). DE/EDA: A new evolutionary algorithm for global optimisation. Information Sciences, 169(3-4):249-262.
55. Torn, A., and Zilinskas, A. (1989). Global optimization. Lectures Notes in Computer Science, 350.
56. Tsai, J.-T., Liu, T.-K., and Chou, J.-H. (2004). Hybrid Taguchi-genetic algorithm for global numerical optimization. IEEE Transactions on Evolutionary Computation, 8(4):365-377.
57. Tsutsui, S., and Goldberg, D. (2002). Simplex crossover and linkage identification: Single-stage evolution vs. multi-stage evolution. In Proceedings of IEEE International Conference on Evolutionary Computation. (Illi GAL Report 2002001).
58. Tsutsui, S., Pelikan, M., and Goldberg, D. (2001). Evolutionary algorithm using marginal histogram models in continuous domain. In Proceedings of the 2001 Genetic and Evolutionary Computation Conference Workshop, pp. 230-233.
59. Tsutsui, S., Yamamura, M., and Higuchi, T. (1999). Multi-parent recombination with simplex crossover in real coded genetic algorithms. In Proceedings of Genetic Evolutionary Computation Conference (GECCO'99), pp. 657-664.
60. Tu, Z., and Lu, Y. (2004). A robust stochastic genetic algorithm (StGA) for global numerical optimization. IEEE Transactions on Evolutionary Computation, 8(5):456-470.
61. Wang, Y., and Dang, C. (2007). An evolutionary algorithm for global optimization based on levelset evolution and latin squares. IEEE Transactions on Evolutionary Computation, 11(5):579-595.
62. Yao, X., and Liu, Y. (1999). Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82-102.
63. Zhang, Q., Sun, J., and Tsang, E. (2005). Evolutionary algorithm with the guided mutation for the maximum clique problem. IEEE Transactions on Evolutionary Computation, 9(2):192-200.
64. Zhang, Q., Sun, J., Tsang, E., and Ford, J. (2003). Hybrid estimation of distribution algorithm for global optimisation. Engineering Computations, 21(1):91-107.
65. Zhang, Q., Sun, J., Tsang, E., and Ford, J. (2004). Combination of guided local search and estimation of distribution algorithm for solving quadratic assignment problem. In Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pp. 42-48.
66. Zhong, W., Liu, J., Xue, M., and Jiao, L. (2004). A multiagent genetic algorithm for global numerical optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 34(2):1128-1141.