Abstract
The multiobjective evolutionary algorithm based on decomposition (MOEA/D), which decomposes a multiobjective optimization problem (MOP) into a number of optimization subproblems and optimizes them in a collaborative manner, becomes more and more popular in the field of evolutionary multiobjective optimization. The mechanism of balance convergence and diversity is very important in MOEA/D. In the process of optimization, the chosen solutions must be distinctive and as close as possible to the Pareto front. In this paper, we first explore the relation between subproblems and solutions. Then we propose the adaptive region adjustment strategy to balance the convergence and diversity based on the objective region partition concept. Finally, this strategy is embedded in the MOEA/D framework and then a simple but efficient algorithm is proposed. To demonstrate the effectiveness of the proposed algorithm, comprehensive experiments have been designed. The simulation results show the effectiveness of our proposed algorithms.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
