A constrained multi-objective optimisation with weak-side complementary and dynamically guided
Ziqiong Liu, Sanfeng Chen, Xiang Du, Wei Li, Hui Wang · International Journal of Computing Science and Mathematics · 2025
At the current stage, many complex optimisation problems can be transformed into constrained multi-objective optimisation problems (CMOPs). Constrained multi-objective evolutionary algorithms (CMOEAs) have become an efficient way of resolving constrained multi-objective problems. However, CMOPs will face huge challenges such as complexity of constraints, difficulty in exploring, and serious conflicts between objective functions and constraints. This paper proposes an efficient weak-side complementary and dynamically guided CMOEA named WDCMO. WDCMO has two populations: the main population and the auxiliary population. Its evolutionary process is divided into two stages: in the first stage, the WDCMO main and auxiliary populations focus on the exploration of two different regions; in the second stage, the WDCMO auxiliary population uses the information about the value of the objective function to guide the main population's evolution. Finally, WDCMO was tested against three other algorithms on a test suite. The experimental results show that the test values of WDCMO are clearly better than the other comparison algorithms on the majority of test problems. Specifically, WDCMO achieved 9 HV indicator leads and 12 IGD indicator leads on 14 constrained multi-objective problems.