Welcome to the InfoSci Platform
Reference Hub1
A Particle Swarm Optimizer for Constrained Multiobjective Optimization

A Particle Swarm Optimizer for Constrained Multiobjective Optimization

Wen Fung Leong, Yali Wu, Gary G. Yen
Copyright: © 2015 |Pages: 32
ISBN13: 9781466663282|ISBN10: 1466663286|EISBN13: 9781466663299
DOI: 10.4018/978-1-4666-6328-2.ch006
Cite Chapter Cite Chapter

MLA

Leong, Wen Fung, et al. "A Particle Swarm Optimizer for Constrained Multiobjective Optimization." Emerging Research on Swarm Intelligence and Algorithm Optimization, edited by Yuhui Shi, IGI Global, 2015, pp. 128-159. https://doi.org/10.4018/978-1-4666-6328-2.ch006

APA

Leong, W. F., Wu, Y., & Yen, G. G. (2015). A Particle Swarm Optimizer for Constrained Multiobjective Optimization. In Y. Shi (Ed.), Emerging Research on Swarm Intelligence and Algorithm Optimization (pp. 128-159). IGI Global. https://doi.org/10.4018/978-1-4666-6328-2.ch006

Chicago

Leong, Wen Fung, Yali Wu, and Gary G. Yen. "A Particle Swarm Optimizer for Constrained Multiobjective Optimization." In Emerging Research on Swarm Intelligence and Algorithm Optimization, edited by Yuhui Shi, 128-159. Hershey, PA: IGI Global, 2015. https://doi.org/10.4018/978-1-4666-6328-2.ch006

Export Reference

Mendeley
Favorite

Abstract

Generally, constraint-handling techniques are designed for evolutionary algorithms to solve Constrained Multiobjective Optimization Problems (CMOPs). Most Multiojective Particle Swarm Optimization (MOPSO) designs adopt these existing constraint-handling techniques to deal with CMOPs. In this chapter, the authors present a constrained MOPSO in which the information related to particles' infeasibility and feasibility status is utilized effectively to guide the particles to search for feasible solutions and to improve the quality of the optimal solution found. The updating of personal best archive is based on the particles' Pareto ranks and their constraint violations. The infeasible global best archive is adopted to store infeasible nondominated solutions. The acceleration constants are adjusted depending on the personal bests' and selected global bests' infeasibility and feasibility statuses. The personal bests' feasibility statuses are integrated to estimate the mutation rate in the mutation procedure. The simulation results indicate that the proposed constrained MOPSO is highly competitive in solving selected benchmark problems.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.