Abstract
In this paper, we propose a simple but effective objective reduction algorithm (ORA) for many-objective optimization problems (MaOPs). It uses a hyperplane involving sparse non-negative coefficients to roughly approximate the conflicting structure of the Pareto front in the objective space. Then the objectives with non-zero coefficients are considered as essential objectives. In order to verify the performance of proposed algorithm, we compare the proposed algorithm with two correlation-based ORA, i.e., L-PCA and NL-MVU-PCA and a dominance structure-based ORA, i.e., PCSEA on the benchmark problem DTLZ5(I, M). The experimental results show the effectiveness of the proposed algorithm.
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.
