The impact of parametrization in memetic evolutionary algorithms
- 6 June 2009
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 410 (26), 2511-2528
- https://doi.org/10.1016/j.tcs.2009.03.003
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Review of theoretical aspects of local search by Wil P. A. J. Michiels, Emile H. L. Aarts, and Jan H. M. Korst (Springer in the EATCS Series Monographs in Theoretical Computer Science, 007)ACM SIGACT News, 2009
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problemTheoretical Computer Science, 2006
- On the Choice of the Offspring Population Size in Evolutionary AlgorithmsEvolutionary Computation, 2005
- Advanced Fitness Landscape Analysis and the Performance of Memetic AlgorithmsEvolutionary Computation, 2004
- Editorial Introduction Special Issue on Memetic AlgorithmsEvolutionary Computation, 2004
- Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop schedulingIEEE Transactions on Evolutionary Computation, 2003
- Locally-Adaptive and Memetic Evolutionary Pattern Search AlgorithmsEvolutionary Computation, 2003
- Optimization with randomized search heuristics—the (A)NFL theorem, realistic scenarios, and difficult functionsTheoretical Computer Science, 2002
- Iterated Local SearchSSRN Electronic Journal, 2001
- How Mutation and Selection Solve Long-Path Problems in Polynomial Expected TimeEvolutionary Computation, 1996