A Novel Lagrangian Multiplier Update Algorithm for Short-Term Hydro-Thermal Coordination

Abstract

The backbone of a conventional electrical power generation system relies on hydro-thermal coordination. Due to its intrinsic complex, large-scale and constrained nature, the feasibility of a direct approach is reduced. With this limitation in mind, decomposition methods, particularly Lagrangian relaxation, constitutes a consolidated choice to “simplify” the problem. Thus, translating a relaxed problem approach indirectly leads to solutions of the primal problem. In turn, the dual problem is solved iteratively, and Lagrange multipliers are updated between each iteration using subgradient methods. However, this class of methods presents a set of sensitive aspects that often require time-consuming tuning tasks or to rely on the dispatchers’ own expertise and experience. Hence, to tackle these shortcomings, a novel Lagrangian multiplier update adaptative algorithm is proposed, with the aim of automatically adjust the step-size used to update Lagrange multipliers, therefore avoiding the need to pre-select a set of parameters. A results comparison is made against two traditionally employed step-size update heuristics, using a real hydrothermal scenario derived from the Portuguese power system. The proposed adaptive algorithm managed to obtain improved performances in terms of the dual problem, thereby reducing the duality gap with the optimal primal problem.

Optimal Generation Scheduling in Hydro-Power Plants with the Coral Reefs Optimization Algorithm

“…The Linear Programming application [9], Lagrangian multiplier, in which this class of method presents a set of sensitive aspects that often require time-consuming tuning tasks [10], and the Branch-and-Bound with Projected Gradient methods [11] (in which it is not clear how the penstock losses and operational coefficients of turbines were obtained) are also common strategies for solving UC problems to minimize operational costs. These deterministic methods have some advantages as a convergence guarantee, less computational effort, flexible formulation, and not requiring the calculation of second derivatives (in Gradient methods).…”

Multivariable Optimisation for Waiting-Time Minimisation at Roundabout Intersections in a Cyber-Physical Framework

“…The same method is used in a manifold of applications to minimise a cost function with constraints, such as [34][35][36]. Among the applications that are based on this method, one can enumerate the following: trajectory planning for unmanned ground vehicles [37], optimal control of a diesel engine [38], minimisation of fuel consumption in a hybrid electric vehicle [39], control of dynamics of a robot manipulator [40] and thermal applications [41,42]. The main advantages of our proposed solution with respect to similar works are:…”