Abstract
A particle swarm optimization for solving constrained multi-objective optimization problem was proposed (CMPSO). In this paper, the main idea is the use of penalty function to handle the constraints. CMPSO employs particle swarm optimization algorithm and Pareto neighborhood crossover operation to generate new population. Numerical experiments are compared with NSGA-II and MOPSO on three benchmark problems. The numerical results show the effectiveness of the proposed CMPSO algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
