Abstract
The simplicity and success of cuckoo search (CS) algorithm has inspired researchers to apply these techniques to the multi-objective optimization field. The paper studies the application of CS for solving multi-objective optimization problems (MOPs) based on decomposition methods. A new decomposition-based multi-objective CS algorithm is proposed, called MOCS/D. The proposed algorithm integrates the unique Levy flights technique of CS and improved polynomial mutation into multi-objective evolutionary algorithm based on Decomposition (MOEA/D). Our proposed approach is compared with MOEA/D-SBX and MOEA/D-DE on the test instances. The experimental results show that it outperforms the compared algorithms on most of the selected test instances. It demonstrates that the proposed approach is a competitive candidate for multi-objective optimization problems.
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.
