A Surrogate-Assisted Differential Evolution With Knowledge Transfer for Expensive Incremental Optimization Problems

• Published in: IEEE transactions on evolutionary computation 2024-08, Vol.28 (4), p.1039-1053
• Main Authors: Liu, Yuanchao, Liu, Jianchang, Ding, Jinliang, Yang, Shangshang, Jin, Yaochu
• Format: Article
• Language: English
• Subjects: Computational modeling; Differential evolution (DE); expensive incremental optimization problems (EIOPs); Iron; Knowledge transfer; Optimization; Search problems; Sociology; surrogate-assisted evolutionary algorithm (SAEA); Task analysis
• ISSN: 1089-778X; 1941-0026
• DOI: 10.1109/TEVC.2023.3291697

In some real-world applications, the optimization problems may involve multiple design stages. At each design stage, the objective is incrementally modified by incorporating more decision variables and optimized. In addition, the fitness evaluations (FEs) are often highly costly. Such optimization problems can be called expensive incremental optimization problems (EIOPs). Despite their importance, EIOPs have not attracted much attention over the past few years. Since the objectives of different design stages are different but related, reusing the search experience from the past design stages is beneficial to the evolutionary search of the current design stage. Therefore, a surrogate-assisted differential evolution with knowledge transfer (SADE-KT) is proposed in this work, which aims to fill the current gap in solving EIOPs. The major merit of the proposed SADE-KT is its ability to seamlessly integrate knowledge transfer and the surrogate-assisted evolutionary search. In SADE-KT, a surrogate-based hybrid knowledge transfer strategy is first proposed. This strategy makes it possible to reuse the knowledge captured from the past design stages by leveraging different knowledge transfer techniques. As a result, the convergence for the current design stage can be speeded up. Then, a two-level surrogate-assisted evolutionary search is developed to search for the optimum. Comprehensive empirical studies have demonstrated that the proposed algorithm works efficiently on EIOPs.