Particle swarm optimization with dual-level task allocation. (February 2015)
- Record Type:
- Journal Article
- Title:
- Particle swarm optimization with dual-level task allocation. (February 2015)
- Main Title:
- Particle swarm optimization with dual-level task allocation
- Authors:
- Lim, Wei Hong
Isa, Nor Ashidi Mat - Abstract:
- Abstract: Particle swarm optimization (PSO) is a well-known algorithm for global optimization over continuous search spaces. However, this algorithm is limited by the intense conflict between exploration and exploitation search processes. This improper adjustment of exploration and exploitation search processes can introduce an inappropriate level of diversity into the swarm, thereby either decelerating the convergence rate of the algorithm (caused by the excessive diversity) or inducing premature convergence (as a result of insufficient diversity). To address this issue, we propose a new PSO variant, namely, the PSO with dual-level task allocation (PSO–DLTA). Two task allocation modules, that is, the dimension-level task allocation (DTA) and the individual-level task allocation (ITA) modules, are developed in PSO–DLTA to balance the exploration and exploitation search processes. Unlike existing population-based and individual-based task allocation approaches, the DTA module assigns different search strategies to different dimensional components of a particle. Meanwhile, the ITA module serves as an alternative learning phase to enhance the PSO–DLTA particle if it fails to improve in terms of fitness in the DTA module. To demonstrate the effectiveness and efficiency of PSO–DLTA, we compare it with several recently developed optimization algorithms on 25 benchmark and 2 engineering design problems. Experimental results reveal that the proposed PSO–DLTA is more competitive thanAbstract: Particle swarm optimization (PSO) is a well-known algorithm for global optimization over continuous search spaces. However, this algorithm is limited by the intense conflict between exploration and exploitation search processes. This improper adjustment of exploration and exploitation search processes can introduce an inappropriate level of diversity into the swarm, thereby either decelerating the convergence rate of the algorithm (caused by the excessive diversity) or inducing premature convergence (as a result of insufficient diversity). To address this issue, we propose a new PSO variant, namely, the PSO with dual-level task allocation (PSO–DLTA). Two task allocation modules, that is, the dimension-level task allocation (DTA) and the individual-level task allocation (ITA) modules, are developed in PSO–DLTA to balance the exploration and exploitation search processes. Unlike existing population-based and individual-based task allocation approaches, the DTA module assigns different search strategies to different dimensional components of a particle. Meanwhile, the ITA module serves as an alternative learning phase to enhance the PSO–DLTA particle if it fails to improve in terms of fitness in the DTA module. To demonstrate the effectiveness and efficiency of PSO–DLTA, we compare it with several recently developed optimization algorithms on 25 benchmark and 2 engineering design problems. Experimental results reveal that the proposed PSO–DLTA is more competitive than its contenders in terms of searching accuracy, reliability, and efficiency with respect to most of the tested functions. Graphical abstract: The graphical illustration of the proposed Particle Swarm Optimization with Dual-Level Task Allocation (PSO–DLTA), consisting of the DTA module and the ITA module. Highlights: A PSO variant, i.e., PSO–DLTA is proposed to balance the global/local searches. DTA module allows the particle to perform different task in different dimension. ITA module is designed as the alternative learning mechanism for PSO–DLTA. PSO–DLTA has demonstrated competitive searching performance in optimization. Results show that PSO–DLTA outperforms other PSO variants and MS algorithms. … (more)
- Is Part Of:
- Engineering applications of artificial intelligence. Volume 38(2015:Feb.)
- Journal:
- Engineering applications of artificial intelligence
- Issue:
- Volume 38(2015:Feb.)
- Issue Display:
- Volume 38 (2015)
- Year:
- 2015
- Volume:
- 38
- Issue Sort Value:
- 2015-0038-0000-0000
- Page Start:
- 88
- Page End:
- 110
- Publication Date:
- 2015-02
- Subjects:
- Particle swarm optimization (PSO) -- Dual-level task allocation (DLTA) -- Dimension-level task allocation (DTA) -- Individual-level task allocation (ITA) -- Metaheuristic search (MS)
Engineering -- Data processing -- Periodicals
Artificial intelligence -- Periodicals
Expert systems (Computer science) -- Periodicals
Ingénierie -- Informatique -- Périodiques
Intelligence artificielle -- Périodiques
Systèmes experts (Informatique) -- Périodiques
Artificial intelligence
Engineering -- Data processing
Expert systems (Computer science)
Periodicals
620.00285 - Journal URLs:
- http://www.sciencedirect.com/science/journal/09521976 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.engappai.2014.10.022 ↗
- Languages:
- English
- ISSNs:
- 0952-1976
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3755.704500
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 10089.xml