Abstract
Several real world problems can be modelled as a multi-objective optimization problem (MOP) and demand efficient algorithms to be solved. Some MOPs can not be solved by exact methods efficiently and, therefore, approximation algorithms, such as Multi-Objective Evolutionary Algorithms (MOEAs), are used to solve these problems. Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) has obtained very good results in various MOPs and is one of the most influential MOEAs. This paper focuses on improving the MOEA/D performance by introducing a local search (Quasi-Simplex) component. The CEC 2009 Multi-Objective Competition Benchmark is used to analyse the performance of the proposed algorithm and investigate the importance of its parameters. The empirical results obtained are encouraging.
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.
