A Particle Swarm Optimization with Feasibility-based Rules for Mixed-variable Optimization Problems
A Particle Swarm Optimization algorithm with feasibility-based rules (FRPSO) is proposed in this paper to solve mixed-variable optimization problems. An approach to handle various kinds of variables is discussed. Constraint handling is based on simple feasibility-based rules, not needing addinional penalty parameters and not guaranteeing to be in the feasible region at all times. Two real-world mixed-varible optimization benchmark problems are presented to evaluate the performance of the FRPSO algorithm, and it is found to be highly competitive compared to other existing stochastic algorithms.
Particle Swarm Optimization Feasibility-based rules Mixed-variables
Chao-Li Sun Jian-Chao Zeng Jeng-Shyang Pan
Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technolo Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, Guangdong, 518055 Department of
国际会议
2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)
沈阳
英文
1-5
2009-08-12(万方平台首次上网日期,不代表论文的发表时间)