Unit Commitment by Augmented Lagrangian Relaxation: Testing Two Decomposition Approaches

Distributed security constrained economic dispatch

“…This approach has been widely used in power system optimization problems, for instance, Beltran et al utilized ALR decomposition to solve unit commitment problem. According to [17], one of the drawbacks of ALR method is the introduction of a nonseparable quadratic term, which requires few additional methods such as auxiliary problem principle to deal with this non-separability of the corresponding Lagrangian function. An interesting study on the application of ALR in multi-area optimal power flow is performed by Conejo and his colleagues in 2003, which highlighted the advantages of this method.…”

“…The constraints linking different sub-problems are then taken into account and the master problem is solved. There are many techniques discussed in the literature to utilize decomposition techniques to facilitate such optimization [17] [18]. In [19], the discrete ED problem is formulated as a knapsack problem.…”

Distributed optimization for real-time railway traffic management

“…For dealing with the non-separable quadratic term in the augmented Lagrangian function (18), we apply a block coordinate descent (Beltran Royoa and Heredia, 2002;Negenborn et al, 2008). The approach minimizes the quadratic term directly in a serial manner.…”

Unit Commitment Solution Using Particle Swarm Optimisation (PSO)

“…Unit commitment can be defined as the selection of generators that must be operated to meet the forecasted load demand on the system over a period of time so that fuel cost is minimum [2,3,4,5,6,7,8]. The Unit Commitment Problem (UCP) is to determine a minimal cost turn-on and turn-off schedule of a set of electrical power generating units to meet a load demand [23] while satisfying a set of operational constraints.It is a well known problem in power industry and helps in saving fuel cost if units are committed correctly so that fuel cost is saved.…”