A Sequential Learnable Evolutionary Algorithm with a Novel Knowledge Base Generation Method
Sequential learnable evolutionary algorithm (SLEA) provides an algorithm selection framework for solving the black box continuous design optimization problems. An algorithm pool consists of set of established algorithms. A knowledge base is trained offline. SLEA uses the algorithm-problem features to select the best algorithm from the algorithm pool. Given a problem, the default algorithm is run for the initial round. After that, an algorithm-problem feature is collected and used to map to the most similar problem in the knowledge base. Then the best algorithm for solving the problem is used in the second round. This process iterates until \( n \) rounds have been made. It is revealed that the algorithm-problem feature is a good problem identifier, thus SLEA performs well on the known problems that have been encountered. However, the performance on those unknown problems is limited if the knowledge base is biased. In this paper, we propose a modified SLEA, which performs the training process using a novel method. A relatively unbiased knowledge base is formed. Experimental results show that the modified SLEA maintains the performance of SLEA on solving the CEC 2013 test suite, while it performs better than SLEA on solving a set of randomly generated max-set of Gaussian test problems.
KeywordsEvolutionary algorithm Algorithm selection Black box design optimization problem Algorithm-problem feature
The work described in this paper was supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 125313]. Yang Lou acknowledge the Institutional Postgraduate Studentship and the Institutional Research Tuition Grant from City University of Hong Kong.
- 3.Zhang, X., Fong, K.F., Yuen, S.Y.: A novel artificial bee colony algorithm for HVAC optimization problems. HVAC R Res. 19, 715–731 (2013)Google Scholar
- 7.Yuen, S.Y., Zhang, X., Lou, Y.: Sequential learnable evolutionary algorithm: a research program. In: IEEE International Conference on Systems, Man, and Cybernetics, SMC, pp. 2841–2848 (2015)Google Scholar
- 9.Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O’Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS, vol. 10101, pp. 149–190. Springer, Cham (2016). doi: 10.1007/978-3-319-50137-6_7 CrossRefGoogle Scholar
- 11.Kerschke, P., Preuss, M., Wessing, S., Trautmann, H.: Low-budget exploratory landscape analysis on multiple peaks models. In: Genetic and Evolutionary Computation Conference, GECCO, pp. 229–236 (2016)Google Scholar
- 13.Loshchilov, I.: CMA-ES with restarts for solving CEC 2013 benchmark problems. In: IEEE Congress on Evolutionary Computation, CEC, pp. 369–376 (2013)Google Scholar
- 15.Zambrano-Bigiarini, M., Clerc, M., Rojas, R.: Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements. In: IEEE Congress on Evolutionary Computation, CEC, pp. 2337–2344 (2013)Google Scholar
- 17.Liang, J.J., Qu, B.Y., Suganthan, P.N., Hernández-Díaz, A.G.: Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical report 201212, Zhengzhou China; Singapore; CEC 2013 (2013)Google Scholar
- 18.Muñoz, M.A., Kirley, M.: ICARUS: Identification of complementary algorithms by uncovered sets. In: IEEE Congress of Evolutionary Computation, CEC, pp. 2427–2432 (2016)Google Scholar