Abstract
Multiobjective evolutionary algorithm based on decomposition has made a great contribution to the field of evolutionary multiobjective optimization problem. The decomposition-based algorithms construct a number of scalar optimization subproblems by using a set of weight vectors, and optimize these subproblems simultaneously to approximate the Pareto front (PF). The weight vectors have a massive influence on the performance of the decomposition-based algorithm, especially for the multiobjective optimization problems (MOP) with a complex PF. To solve this, we propose a parameterless decomposition scheme to adjust the weight vectors automatically. Experiment results indicate that the proposed algorithm can obtain better uniformity solutions for the MOP with complex PF.
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.
