Handling non-separability in Three Stage Optimal Memetic Exploration

Proceedings of the 5th International Conference on Bioinspired Optimization Methods and their Applications, BIOMA 2012

Volumn , Issue , 2012, Pages 195-205

  Poikolainen, Ilpo ^a   Caraffini, Fabio ^a   Neri, Ferrante ^a   Weber, Matthieu ^a  

^a UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

Computational intelligence optimization; Memetic computing; Ockham razor; Separability

Indexed keywords

ARTIFICIAL INTELLIGENCE; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

COMPUTATIONAL INTELLIGENCE OPTIMIZATIONS; COMPUTATIONAL RESOURCES; DIFFERENTIAL EVOLUTION; MEMETIC COMPUTING; NON-SEPARABLE PROBLEMS; OCKHAM RAZOR; OPTIMIZATION ALGORITHMS; SEPARABILITY;

ALGORITHMS;

EID: 84976363298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. N. Hansen, S. D. Müller, and P. Koumoutsakos. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMAES). Evol. Comput., 11(1):1-18, 2003.
2. N. Hansen and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Proc. IEEE International Conference on Evolutionary Computation, pages 312-317, 1996.
3. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evol. Comput., 9(2):159-195, 2001.
4. G. Iacca, F. Neri, E. Mininno, Y. S. Ong, and M. H. Lim. Ockham's razor in memetic computing: Three stage optimal memetic exploration. Inform. Sciences, 188(1):17-43, 2012.
5. C. Igel, T. Suttorp, and N. Hansen. A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies. In Proc. Genetic and Evolutionary Computation Conference, pages 453-460, 2006.
6. N. Hansen, S. Finck, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2010: Noiseless functions definitions. Technical Report RR-6829, INRIA, 2010.
7. F. Neri and C. Cotta. Memetic algorithms and memetic computing optimization: A literature review. Swarm and Evolutionary Computation, 2(1):1-14, 2012.
8. F. Neri, C. Cotta, and P. Moscato. Handbook of Memetic Algorithms, volume 379 of Studies in Computational Intelligence. Springer, 2012.
9. F. Neri, G. Iacca, and E. Mininno. Disturbed exploitation compact differential evolution for limited memory optimization problems. Inform. Sciences, 181(12):2469-2487, 2011.
10. K. Price. An introduction to differential evolution. In David Corne, Marco Dorigo, Fred Glover, Dipankar Dasgupta, Pablo Moscato, Riccardo Poli, and Kenneth V. Price, editors, New Ideas in Optimization, pages 79-108. McGraw-Hill, 1999.
11. T. Takahama and S. Sakai. Solving nonlinear optimization problems by differential evolution with a rotation-invariant crossover operation using gram-schmidt process. In Proc. World Congress on Nature and Biologically Inspired Computing, pages 533-540, 2010.
12. T. Takahama and S. Sakai. Efficient nonlinear optimization by differential evolution with a rotation-invariant local sampling operation. In Proc. IEEE Congress on Evolutionary Computation, pages 2215-2222, 2011.
13. L. Y. Tseng and C. Chen. Multiple trajectory search for large scale global optimization. In Proc. IEEE Congress on Evolutionary Computation, pages 3052-3059, 2008.
14. D. Whitley, S. Rana, and R. B. Heckendorn. The island model genetic algorithm: On separability, population size and convergence. Journal of Computing and Information Technology, 6(3):33-47, 1998.
15. F. Wilcoxon. Individual comparisons by ranking methods. Biometrics Bull., 1(6):80-83, 1945.