Abstract
Decomposition-based evolutionary algorithms, especially the branch based on objective space division using a set of uniformly distributed reference vectors, are widely envisioned as a promising technique to solve many-objective optimization problems. Nevertheless, their performance deteriorates severely when solving problems with irregular Pareto fronts (PFs), such as inverted, degenerated, and discontinuous PF shapes. So far, there are some works trying to design reference vector adjustment approaches to make up for such deficiencies of decomposition-based evolutionary algorithms. Unfortunately, the task of designing effective reference vector adjustment approaches adapting to irregular PFs remains challenging. To tackle this challenge, we propose a Two-Stage Adjustment Strategy, namely TSAS, for space division based many-objective evolutionary optimization to deal with the irregular PFs. To be specific, the first stage attempts to approach the boundaries of objective spaces having solutions by inserting new reference vectors between obtained solutions and reference vectors; for achieving better diversity, the second stage adjusts the reference vectors on the basis of both the reference vectors having solutions and the objective vectors of solutions with better diversity, and also adds some reference vectors to explore the sparse sub-spaces. To verify the effectiveness of the proposed TSAS, extensive experiments on benchmarks are carried out to compare it with five recent representative algorithms using three widely-used metrics. The compared results demonstrate the superior performance of our proposal, especially it significantly outperforms all the five algorithms in 45 out of 65 test instances with respect to Inverted Generational Distance (IGD) metric. Furthermore, to test the performance of TSAS in solving real-world problems, 6 test instances from agile satellite task planning are used to compare its performance with five other algorithms. The experimental results show that the TSAS has the best performance on 5 out of 6 test instances.
Highlights
R EAL-WORLD optimization problems encountered in various fields usually require to optimize multiple conflicting objectives simultaneously
We propose a new two-stage reference vector adjustment strategy, namely TSAS, to improve the performance of objective space division based multi-objective evolutionary algorithms (MOEAs) in solving the challenges of irregular Pareto fronts (PFs) shapes
This work mainly focuses on the many-objective optimization problems having irregular PF shapes, such as inverted, degenerate, discontinuous, and badly scaled
Summary
R EAL-WORLD optimization problems encountered in various fields usually require to optimize multiple conflicting objectives simultaneously. During the past three decades, a large number of relevant multi-objective evolutionary algorithms (MOEAs) have been reported [8], [9] According to their environmental selection frameworks, these algorithms can be roughly classified into three categories: Pareto dominance-based, indicator-based, and decomposition-based frameworks [10], [11]. Compared with the other two frameworks, the framework based on decomposition has witnessed remarkable success in solving MaOPs, and a number of relevant MOEAs have been proposed [11], [14]. We propose a new two-stage reference vector adjustment strategy, namely TSAS, to improve the performance of objective space division based MOEAs in solving the challenges of irregular PF shapes.
Sign-in/Register to view highlights & summary 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.
