A bi-population based scheme for an explicit exploration/exploitation trade-off in dynamic environments

被引:12
作者
Ben-Romdhane, Hajer [1 ]
Krichen, Saoussen [1 ]
Alba, Enrique [2 ,3 ]
机构
[1] Univ Tunis, LARODEC Lab, ISG Tunis, Le Bardo, Tunisia
[2] Univ Malaga, Blvd Louis Pasteur S-N, Malaga, Spain
[3] Tech Univ Ostrava, Ostrava, Czech Republic
关键词
Dynamic optimisation problems; exploration-exploitation tradeoff; evolutionary algorithms; multi-population scheme; memory scheme; GENETIC ALGORITHM; ASSOCIATIVE MEMORY; OPTIMIZATION; PERFORMANCE; IMMIGRANTS;
D O I
10.1080/0952813X.2016.1186230
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Optimisation in changing environments is a challenging research topic since many real-world problems are inherently dynamic. Inspired by the natural evolution process, evolutionary algorithms (EAs) are among the most successful and promising approaches that have addressed dynamic optimisation problems. However, managing the exploration/exploitation trade-off in EAs is still a prevalent issue, and this is due to the difficulties associated with the control and measurement of such a behaviour. The proposal of this paper is to achieve a balance between exploration and exploitation in an explicit manner. The idea is to use two equally sized populations: the first one performs exploration while the second one is responsible for exploitation. These tasks are alternated from one generation to the next one in a regular pattern, so as to obtain a balanced search engine. Besides, we reinforce the ability of our algorithm to quickly adapt after cnhanges by means of a memory of past solutions. Such a combination aims to restrain the premature convergence, to broaden the search area, and to speed up the optimisation. We show through computational experiments, and based on a series of dynamic problems and many performance measures, that our approach improves the performance of EAs and outperforms competing algorithms.
引用
收藏
页码:453 / 479
页数:27
相关论文
共 49 条
[1]
Adrews M., 2003, GECCO WORKSH EV ALG, P24
[2]
Alba E, 2005, WILEY SER PARA DIST, P1, DOI 10.1002/0471739383
[3]
ALBA E, 2013, EVOLUTIONARY COMPUTA, P171
[4]
Alba E, 2010, IEEE C EV COMP, P1
[5]
Alba E, 2010, LECT NOTES COMPUT SC, V6024, P572, DOI 10.1007/978-3-642-12239-2_59
[6]
[Anonymous], 2011, THESIS U QUEENSLAND
[7]
Best practices in measuring algorithm performance for dynamic optimization problems [J].
Ben-Romdhane, Hajer ;
Alba, Enrique ;
Krichen, Saoussen .
SOFT COMPUTING, 2013, 17 (06) :1005-1017
[8]
Bendtsen CN, 2002, IEEE C EVOL COMPUTAT, P145, DOI 10.1109/CEC.2002.1006224
[9]
Branke J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1875, DOI 10.1109/CEC.1999.785502
[10]
Branke J, 2000, EVOLUTIONARY DESIGN AND MANUFACTURE, P299