Benchmarking a MOS-based algorithm on the BBOB-2010 noiseless function testbed
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
An effective memetic differential evolution algorithm based on chaotic local search
Information Sciences: an International Journal
Automatically modeling hybrid evolutionary algorithms from past executions
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
The modified differential evolution algorithm (MDEA)
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
Journal of Parallel and Distributed Computing
A new methodology for the automatic creation of adaptive hybrid algorithms
Intelligent Data Analysis
| Hi-index | 0.00 |
Continuous optimization is one of the most active research lines in evolutionary and metaheuristic algorithms. Since CEC 2005 and CEC 2008 competitions, many different algorithms have been proposed to solve continuous problems. Despite there exist very good algorithms reporting high quality results for a given dimension, the scalability of the search methods is still an open issue. Finding an algorithm with competitive results in the range of 50 to 500 dimensions is a difficult achievement. This contribution explores the use of a hybrid memetic algorithm based on the differential evolution algorithm, named MDE-DC. The proposed algorithm combines the explorative/exploitative strength of two heuristic search methods, that separately obtain very competitive results in either low or high dimensional problems. This paper uses the benchmark problems and conditions required for the workshop on “evolutionary algorithms and other metaheuristics for Continuous Optimization Problems – A Scalability Test” chaired by Francisco Herrera and Manuel Lozano.