Abstract
Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been used to solve a variety of complex optimization problems. In spite of the acceptance of the algorithm in various fields, PSO still suffers from common issues such as premature convergence and local minima. This provides a platform for generating a variety of PSO variants. Although these variants are successful in addressing issues specific to a directed domain, they are still unable to resolve the issues effectively. The Interior-Point Methods (IPMs) are efficient tools for solving nonlinear optimization problems. On the one hand, the method is depicted as the most robust algorithm for solving large scale nonlinear optimization problems. On the other, similar to PSO, the methods are still plagued with several issues. We propose Primal-Dual Interior Point Particle Swarm Optimization (pdPSO) to resolve the shortcomings of a standard PSO without the limitations of the IPM methods. We applied the Primal Dual procedure to each particle in a finite number of iterations, and fed the PSO with the its output. We compared the performance of our new algorithm (pdPSO) with IPM and PSO using nine different dynamic benchmark functions. Our results revealed that pdPSO performed better than both the independent PSO algorithm and the IPM method. The proposed algorithm is not susceptible to premature convergence, and can better avoid local minima than conventional PSO, hence hypothetically it has the potential to perform better than many variants of PSO.
| Language | English |
|---|---|
| Pages | 17-34 |
| Number of pages | 18 |
| Journal | Malaysian Journal of Computer Science |
| Volume | 31 |
| Issue number | 1.2 |
| DOIs | |
| Publication status | Published - 17 Jan 2018 |
Fingerprint
Keywords
- Interior point method
- Multimodal functions
- Particle Swarm Optimization (PSO)
- Primal-Dual
- Unimodal functions
Cite this
}
PDPSO: The fusion of primal-dual interior point method and Particle Swarm Optimization algorithm. / Dada, Emmanuel Gbenga; Ramlan, E.
Vol. 31, No. 1.2, 17.01.2018, p. 17-34.Research output: Contribution to journal › Article
TY - JOUR
T1 - PDPSO: The fusion of primal-dual interior point method and Particle Swarm Optimization algorithm
AU - Dada, Emmanuel Gbenga
AU - Ramlan, E.
N1 - Started Ulster 2 May 2019 (Source: CoreHR). Was previously employed at University Malaya, Malaysia (see other file Ramlan 76781996 Author Affiliation).
PY - 2018/1/17
Y1 - 2018/1/17
N2 - Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been used to solve a variety of complex optimization problems. In spite of the acceptance of the algorithm in various fields, PSO still suffers from common issues such as premature convergence and local minima. This provides a platform for generating a variety of PSO variants. Although these variants are successful in addressing issues specific to a directed domain, they are still unable to resolve the issues effectively. The Interior-Point Methods (IPMs) are efficient tools for solving nonlinear optimization problems. On the one hand, the method is depicted as the most robust algorithm for solving large scale nonlinear optimization problems. On the other, similar to PSO, the methods are still plagued with several issues. We propose Primal-Dual Interior Point Particle Swarm Optimization (pdPSO) to resolve the shortcomings of a standard PSO without the limitations of the IPM methods. We applied the Primal Dual procedure to each particle in a finite number of iterations, and fed the PSO with the its output. We compared the performance of our new algorithm (pdPSO) with IPM and PSO using nine different dynamic benchmark functions. Our results revealed that pdPSO performed better than both the independent PSO algorithm and the IPM method. The proposed algorithm is not susceptible to premature convergence, and can better avoid local minima than conventional PSO, hence hypothetically it has the potential to perform better than many variants of PSO.
AB - Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been used to solve a variety of complex optimization problems. In spite of the acceptance of the algorithm in various fields, PSO still suffers from common issues such as premature convergence and local minima. This provides a platform for generating a variety of PSO variants. Although these variants are successful in addressing issues specific to a directed domain, they are still unable to resolve the issues effectively. The Interior-Point Methods (IPMs) are efficient tools for solving nonlinear optimization problems. On the one hand, the method is depicted as the most robust algorithm for solving large scale nonlinear optimization problems. On the other, similar to PSO, the methods are still plagued with several issues. We propose Primal-Dual Interior Point Particle Swarm Optimization (pdPSO) to resolve the shortcomings of a standard PSO without the limitations of the IPM methods. We applied the Primal Dual procedure to each particle in a finite number of iterations, and fed the PSO with the its output. We compared the performance of our new algorithm (pdPSO) with IPM and PSO using nine different dynamic benchmark functions. Our results revealed that pdPSO performed better than both the independent PSO algorithm and the IPM method. The proposed algorithm is not susceptible to premature convergence, and can better avoid local minima than conventional PSO, hence hypothetically it has the potential to perform better than many variants of PSO.
KW - Interior point method
KW - Multimodal functions
KW - Particle Swarm Optimization (PSO)
KW - Primal-Dual
KW - Unimodal functions
UR - http://www.scopus.com/inward/record.url?scp=85040866651&partnerID=8YFLogxK
U2 - 10.22452/mjcs.vol31no1.2
DO - 10.22452/mjcs.vol31no1.2
M3 - Article
VL - 31
SP - 17
EP - 34
IS - 1.2
ER -