Bashath, Samar and Ismail, Amelia Ritahani (2018) Comparison of swarm intelligence algorithms for high dimensional optimization problems. Indonesian Journal of Electrical Engineering and Computer Science, 11 (1). pp. 300-307. ISSN 2502-4752
PDF
- Published Version
Restricted to Repository staff only Download (273kB) | Request a copy |
||
|
PDF (SCOPUS)
- Supplemental Material
Download (507kB) | Preview |
Abstract
High dimensional optimization considers being one of the most challenges that face the algorithms for finding an optimal solution for real-world problems. These problems have been appeared in diverse practical fields including business and industries. Within a huge number of algorithms, selecting one algorithm among others for solving the high dimensional optimization problem is not an easily accomplished task. This paper presents a comprehensive study of two swarm intelligence based algorithms: 1- particle swarm optimization (PSO), 2-cuckoo search (CS).The two algorithms are analyzed and compared for problems consisting of high dimensions in respect of solution accuracy, and runtime performance by various classes of benchmark functions.
Item Type: | Article (Journal) |
---|---|
Additional Information: | 4296/65214 |
Uncontrolled Keywords: | Cuckoo search, High dimensional problem, Swarm intelligence , algorithms, Particle swarm optimization |
Subjects: | T Technology > T Technology (General) T Technology > T Technology (General) > T55.4 Industrial engineering.Management engineering. > T58.7 Production capacity. Manufacturing capacity |
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button): | Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science |
Depositing User: | Amelia Ritahani Ismail |
Date Deposited: | 20 Aug 2018 16:41 |
Last Modified: | 20 Aug 2018 16:42 |
URI: | http://irep.iium.edu.my/id/eprint/65214 |
Actions (login required)
View Item |