Optimal Thermal Generating Unit Commitment

Ayoub, A. K.; Patton, A.D.

doi:10.1109/tpas.1971.293167

Cited by 60 publications

(16 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This optimisation problem is of high dimension and combinatorial in nature, and can thus be difficult to solve in practice. Results using Heuristic methods (Johnson et al, 1971;Viana et al, 2001), Mixed Integer Programming (Dillon et al, 1978), Dynamic Programming (Ayuob and Patton, 1971) and Lagrangian Relaxation (Aoki et al, 1987;Shahidehpour and Tong, 1992), have been reported in literature.…”

Section: Introductionmentioning

confidence: 95%

Hierarchical model-based predictive control of a power plant portfolio

Edlund

Bendtsen

Jørgensen

2011

Control Engineering Practice

View full text Add to dashboard Cite

One of the main difficulties in large-scale implementation of renewable energy in exisiting power systems is that the production from renewable sources is difficult to predict and control. For this reason, fast and efficient control of controllable power producing units -so-called "portfolio control" -becomes increasingly important as the ratio of renewable energy in a power system grows.As a consequence, tomorrow's "smart grids" require highly flexible and scalable control systems compared to conventional power systems. This paper proposes simulations on a real-world scenario. Despite limited tuning, the new controller shows improvements in terms of ability to track reference production as well as economic performance.

show abstract

Section: Introductionmentioning

confidence: 95%

Hierarchical model-based predictive control of a power plant portfolio

Edlund

Bendtsen

Jørgensen

2011

Control Engineering Practice

View full text Add to dashboard Cite

show abstract

“…Although unit commitment and economic dispatch decisions are interdependent, for certain load changes the satisfaction of one constraint would result in the violation of the other constraint. A method could be proposed that can modify and update the commitment order [25] so as to produce a schedule that satisfies the constraints and yields the optimal solution, thereby minimizing the production cost. This paper focuses on the modified dynamic programming (MDP) method for solving the UCP as it demands superiority for suboptimal solutions in the case of any divergence in terms of accuracy.…”

Section: Modified Dynamic Programming For Unit Commitmentmentioning

confidence: 99%

Lambda optimization of constraint violating units in short-term thermal unit commitment using modified dynamic programming

Kandasamy¹,

Selvaraj²

2017

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

This paper presents a new approach with a three-stage optimization algorithm for the least-cost optimal solution of the unit commitment problem. In the proposed work, the optimal schedule is obtained by optimizing the lambda operator for the states that violate the inequality constraints. The objective of the work is to minimize the fuel cost when subjected to various constraints such as load balance, minimum up/down time, ramp limit, and spinning reserve. This method of committing the units yields the least-cost solution when applied to the IEEE 10-unit systems and 7-unit Indian utility practical systems scheduled for 24 h and the results obtained are compared with the existing methods.

show abstract

“…In one application (Ayoub and Patton 1971;Lowery 1966) where g I (y) is the cost of generating y MWs of power on unit |I |. It decomposes a problem into small pieces (states), explores all combinations (stages) of these pieces, and recovers the overall optimum recursively.…”

Section: Dynamic Programmingmentioning

confidence: 99%