Search

The main challenge in addressing constrained multi-objective optimization problems (CMOPs) lies in achieving a balance among convergence, diversity, and feasibility. To address this issue, this paper proposes a constrained multi-objective evolutionary algorithm with Pareto estimation via neural network named CMOEA-PeNN. In order to exploit and explore the decision space, the proposed algorithm employs a dual-population mechanism, which is trained with a self-organizing map (SOM). Firstly, the population distribution structure in decision space is mapped to objective space while preserving neighborhood information, and then the neuron weight is utilized to estimate the Pareto front (PF). Secondly, a novel approach is devised to preserve the feasibility of the population and enhance the estimation of the Pareto front by SOM. The achievement scalarizing function (ASF) is employed to choose promising solutions. This strategy could guide the population toward the optimal solution while exploring the small feasible regions. Finally, the performance of CMOEA-PeNN is compared with five state-of-the-art constrained multi-objective evolutionary algorithms (CMOEAs) on three widely used benchmark problems and a real-world problem. The experimental results show that CMOEA-PeNN could archive competitive performance in solving CMOPs. [ABSTRACT FROM AUTHOR]