PDPSO: The fusion of primal-dual interior point method and Particle Swarm Optimization algorithm

Emmanuel Gbenga Dada, E. Ramlan

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

LanguageEnglish
Pages17-34
Number of pages18
JournalMalaysian Journal of Computer Science
Volume31
Issue number1.2
DOIs
Publication statusPublished - 17 Jan 2018

Fingerprint

Particle swarm optimization (PSO)
Fusion reactions
Heuristic algorithms

Keywords

  • Interior point method
  • Multimodal functions
  • Particle Swarm Optimization (PSO)
  • Primal-Dual
  • Unimodal functions

Cite this

@article{5119d912d6f446e68fb09c54bb94547f,
title = "PDPSO: The fusion of primal-dual interior point method and Particle Swarm Optimization algorithm",
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.",
keywords = "Interior point method, Multimodal functions, Particle Swarm Optimization (PSO), Primal-Dual, Unimodal functions",
author = "Dada, {Emmanuel Gbenga} and E. Ramlan",
note = "Started Ulster 2 May 2019 (Source: CoreHR). Was previously employed at University Malaya, Malaysia (see other file Ramlan 76781996 Author Affiliation).",
year = "2018",
month = "1",
day = "17",
doi = "10.22452/mjcs.vol31no1.2",
language = "English",
volume = "31",
pages = "17--34",
journal = "Malaysian Journal of Computer Science",
issn = "0127-9084",
publisher = "Faculty of Computer Science and Information Technology",
number = "1.2",

}

PDPSO: The fusion of primal-dual interior point method and Particle Swarm Optimization algorithm. / Dada, Emmanuel Gbenga; Ramlan, E.

In: Malaysian Journal of Computer Science, Vol. 31, No. 1.2, 17.01.2018, p. 17-34.

Research output: Contribution to journalArticle

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

JO - Malaysian Journal of Computer Science

T2 - Malaysian Journal of Computer Science

JF - Malaysian Journal of Computer Science

SN - 0127-9084

IS - 1.2

ER -