PSO plus : A new particle swarm optimization algorithm for constrained problems

被引:64
作者
Kohler, Manoela [1 ]
Vellasco, Marley M. B. R. [1 ]
Tanscheit, Ricardo [1 ]
机构
[1] Pontifical Catholic Univ Rio de Janeiro, Dept Elect Engn, Rio De Janeiro, Brazil
关键词
Nonlinear constraints; Linear constraints; Optimization; Particle swarm; Swarm intelligence; EVOLUTIONARY ALGORITHMS; PENALTY-FUNCTION; RULE;
D O I
10.1016/j.asoc.2019.105865
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Particle Swarm Optimization algorithm is a metaheuristic based on populations of individuals in which solution candidates evolve through simulation of a simplified model of social adaptation. By aggregating robustness, efficiency and simplicity, PSO has gained great popularity. Modified PSO algorithms have been proposed to solve optimization problems with domain, linear and nonlinear constraints. Other algorithms that use multi-objective optimization to deal with constrained problems face the problem of not being able to guarantee finding feasible solutions. Current PSO algorithms that deal with constraints only treat domain constraints by controlling the velocity of particle displacement in the swarm, or do so inefficiently by randomly resetting each infeasible particle. This approach may make it infeasible to optimize certain problems, especially real ones. This work presents a new particle swarm optimization algorithm, called PSO+, capable of solving problems with linear and nonlinear constraints in order to solve these deficiencies. The proposed algorithm uses a feasibility repair operator and two swarms to ensure there will always be a swarm whose particles fully respect every constraint. A new particle update method is also proposed to insert diversity into the swarm and improve search-space coverage, allowing the search-space border to be exploited as well, which is particularly convenient when the optimization involves active constraints in global optimum. Two heuristics are proposed to initialize a feasible swarm with the purpose of speeding up the initialization mechanism and ensuring diversity at the starting point of the optimization process. Furthermore, a neighborhood topology is proposed to minimize premature convergence. The proposed algorithm was tested for twenty-four benchmark functions, as well as in a real reservoir drainage plan optimization problem. Results attest that the new algorithm is competitive, since it increases the efficiency of the PSO and the speed of convergence. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:18
相关论文
共 49 条
[1]   An Improved Particle Swarm Optimization For Energy-Efficiency Virtual Machine Placement [J].
Abdessamia, Foudil ;
Tai, Yu ;
Zhang, WeiZhe ;
Shafiq, Muhammad .
2017 5TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING RESEARCH AND INNOVATION (ICCCRI), 2017, :7-13
[2]  
Aguirre A.H., 2009, CONSTRAINT HANDLING
[3]  
[Anonymous], OPEN CYBERNETICS SYS
[4]  
[Anonymous], 2006, J APPL MECH
[5]  
[Anonymous], 2015, INT J MODEL SIMUL PE
[6]  
[Anonymous], 1996, COMMUN ACM, DOI DOI 10.1145/272682.272711
[7]  
Babaeizadeh S., 2014, J ENG APPL SCI, V9, P405
[8]   On optimization algorithms for the reservoir oil well placement problem [J].
Bangerth, W. ;
Klie, H. ;
Wheeler, M. F. ;
Stoffa, P. L. ;
Sen, M. K. .
COMPUTATIONAL GEOSCIENCES, 2006, 10 (03) :303-319
[9]   PID controller design of nonlinear systems using an improved particle swarm optimization approach [J].
Chang, Wei-Der ;
Shih, Shun-Peng .
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2010, 15 (11) :3632-3639
[10]   Oil Well Placement Optimization using Niche Particle Swarm Optimization [J].
Cheng, Guojian ;
An, Yao ;
Wang, Zhe ;
Zhu, Kai .
PROCEEDINGS OF THE 2012 EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS 2012), 2012, :61-64