Journal ArticleDOI
Implementation of a Lagrangian relaxation based unit commitment problem
TLDR
The Lagrangian relaxation methodology has been used for solving the unit commitment problem as discussed by the authors, which is a class of complex combinatorial optimization problems in the power system, where the objective is to obtain an overall least-cost solution for operating the system over the scheduling horizon.Abstract:
The unit commitment problem in a power system involves determining a start-up and shut-down schedule of units to be used to meet the forecasted demand, over a future short term (24-168 hour) period. In solving the unit commitment problem, generally two basic decisions are involved. The "unit commitment" decision involves determining which generating units are to be running during each hour of the planning horizon, considering system capacity requirements including reserve, and the constraints on the start up and shut down of units. The related "economic dispatch" decision involves the allocation of system demand and spinning reserve capacity among the operating units during each specific hour of operation. As these two decisions are interrelated, the unit commitment problem generally embraces both these decisions, and the objective is to obtain an overall least cost solution for operating the power system over the scheduling horizon. The unit commitment problem belongs to the class of complex combinatorial optimization problems. During the past decade a new approach named "Lagrangian Relaxation" has been evolving for generating efficient solutions for this class of problems. It derives its name from the well-known mathematical technique of using Lagrange multipliers for solving constrained optimization problems, but is really a decomposition technique for the solution of large scale mathematical programming problems. The Lagrangian relaxation methodology generates easy subproblems for deciding commitment and generation schedules for single units over the planning horizon, independent of the commitment of other units.read more
Citations
More filters
Observer-Based Monitors for Electromechanical Dynamics in Power Networks 1
TL;DR: In this article, an observer-based monitor can be used to detect and identify specific occurrences of faults in a power system, in the presence of disturbances and uncertainty, using a small 3-bus and an intermediate-sized 179-bus power system.
Journal ArticleDOI
Wind-Thermal Integrated Power System Scheduling Problem Using Cuckoo Search Algorithm
TL;DR: A new nature inspired metaheuristic algorithm known as the cuckoo search algorithm (CSA) is presented in this paper, to solve the unit commitment problem (UCP) for hybrid power system.
Journal ArticleDOI
Fast Lagrangian relaxation for constrained generation scheduling in a centralized electricity market
TL;DR: A fast Lagrangian relaxation (FLR) for constrained generation scheduling (CGS) problem in a centralized electricity market that minimizes the consumer payment rather than the total supply cost subject to the power balance, spinning reserve, transmission line, and generator operating constraints is proposed.
Journal ArticleDOI
A double-filtration algorithm for optimal scheduling of thermal units
Sun-Nien Yu,Nanming Chen +1 more
TL;DR: In this paper, a double-filtration algorithm was proposed to solve the problem of combining unit commitment and economic dispatch of the thermal units while minimizing cost in a large-scale power system.
Proceedings ArticleDOI
Evolutionary computation based unit commitment using Hybrid Priority List approach
Manisha Govardhan,Ranjit Roy +1 more
TL;DR: It is found from the comparison of these three algorithms that the Gbest based Artificial Bee Colony (ABC) yields the best optimum solution.
References
More filters
Journal ArticleDOI
The Lagrangian Relaxation Method for Solving Integer Programming Problems
TL;DR: This paper is a review of Lagrangian relaxation based on what has been learned in the last decade and has led to dramatically improved algorithms for a number of important problems in the areas of routing, location, scheduling, assignment and set covering.
Journal ArticleDOI
Validation of subgradient optimization
TL;DR: It is concluded that the “relaxation” procedure for approximately solving a large linear programming problem related to the traveling-salesman problem shows promise for large-scale linear programming.
Journal ArticleDOI
A dual-based procedure for uncapacitated facility location
TL;DR: This approach has obtained and verified optimal solutions to all the Kuehn-Hamburger location problems in well under 0.1 seconds each on an IBM 360/91 computer, with no branching required.
Journal ArticleDOI
An Applications Oriented Guide to Lagrangian Relaxation
TL;DR: This tutorial provides a practical guide to the use of Lagrangian relaxation and an on-line computerized routing and scheduling optimizer.
Journal ArticleDOI
Towards a more rigorous and practical unit commitment by Lagrangian relaxation
F. Zhuang,Francisco D. Galiana +1 more
TL;DR: A mathematically based, systematic and generally applicable procedure to search for a reserve-feasible dual solution for power system generator unit commitment, giving reliable performance and low execution times.
Related Papers (5)
Towards a more rigorous and practical unit commitment by Lagrangian relaxation
F. Zhuang,Francisco D. Galiana +1 more