Abstract

In this paper we propose a multiobjective evolutionary algorithm based on MOEA/D for solving multiobjective optimization problems. MOEA/D decomposes a multiobjective optimization problem into many single-objective subproblems. The objective of each subproblem is a weighted aggregation of the original objectives. Using evenly distributed weight vectors on subproblems, solutions to subproblems form a set of well-spread approximated Pareto optimal solutions to the original problem. In MOEA/D, each individual in the population represents the current best solution to one subproblem. Mating selection is carried out in a uniform and static manner. Each individual/subproblem is selected/solved once at each generation, and the mating pool of each individual is determined and fixed based on the distance between weight vectors on the objective space. We propose an adaptive mating selection mechanism for MOEA/D. It classifies subproblems into solved ones and unsolved ones and selects only individuals of unsolved subproblems. Besides, it dynamically adjusts the mating pools of individuals according to their distance on the decision space. The proposed algorithm, MOEA/D-AMS, is compared with two versions of MOEA/D using nine continuous functions. The experimental results confirm the benefits of the adaptive mating selection mechanism.

Full Text

Published Version

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

Disclaimer: 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.