Dynamic dispatch by constructive dynamic programming

Travers, Dean L.; Kaye, R.J.

doi:10.1109/59.651616

Cited by 146 publications

(62 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraints (4) are ramp-down constraints, i.e., they limit the maximum decrease in power attainable at time instant t. We remark that this formulation is more general than those usually considered (cf. Bannister and Kaye 1991, Fan et al 2002, Travers and Kaye 1998, not only because the cost functions need not be piecewise linear, but also because we allow different limits t + and t − for ramp-up and ramp-down constraints, and we allow them to depend on the time instant t.…”

Section: Formulationmentioning

confidence: 99%

“…The approach is based on the following idea: redefine the state space of the dynamic programming procedure so that computation of the state costs reduces to a convex (although harder than in the standard case) problem, the economic dispatch with ramping constraints (ED). The efficiency is obtained by using a constructive dynamic programming procedure that solves (ED) with a piecewise-linear cost function, similar to that of Bannister and Kaye (1991) and Travers and Kaye (1998). Thus, two nested dynamic programming procedures are employed to obtain an overall efficient approach.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Frangioni

Gentile

2006

Operations Research

View full text Add to dashboard Cite

We present a dynamic programming algorithm for solving the single-unit commitment (1UC) problem with ramping constraints and arbitrary convex cost functions. The algorithm is based on a new approach for efficiently solving the single-unit economic dispatch (ED) problem with ramping constraints and arbitrary convex cost functions, improving on previously known ones that were limited to piecewise-linear functions. For simple convex functions, such as the quadratic ones typically used in applications, the solution cost of all the involved (ED) problems, consisting of finding an optimal primal and dual solution, is O n 3 . Coupled with a special visit of the state-space graph in the dynamic programming algorithm, this approach enables one to solve (1UC) with simple convex functions in O n 3 overall.

show abstract

Section: Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Frangioni

Gentile

2006

Operations Research

View full text Add to dashboard Cite

show abstract

“…To compensate for the approximation made using Maclaurin sine series expansion and to minimize the error due to approximation, an initialization factor, yi as given in (13) is multiplied to the right hand side of xi in (8).…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…There were a number of traditional methods to solve this problem such as, gradient projection algorithm [5], linear programming [6], Lagrangian relaxation [7] and dynamic programming (DP) [8]. In reality, due to valve point effect, the cost function is non-smooth and non-monotonically increasing and traditional methods fail.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Economic Dispatch with Valve-Point Effect Using Maclaurin Series Based Lagrangian Method

Hemamalini¹,

Simon²

2010

IJCA

View full text Add to dashboard Cite

Dynamic Economic Dispatch (DED) plays a vital role in power generation, operation and control. It is a complicated, non-linear constrained problem. In this paper, Maclaurin series based Lagrangian method (MSL) is used to solve the DED problem for generating units with valve-point effect, considering the ramp rate limits. Using Maclaurin series, the sine term used to model the valve-point effect is expanded and solved with Lagrangian method. The feasibility of the proposed method is validated for static economic dispatch problem for forty unit system and DED problem for five unit test system for 24 hour time interval. Results obtained with the proposed approach are compared with other techniques in the literature. The results obtained substantiate the applicability of the proposed method for solving static and dynamic economic dispatch problems with non-smooth cost functions.

show abstract

“…Dynamic programming can deliver various degrees of success [6], however, these techniques suffer from the perspective of its dimensionality.…”

Section: Introductionmentioning

confidence: 99%

Scheduling practical generating system using an improved bacterial swarm optimization

Raviprabakaran

Ravichandran

2016

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper This paper offers an improved technique namely, Quorum sensing based Bacterial Swarm Optimization (QBSO) technique to solve Practical Dynamic Economic Dispatch (PDED) problem. Quorum sensing is the communication signalling mechanism that permits the bacteria to organize the collective behaviour. The enhanced QBSO method improves the exploration capability of bacterial swarm. The practicability of the proposed method is tested on standard 10 generating unit system and the public practical south Indian 20 thermal generating system with recorded load demand profiles. The enhanced technique increases the operational speed of scheduling and reduces the generating cost of standard system and the thermal generating units owned by Tamilnadu Generation and Distribution Corporation Limited (TANGEDCO). The presented technique outperforms when compared with conventional bacterial swarm optimization technique and some recently published methods. Keywords: Dynamic Economic Dispatch; Practical Load Demand Profiles; Quorum Sensing based Bacterial Swarm Optimization; 20 South Indian Thermal UnitsProgramiranje praktičnog sustava generiranja uporabom poboljšane optimizacije bakterijskog roja Izvorni znanstveni članak Ovaj rad nudi poboljšanu metodu, naime, Quorum sensingbased Bacterial Swarm Optimization (QBSO) metodu za rješavanje problema praktične dinamične ekonomične isporuke -Practical Dynamic Economic Dispatch (PDED). Prepoznavanje kvoruma je mehanizam za signaliziranje komunikacije koji omogućuje organiziranje kolektivnog ponašanja bakterija. Poboljšana QBSO metoda povećava istraživačku sposobnost roja bakterija. Praktičnost predložene metode ispitana je na standardnomsustavu od 10 jedinicageneriranja energije i javnom praktičnom južno indijskom sustavu od 20 jedinica za generiranjetoplinske energije sa snimljenim profilima potrebnogopterećenja. Ta poboljšana metoda povećava operativnu brzinu programiranjaoperacija i smanjuje troškove generiranja standardnog sustava i jedinicaza dobivanje toplinske energije u vlasništvu Tamilnadu Generation and Distribution Corporation Limited (TANGEDCO). Prikazana metodaje bolja u usporedbi s konvencionalnom metodom optimizacije roja bakterija inekim nedavno objavljenim metodama.Ključne riječi: dinamična ekonomična isporuka; 20 South Indian Thermal Units; optimizacija roja bakterija temeljena naprepoznavanju kvoruma; praktični profili potreba opterećenja

show abstract

Dynamic dispatch by constructive dynamic programming

Cited by 146 publications

References 14 publications

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Dynamic Economic Dispatch with Valve-Point Effect Using Maclaurin Series Based Lagrangian Method

Scheduling practical generating system using an improved bacterial swarm optimization

Contact Info

Product

Resources

About