Improved particle swarm optimization for high-dimensional optimization problem /
Particle swarm optimization (PSO) has simple implementation and robust performance and is appreciated as a popular optimization algorithm among engineers and researchers. However, two of its issues have yet to be improved: PSO converges into the local optimum for the high-dimensional optimization pr...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Kuala Lumpur :
Kulliyyah of Information and Communication Technology, International Islamic University Malaysia,
2019
|
| Subjects: | |
| Online Access: | http://studentrepo.iium.edu.my/handle/123456789/5410 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 034530000a22003010004500 | ||
|---|---|---|---|
| 008 | 190710s2019 my a f m 000 0 eng d | ||
| 040 | |a UIAM |b eng |e rd | ||
| 041 | |a eng | ||
| 043 | |a a-my-- | ||
| 050 | 0 | 0 | |a Q337.3 |
| 100 | 1 | |a Bashath, Samar Salem Ahmed Omar, |e author | |
| 245 | 1 | 0 | |a Improved particle swarm optimization for high-dimensional optimization problem / |c by Samar Salem Ahmed Omar Bashath |
| 264 | 1 | |a Kuala Lumpur : |b Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, |c 2019 | |
| 300 | |a xiv, 100 leaves : |b illustrations ; |c 30cm. | ||
| 336 | |2 rdacontent |a text | ||
| 347 | |2 rdaft |a text file |b PDF | ||
| 502 | |a Thesis (MCS)--International Islamic University Malaysia, 2019. | ||
| 504 | |a Includes bibliographical references (leaves 89-100). | ||
| 520 | |a Particle swarm optimization (PSO) has simple implementation and robust performance and is appreciated as a popular optimization algorithm among engineers and researchers. However, two of its issues have yet to be improved: PSO converges into the local optimum for the high-dimensional optimization problem, and it has slow convergence speed. This thesis aims to introduce a new variant of a particle swarm optimization algorithm (PSOLFS). PSOLFS is meant to acquire a global optimum solution and fast convergence speed for the high-dimensional optimization problem. It constitutes a combination of particle swarm optimization, Lévy flight-McCulloch and fast simulated annealing. We design PSOLFS based on a balance between exploration and exploitation. We implement Lévy flight-McCulloch in the PSO position to have the algorithm explore the large search space and to create diversity in the position. We implement Fast simulated annealing in the late iteration to make the algorithm select the most accurate solution. We evaluate the algorithm on 16 benchmark functions for 500 and 1,000 dimensions experiments. On 500 dimensions, the algorithm obtains the optimal value on 14 of the 16 functions. On 1,000 dimensions, the algorithm obtains the optimal value on eight benchmark functions and close to optimal on four functions. PSOLFS acquire 96% accuracy on 500 dimensions and 91% on 1000 dimensions. We also compare PSOLFS with other five PSO variants in terms of convergence accuracy and speed. The results demonstrate that it achieves a higher accuracy and faster convergence speed than other PSO variants. PSOLFS is an efficient and robust optimizer for optimizing high dimensional problems. In addition, the results of Wilcoxon test show a significant difference between PSOLFS and the other PSO variants. The results of all experiments have shown that the proposed method is useful for the PSO in terms not only avoiding the local optimum but also improving the convergence speed. | ||
| 596 | |a 1 | ||
| 655 | 7 | |a Theses, IIUM local | |
| 690 | |a Dissertations, Academic |x Department of Computer Science |z IIUM | ||
| 710 | 2 | |a International Islamic University Malaysia. |b Department of Computer Science | |
| 856 | 4 | |u http://studentrepo.iium.edu.my/handle/123456789/5410 | |
| 900 | |a sz-aaz | ||
| 999 | |c 441176 |d 473129 | ||
| 952 | |0 0 |6 T Q 000337.3 B297I 2019 |7 0 |8 THESES |9 763966 |a IIUM |b IIUM |c MULTIMEDIA |g 0.00 |o t Q 337.3 B297I 2019 |p 11100409583 |r 2020-08-07 |t 1 |v 0.00 |y THESIS | ||
| 952 | |0 0 |6 TS CDF Q 337.3 B297I 2019 |7 0 |8 THESES |9 858405 |a IIUM |b IIUM |c MULTIMEDIA |g 0.00 |o ts cdf Q 337.3 B297I 2019 |p 11100409584 |r 2020-08-07 |t 1 |v 0.00 |y THESISDIG | ||