Abstract

The goal of constrained multiobjective evolutionary optimization is to obtain a set of well-converged and well-distributed feasible solutions. To achieve this goal, a delicate tradeoff must be struck among feasibility, diversity, and convergence. However, balancing these three elements simultaneously through a single tradeoff model is nontrivial, mainly because the significance of each element varies in different evolutionary phases. As an alternative approach, we adapt distinct tradeoff models in various phases and introduce a novel algorithm named adaptive tradeoff model with reference points (ATM-R). In the infeasible phase, ATM-R takes the tradeoff between diversity and feasibility into account, aiming to move the population toward feasible regions from diverse search directions. In the semi-feasible phase, ATM-R promotes the transition from "the tradeoff between feasibility and diversity" to "the tradeoff between diversity and convergence." This transition is instrumental in discovering an adequate number of feasible regions and accelerating the search for feasible Pareto optima in succession. In the feasible phase, ATM-R places an emphasis on balancing diversity and convergence to obtain a set of feasible solutions that are both well-converged and well-distributed. It is worth noting that the merits of reference points are leveraged in ATM-R to accomplish these tradeoff models. Also, in ATM-R, a multiphase mating selection strategy is developed to generate promising solutions beneficial to different evolutionary phases. Systemic experiments on a diverse set of benchmark test functions and real-world problems demonstrate that ATM-R is effective. When compared to eight state-of-the-art constrained multiobjective optimization evolutionary algorithms, ATM-R consistently demonstrates its competitive performance.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call