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.