Short-term Generation Scheduling with Take-or-pay Fuel Contract using an Evolutionary Programming Technique

摘要

This paper describes an evolutionary programming based optimization technique for solving the short-term generation scheduling problem with take-or-pay fuel contract. The load constraints, operation constraints and the fuel constraints are fully taken into account, and the proposed methodology handles them effectively. The methodology described in this paper is a general methodology based on evolutionary programming technique which is capable of providing the global optimum generation schedule under take-or-pay fuel contract irrespective of any kind of heat-rate functions including the effect of valve-point loadings. The solution methodology is demonstrated through a test example, in which the generation loadings of a fuel-constrained and an equivalent steam unit are scheduled in a 24-h schedule horizon. The proposed method has been applied to the various test cases and the results obtained are discussed. The evolutionary programming based technique in obtaining optimal generation dispatch can considerably make the automatic generation control strategy convenient and less time consuming.