MOBCA: Multi-Objective Besiege and Conquer Algorithm

MOBCA: Multi-Objective Besiege and Conquer Algorithm

Blog Article

The besiege and conquer algorithm has shown excellent performance in single-objective optimization Olive Leaf problems.However, there is no literature on the research of the BCA algorithm on multi-objective optimization problems.Therefore, this paper proposes a new multi-objective besiege and conquer algorithm to solve multi-objective optimization problems.The grid mechanism, archiving mechanism, and leader selection mechanism are integrated into Vitamin C the BCA to estimate the Pareto optimal solution and approach the Pareto optimal frontier.

The proposed algorithm is tested with MOPSO, MOEA/D, and NSGAIII on the benchmark function IMOP and ZDT.The experiment results show that the proposed algorithm can obtain competitive results in terms of the accuracy of the Pareto optimal solution.