Abstract
In recent years, cuckoo search (CS) algorithm has been successfully applied in single-objective optimization problems. In addition, decomposition-based multi-objective evolutionary algorithms (MOEA/D) have high performance for multi-objective optimization problems (MOPs). Inspired by this, a new decomposition-based multi-objective CS algorithm is proposed in this paper. Two reproduction operators with different characteristics derived from the CS algorithm are constructed and they compose an operator pool. Then, a bandit-based adaptive operator selection method is used to determine the application of different operators. An angle-based selection strategy that achieves a better balance between convergence and diversity is adopted to preserve diversity. Compared with other improved strategies designed for MOEA/D on two suits of test instances, the proposed algorithm was demonstrated to be effective and competitive for 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 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.
