Journal ArticleDOI
Optimal Scheduling Of Large Hydrothermal Power Systems
TLDR
In this paper, the authors present a new algorithm to find the optimal unit commitment and economic dispatch (UC/D) for a large hydrothermal power system, which is a large nonlinear, mixed integer optimization problem involving over 16,800 integer variables.Abstract:
In this paper we present a new algorithm to find the optimal unit commitment and economic dispatch (UC/D) for a large hydrothermal power system. Mathematically, this is a large nonlinear, mixed integer optimization problem involving over 16,800 integer variables for a system having 100 thermal units with a 1-week scheduling horizon. We use a dual programming approach to solve a separate optimal control problem for each thermal unit and for each set of coupled hydro units. The algorithm has been tested on a 100 thermal unit/6 hydro unit system having a 168-hour scheduling period, and will find solutions that are within 0.1 to 0.25 percent of the optimal dual cost. We report computational results for a system modeled after the New York Power Pool.read more
Citations
More filters
Journal ArticleDOI
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
TL;DR: An outer-approximation algorithm is presented for solving mixed-integer nonlinear programming problems of a particular class and a theoretical comparison with generalized Benders decomposition is presented on the lower bounds predicted by the relaxed master programs.
Journal ArticleDOI
Unit commitment literature synopsis
Gerald B. Sheblé,G.N. Fahd +1 more
TL;DR: Several optimization techniques have been applied to the solution of the thermal unit commitment problem as discussed by the authors, ranging from heuristics such as complete enumeration to the more sophisticated ones such as augmented LaGrangian.
Journal ArticleDOI
A new relaxation algorithm and passive sensor data association
TL;DR: In this paper, the measurement-target association problem is formulated as one of maximizing the joint likelihood function of the measurement partition, which leads to a generalization of the 3D assignment (matching) problem, which is known to be NP hard.
Journal ArticleDOI
The generalized unit commitment problem
TL;DR: In this article, a generalized version of the unit commitment problem is formulated, which can treat minimum up-and down-time constraints, power flow constraints, line flow limits, voltage limits, reserve constraints, ramp limits, and total fuel and energy limits on hydro and thermal power generating units.
Journal ArticleDOI
Scheduling of manufacturing systems using the Lagrangian relaxation technique
Peter B. Luh,Debra J. Hoitomt +1 more
TL;DR: Langrangian relaxation is used to decompose each of the scheduling problems into job- or operation-level subproblems which results in algorithms which generate near-optimal schedules efficiently, while giving a lower bound on the optimal cost.
References
More filters
Journal ArticleDOI
Optimal Power Flow By Newton Approach
TL;DR: In this paper, a direct simultaneous solution for all of the unknowns in the Lagrangian function on each iteration is proposed, where each iteration minimizes a quadratic approximation of the Lagrangeian.
Journal ArticleDOI
Minimization of unsmooth functionals
TL;DR: In this paper, the authors consider the minimization of a convex, but necessarily differentiable, functional in convex set of Hilbert space, and show how the method may be modified if the minimum of the functional is unknown.
Journal ArticleDOI
A New Method for Unit Commitment at Electricite De France
A. Merlin,P. Sandrin +1 more
TL;DR: A new Lagrangian relaxation method is proposed, which produces optimal solutions for unit commitment and the flexibility of the algorithm is such that numerous developments can be envisaged, such as simultaneous management of pumping units, probabilistic determination of the spinning reserve, etc.
Journal ArticleDOI
An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
TL;DR: A branch-and-bound algorithm is proposed using a Lagrangian method to decompose the problem into single generator problems and a sub gradient method is used to select the Lagrange multipliers that maximize the lower bound produced by the relaxation.
Journal ArticleDOI
Optimal short-term thermal unit commitment
C.K. Pang,H.C. Chen +1 more
TL;DR: A truncated dynamic programming method for the commitment of thermal units over a period of up to 48 hours is described, such that the total cost is minimal.