Journal
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
Volume 49, Issue 12, Pages 2416-2423Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2018.2818175
Keywords
Collaborative resource allocation (CRA); decomposition; evolutionary algorithms; multiobjective optimization problem (MOP); Pareto front (PF)
Funding
- National Natural Science Foundation of China [71371142, 51775385, 61703279]
- Fundamental Research Funds for the Central Universities
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available