z-logo
open-access-imgOpen Access
A hybrid invasive weed optimization algorithm for the economic load dispatch problem in power systems
Author(s) -
Zhi xin Zheng,
Jun Qing Li,
Hongshi Sang
Publication year - 2019
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2019138
Subject(s) - economic dispatch , mathematical optimization , crossover , computer science , convergence (economics) , genetic algorithm , electric power system , optimization problem , meta optimization , algorithm , optimization algorithm , power (physics) , mathematics , artificial intelligence , physics , quantum mechanics , economics , economic growth
In this study, a hybrid invasive weed optimization (HIWO) algorithm that hybridizes the invasive weed optimization (IWO) algorithm and genetic algorithm (GA) has been proposed to solve economic dispatch (ED) problems in power systems. In the proposed algorithm, the IWO algorithm is used as the main optimizer to explore the solution space, whereas the crossover and mutation operations of the GA are developed to significantly improve the optimization ability of IWO. In addition, an effective repair method is embedded in the proposed algorithm to repair infeasible solutions by handing various practical constraints of ED problems. To verify the optimization performance of the proposed algorithm and the effectiveness of the repair method, six ED problems in the different-scale power systems were tested and compared with other algorithms proposed in the literature. The experimental results indicated that the proposed HIWO algorithm can obtain the more economical dispatch solutions, and the proposed repair method can effectively repair each infeasible dispatch solution to a feasible solution. The convergence capability, applicability and effectiveness of HIWO were also demonstrated through the comprehensive comparison results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here