Power generation scheduling by neural network |
| |
Authors: | KENICHI AOKI MASAKAZU KANEZASHI MASARU ITOH HARUKI MATSUURA |
| |
Affiliation: | 1. Department of Management and Information Sciences , School of Business, Hiroshima Prefectural University , 562 Nanatsuka-cho, Shobara City, Hiroshima, 727, Japan;2. Department of International Business and Management , School of Business Administration, Kanagawa University , 2946 Tsuchiya-cho, Hiratsuka City, Kanagawa, 259-12, Japan |
| |
Abstract: | A new method for solving a power generation scheduling problem in an electric power system is presented. The objective is to determine the hourly start-up/ shut-down schedules of all generators so that forecasted hourly power demands per day may be met and total operating costs, the sum of setup and fuel costs for a given day, may be minimized. The problem may be formulated as a large-scale combinatorial optimization problem which includes 0-1 variables representing the start-up/shut-down of generators and continuous variables representing the power outputs. Determination of an optimalsolution within practical time limits is consequently difficult. Until now, the lagrangian relaxation method has been studied as it appeared to be the most practical method for obtaining an approximate solution to the problem. The efficiency of this method, however, depends on how the Lagrange multipliers are determined. Here, it is proposed that the Lagrange multipliers be estimated by utilizing the neural network and results determined from examination of the possibility of applying the backpropagation algorithm to pattern recognitions which presume the relationship between power demand pattern and Lagrange multipliers are reported. Through numerical experiments, it was established that the Lagrange multipliers, estimated by the neural network, are applicable to the problem. |
| |
Keywords: | |
|
|