Abstract

A new Pareto-based differential evolution (PDE) algorithm for solving multi-objective optimization problems was proposed by applying the nondominated sorting and ranking selection procedure developed in NSGA-II to select nondominated individuals to constitute a nondominated solution set. The PDE algorithm was validated using eight benchmark cases. The experimental results show that PDE, compared with NSGA-II algorithm, can find many Pareto optimal solutions distributed onto the Pareto front uniformly, which is an effective method to solve multi-objective optimization problems.

Full Text
Paper version not known

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 call

Disclaimer: 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.