A comparison of genetic algorithms with conventional techniques on a spectrum of power economic dispatch problems

摘要

The mathematical formulation for a power economic dispatch problem can be variously defined according to utilities' central focus. Conventionally, it is common practice to approach different dispatch problems via different techniques. The time and design effort, thus induced in partly altering or entirely replacing the existing technique, is not desirable. This paper demonstrates the robustness of a search technique based on genetic algorithms (GAs) against a number of conventional techniques over a spectrum of power dispatch problems. The problems investigated are in increasing order of complexity. Initially, GAs cannot do better than conventional techniques when the simple problem formulation is encountered, e.g. in the case of static classic Economic Dispatch. However, when problems become progressively more complicated, GAs gradually overtake conventional techniques which are limited mainly by solution accuracy. The outcome of the study clearly shows the robustness and suitability of GAs on the power dispatch problems, and verifies the fact that the more complex the problem is, the more benefit one can obtain from a GA.