Abstract
Multi-objective evolutionary algorithms (MOEAs) have received immense recognition due to their effectiveness and efficiency in tackling multi-objective optimization problems (MOPs). Recently, numerous studies on MOEAs revealed that when handling many-objective optimization problems (MaOPs) that have more than three objectives, MOEAs encounter challenges and the behavior of MOEAs resembles a random walk in search space as the proportion of nondominated solutions increases subsequently. This phenomenon is commonly observed in most classical Pareto-dominance-based MOEAs (PDMOEAs) such as NSGA-II, SPEAII, as these algorithms face difficulties in guiding the search process towards the optimal Pareto front due to lack of selection pressure. From the literature, it is evident that incorporating sum of normalized objectives into the framework of MOEAs would enhance the converging capabilities. Hence, in this work, we propose a novel multi-objective optimization algorithm with adaptive mating and environmental selection (ad-MOEA) which effectively incorporates the concept of sum of objectives in the mechanisms of mating and environmental selection to control the convergence and diversity adaptively. To demonstrate the effectiveness of the proposed ad-MOEA, we have conducted experiments on 26 test problems that includes DTLZ, WFG and MaOP test suites. Along with the benchmark problem, we have analyzed the performance of the proposed approach on real-world problems. The experimental results demonstrate the effectiveness of the proposed method with respect to the state-of-art methods.
Highlights
Multi-objective optimization problems (MOPs) refer to the optimization problems with more than one objective that are conflicting in nature and are optimized simultaneously [1]
It is evident that multi-objective evolutionary algorithms (MOEAs) are effective in solving MOPs due to their ability to obtain the Pareto optimal set in a single individual run
In initial generations more preference is assigned to the individuals that promote convergence and as the evolution progress, the focus adaptively shift towards the individuals that are diverse
Summary
Multi-objective optimization problems (MOPs) refer to the optimization problems with more than one objective that are conflicting in nature and are optimized simultaneously [1]. The conflicting behavior of the objectives in MOPs, leads to obtaining a set of nondominated solutions, The associate editor coordinating the review of this manuscript and approving it for publication was Huiling Chen. It is evident that multi-objective evolutionary algorithms (MOEAs) are effective in solving MOPs due to their ability to obtain the Pareto optimal set in a single individual run. The main aim of MOEAs when solving the MOPs is to obtain balance between the convergence (refers to closeness of the obtained Pareto front to the true Pareto front) and diversity (refers to uniform distribution of the population in the obtained Pareto front) [1], [5]. The ability of providing the trade-off between convergence and diversity in MOEAs mainly depends on the employed selection strategy
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.