Movement Strategies for Multi-Objective Particle Swarm Optimization

S. Nguyen and V. Kachitvichyanukul
Additional contact information
S. Nguyen: Asian Institute of Technology, Thailand
V. Kachitvichyanukul: Asian Institute of Technology, Thailand

International Journal of Applied Metaheuristic Computing (IJAMC), 2010, vol. 1, issue 3, 59-79

Abstract: Particle Swarm Optimization (PSO) is one of the most effective metaheuristics algorithms, with many successful real-world applications. The reason for the success of PSO is the movement behavior, which allows the swarm to effectively explore the search space. Unfortunately, the original PSO algorithm is only suitable for single objective optimization problems. In this paper, three movement strategies are discussed for multi-objective PSO (MOPSO) and popular test problems are used to confirm their effectiveness. In addition, these algorithms are also applied to solve the engineering design and portfolio optimization problems. Results show that the algorithms are effective with both direct and indirect encoding schemes.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jamc.2010070105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:1:y:2010:i:3:p:59-79

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().