Region-based memetic algorithm with archive for multimodal optimisation.
Lacroix, Benjamin; Molina, Daniel; Herrera, Francisco
In this paper we propose a specially designed memetic algorithm for multimodal optimisation problems. The proposal uses a niching strategy, called region-based niching strategy, that divides the search space in predefined and indexable hypercubes with decreasing size, called regions. This niching technique allows our proposal to keep high diversity in the population, and to keep the most promising regions in an external archive. The most promising solutions are improved with a local search method and also stored in the archive. The archive is used as an index to effiently prevent further exploration of these areas with the evolutionary algorithm. The resulting algorithm, called Region-based Memetic Algorithm with Archive, is tested on the benchmark proposed in the special session and competition on niching methods for multimodal function optimisation of the Congress on Evolutionary Computation in 2013. The results obtained show that the region-based niching strategy is more efficient than the classical niching strategy called clearing and that the use of the archive as restrictive index significantly improves the exploration efficiency of the algorithm. The proposal achieves better exploration and accuracy than other existing techniques.
LACROIX, B., MOLINA, D. and HERRERA, F. 2016. Region-based memetic algorithm with archive for multimodal optimisation. Information sciences [online], 367-368, pages 719-746. Available from: https://doi.org/10.1016/j.ins.2016.05.049
|Journal Article Type||Article|
|Acceptance Date||May 29, 2016|
|Online Publication Date||Jun 2, 2016|
|Publication Date||Nov 1, 2016|
|Deposit Date||Jun 7, 2016|
|Publicly Available Date||Jun 3, 2017|
|Peer Reviewed||Peer Reviewed|
|Keywords||Multimodal optimisation; Memetic algorithm; Niching strategy|
LACROIX 2016 Region-based memetic algorithm
Publisher Licence URL
You might also like
Ensemble-based relationship discovery in relational databases.
Racing strategy for the dynamic-customer location-allocation problem.