| Title |
Economic Dispatch Algorithm as Combinatorial Optimization Problems |
| Authors |
민경일(Min, Kyung-Il) ; 이수원(Lee, Su-Won) ; 최인규(Choi, In-Kyu) ; 문영현(Moon, Young-Hyun) |
| Keywords |
Combinatorial Optimization Problems ; Economic Dispatch ; Genetic Algorithm ; Multiple Fuel Option ; Prohibited Operating Zone ; {Λ}-P Table Method |
| Abstract |
This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the {Λ}-P function method is used to calculate ED for the fitness function of GA. The {Λ}-P function method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with two kinds of ED problems, namely ED with multiple fuel units (EDMF) and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all the ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms. |