Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis
The Particle Swarm Optimization (PSO) Algorithm is a popular optimization method that is widely used in various applications, due to its simplicity and capability in obtaining optimal results. However, ordinary PSOs may be trapped in the local optimal point, especially in high dimensional problems....
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/329193 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562316409831424 |
|---|---|
| author | J. J. Jamian M. N. Abdullah H. Mokhlis M. W. Mustafa A. H. A. Bakar |
| author_facet | J. J. Jamian M. N. Abdullah H. Mokhlis M. W. Mustafa A. H. A. Bakar |
| author_sort | J. J. Jamian |
| collection | DOAJ |
| description | The Particle Swarm Optimization (PSO) Algorithm is a popular optimization method that is widely used in various applications, due to its simplicity and capability in obtaining optimal results. However, ordinary PSOs may be trapped in the local optimal point, especially in high dimensional problems. To overcome this problem, an efficient Global Particle Swarm Optimization (GPSO) algorithm is proposed in this paper, based on a new updated strategy of the particle position. This is done through sharing information of particle position between the dimensions (variables) at any iteration. The strategy can enhance the exploration capability of the GPSO algorithm to determine the optimum global solution and avoid traps at the local optimum. The proposed GPSO algorithm is validated on a 12-benchmark mathematical function and compared with three different types of PSO techniques. The performance of this algorithm is measured based on the solutions’ quality, convergence characteristics, and their robustness after 50 trials. The simulation results showed that the new updated strategy in GPSO assists in realizing a better optimum solution with the smallest standard deviation value compared to other techniques. It can be concluded that the proposed GPSO method is a superior technique for solving high dimensional numerical function optimization problems. |
| format | Article |
| id | doaj-art-40d2f5ce83e04fb982961dc4cdd75afd |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-40d2f5ce83e04fb982961dc4cdd75afd2025-02-03T01:22:55ZengWileyJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/329193329193Global Particle Swarm Optimization for High Dimension Numerical Functions AnalysisJ. J. Jamian0M. N. Abdullah1H. Mokhlis2M. W. Mustafa3A. H. A. Bakar4Faculty of Electrical Engineering, Universiti Teknologi Malaysia (UTM), 81310 Johor Bahru, Johor, MalaysiaFaculty of Engineering, University of Malaya, 50603 Kuala Lumpur, MalaysiaFaculty of Engineering, University of Malaya, 50603 Kuala Lumpur, MalaysiaFaculty of Electrical Engineering, Universiti Teknologi Malaysia (UTM), 81310 Johor Bahru, Johor, MalaysiaFaculty of Engineering, University of Malaya, 50603 Kuala Lumpur, MalaysiaThe Particle Swarm Optimization (PSO) Algorithm is a popular optimization method that is widely used in various applications, due to its simplicity and capability in obtaining optimal results. However, ordinary PSOs may be trapped in the local optimal point, especially in high dimensional problems. To overcome this problem, an efficient Global Particle Swarm Optimization (GPSO) algorithm is proposed in this paper, based on a new updated strategy of the particle position. This is done through sharing information of particle position between the dimensions (variables) at any iteration. The strategy can enhance the exploration capability of the GPSO algorithm to determine the optimum global solution and avoid traps at the local optimum. The proposed GPSO algorithm is validated on a 12-benchmark mathematical function and compared with three different types of PSO techniques. The performance of this algorithm is measured based on the solutions’ quality, convergence characteristics, and their robustness after 50 trials. The simulation results showed that the new updated strategy in GPSO assists in realizing a better optimum solution with the smallest standard deviation value compared to other techniques. It can be concluded that the proposed GPSO method is a superior technique for solving high dimensional numerical function optimization problems.http://dx.doi.org/10.1155/2014/329193 |
| spellingShingle | J. J. Jamian M. N. Abdullah H. Mokhlis M. W. Mustafa A. H. A. Bakar Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis Journal of Applied Mathematics |
| title | Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis |
| title_full | Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis |
| title_fullStr | Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis |
| title_full_unstemmed | Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis |
| title_short | Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis |
| title_sort | global particle swarm optimization for high dimension numerical functions analysis |
| url | http://dx.doi.org/10.1155/2014/329193 |
| work_keys_str_mv | AT jjjamian globalparticleswarmoptimizationforhighdimensionnumericalfunctionsanalysis AT mnabdullah globalparticleswarmoptimizationforhighdimensionnumericalfunctionsanalysis AT hmokhlis globalparticleswarmoptimizationforhighdimensionnumericalfunctionsanalysis AT mwmustafa globalparticleswarmoptimizationforhighdimensionnumericalfunctionsanalysis AT ahabakar globalparticleswarmoptimizationforhighdimensionnumericalfunctionsanalysis |