| Budget Amount *help |
¥5,500,000 (Direct Cost: ¥5,500,000)
Fiscal Year 1997: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 1996: ¥1,200,000 (Direct Cost: ¥1,200,000)
Fiscal Year 1995: ¥3,500,000 (Direct Cost: ¥3,500,000)
|
|---|
| Research Abstract |
The thermal plant unit commitmetn is a very important problem to improve the economics of power system without degrading the reliability. Since the number of power plant is very large in the real power system, however, it is very difficult to search the optimal solution. It is especially dificult to solve the problem if there are any long term constraint such as fuel consumption constraint.
In this study, the algorithm that can solve large size unit commitment problem including fuel consumption constraint is developed. In the developed algorithm, first, candidates of possible solution for each period are obtained. Using the obtained candidates, the size of the problem can be reduced. Therefore, a combinatorial problem involved in the unit commitment probelm can be solved by existing algorithms such as genetic algorithm. The most important point in the algorithm is to obtain a good and effective candidates for each period. In this study, the method based on the priority list method is used.
In order to prove the effectiveness of the developed algorithm, 5-machine 10-period model and 10-machine 20-period model, and 20-machine 24-period model is used. It is clarified that the result using the developed algorithm is better than that using the simple priority list method, genetic algorithm, or Lagrangian relaxation method.
|
