首页 | 官方网站   微博 | 高级检索  
     


Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling
Affiliation:1. Chemical Engineering Department, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;2. Department of Chemical Engineering, The Petroleum Institute, Khalifa University, P.O. Box 2533, Abu Dhabi, United Arab Emirates;1. MECO Research Team, Department Mechanical Engineering, KU Leuven, Belgium;2. DMMS corelab, Flanders Make, Leuven, Belgium
Abstract:Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.
Keywords:Short-term generation scheduling  Profit-based unit commitment  Cost-based unit commitment  Lagrangian relaxation  Evolutionary algorithm  Economic dispatch
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号