Abstract
Decomposition of a multiobjective optimization problem (MOP) into several simple multiobjective subproblems, named multiobjective evolutionary algorithm based on decomposition (MOEA/D)-M2M, is a new version of multiobjective optimization-based decomposition. However, it fails to consider different contributions from each subproblem but treats them equally instead. This paper proposes a collaborative resource allocation (CRA) strategy for MOEA/D-M2M, named MOEA/D-CRA. It allocates computational resources dynamically to subproblems based on their contributions. In addition, an external archive is utilized to obtain the collaborative information about contributions during a search process. Experimental results indicate that MOEA/D-CRA outperforms its peers on 61% of the test cases in terms of three metrics, thereby validating the effectiveness of the proposed CRA strategy in solving MOPs.
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
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.
