C-NSGA-II-MOPSO: An effective multi-objective optimizer for engineering design problems

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper extends the NSGA-II-MOPSO algorithm, which is based on the combination of NSGA-II and multi-objective particle swarm optimizer (MOPSO) for unconstrained multi-objective optimization problems, to accommodate constraints and mixed variables. In order to utilize the valuable information from the objective function values of infeasible solutions, a method called M+1 nondominated sorting is proposed to check the nondomination levels of all infeasible solutions. For integer and discrete variables, they are dealt with using a method called stochastic approximation. Experiments on two structural optimization problems were conducted. The results indicate that the constrained NSGA-II-MOPSO (C-NSGA-II-MOPSO) is an effective multi-objective optimizer for optimization problems in engineering design in comparison with the constrained NSGA-II algorithm. The efficiency of the algorithm demonstrated here suggests its immediate application to other engineering design problems.

Cite

CITATION STYLE

APA

Wang, J., & Yin, Z. (2008). C-NSGA-II-MOPSO: An effective multi-objective optimizer for engineering design problems. In Global Design to Gain a Competitive Edge: An Holistic and Collaborative Design Approach Based on Computational Tools (pp. 519–528). CSREA Press. https://doi.org/10.1007/978-1-84800-239-5_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free