Hybridizing invasive weed optimization with firefly algorithm for unconstrained and constrained optimization problems
Kasdirin, HA, Yahya, NM, Aras, MSM and Tokhi, MO (2017). Hybridizing invasive weed optimization with firefly algorithm for unconstrained and constrained optimization problems. Journal of Theoretical and Applied Information Technology. 95 (4), pp. 912-927.
|Authors||Kasdirin, HA, Yahya, NM, Aras, MSM and Tokhi, MO|
© 2005 – ongoing JATIT & LLS. This study presents a hybrid invasive weed firefly optimization (HIWFO) algorithm for global optimization problems. Unconstrained and constrained optimization problems with continuous design variables are used to illustrate the effectiveness and robustness of the proposed algorithm. The firefly algorithm (FA) is effective in local search, but can easily get trapped in local optima. The invasive weed optimization (IWO) algorithm, on the other hand, is effective in accurate global search, but not in local search. Therefore, the idea of hybridization between IWO and FA is to achieve a more robust optimization technique, especially to compensate for the deficiencies of the individual algorithms. In the proposed algorithm, the firefly method is embedded into IWO to enhance the local search capability of IWO algorithm that already has very good exploration capability. The performance of the proposed method is assessed with four well-known unconstrained problems and four practical constrained problems. Comparative assessments of performance of the proposed algorithm with the original FA and IWO are carried out on the unconstrained problems and with several other hybrid methods reported in the literature on the practical constrained problems, to illustrate its effectiveness. Simulation results show that the proposed HIWFO algorithm has superior searching quality and robustness than the approaches considered.
|Journal||Journal of Theoretical and Applied Information Technology|
|Journal citation||95 (4), pp. 912-927|
|Publisher||London South Bank University|
|28 Feb 2017|
|Publication process dates|
|Deposited||13 Feb 2018|
|Accepted||28 Feb 2017|
|Accepted author manuscript|
CC BY-NC-ND 4.0
2views this month
1downloads this month