Handling Multiobjective Optimization Problems With Complex Constraints: A Constraints Grouping-Based Approach

Real-world production scenarios often involve multiobjective optimization problems with intricate constraints. Although there has been a growing interest in multiobjective problems with complex constraints, such as the vehicle routing problem with time windows, existing multiobjective evolutionary optimization techniques still face significant challenges, particularly when addressing the fragmented and narrow feasible regions that arise from these constraints. Our research introduces a refined framework tailored for complex constrained multiobjective evolutionary optimization. The methodology conducts an initial strong-weak analysis to categorize constraints and merges each strong constraint with all weak constraints to form subsets. Each subset, combined with the original objective functions, defines a subproblem. Independent optimization of the original problem and subproblems is carried out by utilizing multiple populations. Information acquired from the subproblems’ populations is transferred into the population of the original issue, thereby expediting the detection of the feasible region and simplifying the resolution of the original problem. The efficacy of our innovative algorithm, when benchmarked against traditional constrained multiobjective evolutionary algorithms across 72 test functions, has demonstrated superior convergence, diversity, and competitiveness.