Abstract
The Pareto-based approaches have shown some success in designing multiobjective evolutionary algorithms (MEAs). Their methods of fitness assignment are mainly from the information of dominated and nondominated individuals. On the top of the hierarchy of MEAs, the strength Pareto evolutionary algorithm (SPEA) has been elaborately designed with this principle in mind. In this paper, we propose a ( μ+ λ) multiobjective evolutionary algorithm (( μ+ λ) MEA), which discards the dominated individuals in each generation. The comparisons of the experimental results demonstrate that the ( μ+ λ) MEA outperforms SPEA on five benchmark functions with less computational efforts.
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.
