Deterministic‐like solution to the non‐convex economic dispatch problem

Abstract This paper proposes a novel stochastic solution method for the static nonconvex power economic dispatch problem. All practical features such as valve point effects, ramp rate limits, prohibited operating zones, multiple fuel options, spinning reserve constraints, and transmission losses are considered. To develop the proposed algorithm, two modifications that significantly enhance the exploitation capability of the artificial bee colony algorithm are introduced. The first modification concerns onlooker and employed bees to focus their search around the best solution found so far. The second modification optimizes the escaping behavior from local minimums using scout bees. The proposed modifications form a multi‐level concentric search around the best solution found. Finally, combining the modified artificial bee colony algorithm with Levy flight cycles, which improve the escaping capability from local minimums, leads to the proposed algorithm. The algorithm parameters have been tuned to provide a deterministic‐like solution with ten benchmark problems. The improvement added by each proposed modification to the artificial bee colony algorithm has been confirmed using the Wilcoxon rank‐sum test. The obtained results by the proposed algorithm are superior compared to those reported in the literature. Moreover, estimated probabilities of more than 99.9% to obtain the global optimal solution are achieved.

Abstract licence: CC BY-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.