z-logo
open-access-imgOpen Access
Cuckoo search algorithm for non‐convex economic dispatch
Author(s) -
Vo Dieu N.,
Schegner Peter,
Ongsakul Weerakorn
Publication year - 2013
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2012.0142
Subject(s) - cuckoo , cuckoo search , brood parasite , economic dispatch , mathematical optimization , heuristic , computer science , regular polygon , nesting (process) , obligate , nest (protein structural motif) , algorithm , power (physics) , electric power system , host (biology) , mathematics , engineering , ecology , biology , particle swarm optimization , geometry , physics , quantum mechanics , mechanical engineering , biochemistry , parasitism
This study proposes a cuckoo search algorithm (CSA) for solving non‐convex economic dispatch (ED) considering generator and system characteristics including valve‐point effects, multiple fuels, prohibited zones, spinning reserve and power loss. CSA is a new meta‐heuristic optimisation method inspired from the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds of other species. When the host birds discover an alien egg in their nest, they can either throw it away or simply abandon their nest and build a new one elsewhere. The CSA idealised such breeding behaviour in combination with Lévy flights behaviour of some birds and fruit flies for applying to various constrained optimisation problems. The effectiveness of the proposed method has been tested on different non‐convex ED problems. Test results have indicated that the proposed method can obtain less expensive solutions than many other methods reported in the literature. Accordingly, the proposed CSA is a promising method for solving the practical nonconvex ED problems.

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