Naser Mollaverdi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Naser Mollaverdi has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hamid Azad
Department of Electrical Engineering, Shiraz Branch, Islamic Azad University, Shiraz, Iran
1 shared publication Nader Shetab Boushehri
Department of Industrial and Systems Engineering, Isfahan University of Technology, Esteghlal Square, Isfahan 84156-83111, Iran
1 shared publication- Soroush Safarzadeh
Department of Industrial Engineering, Faculty of Engineering Science, Quchan University of Technology, Quchan, Iran
1 shared publication Zahra Esmaeeli
1 shared publication
Latest Publications
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Bio-Inspired Computation
- Vol. 4 (5) , 319
Investigating the application of opposition concept to colonial competitive algorithm
Evolutionary algorithms (EAs) are well-known optimisation approaches to deal with non-linear and complex problems. However, these population-based algorithms are computationally expensive due to the slow nature of the evolutionary process. This paper presents a novel algorithm to accelerate colonial competitive algorithm (CCA). The proposed opposition-based CCA (OCCA) employs opposition-based learning (OBL) for population initialisation and also for generation jumping. In this work, opposite countries and colonies have been utilised to improve the convergence rate of CCA. A comprehensive set of 15 complex benchmark functions including a wide range of dimensions is employed for experimental verification. The influences of dimensionality and population size are also investigated. Experimental results confirm that the OCCA outperforms the original CCA in terms of convergence speed and robust.
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Bio-Inspired Computation
- Vol. 4 (5) , 319
Investigating the application of opposition concept to colonial competitive algorithm
Evolutionary algorithms (EAs) are well-known optimisation approaches to deal with non-linear and complex problems. However, these population-based algorithms are computationally expensive due to the slow nature of the evolutionary process. This paper presents a novel algorithm to accelerate colonial competitive algorithm (CCA). The proposed opposition-based CCA (OCCA) employs opposition-based learning (OBL) for population initialisation and also for generation jumping. In this work, opposite countries and colonies have been utilised to improve the convergence rate of CCA. A comprehensive set of 15 complex benchmark functions including a wide range of dimensions is employed for experimental verification. The influences of dimensionality and population size are also investigated. Experimental results confirm that the OCCA outperforms the original CCA in terms of convergence speed and robust.