Results 251 to 260 of about 918 (298)
Some of the next articles are maybe not open access.

An Efficient Hydrothermal Scheduling Algorithm

IEEE Power Engineering Review, 1987
In this paper a Hydrothermal Scheduling Algorithm (HSA) for deterministic inflows is presented. A nonlinear network flow model representing the hydrothermal scheduling problem is used. By exploiting the special network structure, a temporally expanded arborescence [1], the HSA code attains important computational savings in processing time and memory ...
M. F. Carvalho, S. Soares
openaire   +1 more source

Scheduling of hydrothermal power systems

IEEE Transactions on Power Systems, 1993
The authors present a method for scheduling hydrothermal power systems based on the Lagrangian relaxation technique. By using Lagrange multipliers to relax system-wide demand and reserve requirements, the problem is decomposed and converted into a two-level optimization problem.
H. Yan, P.B. Luh, X. Guan, P.M. Rogan
openaire   +1 more source

An hybrid technique to hydrothermal scheduling

2005 International Power Engineering Conference, 2005
This paper reports on a new hybrid method to solve the short-term operation planning problem of hydrothermal power systems. It uses evolutionary programming to determine the optimal schedules of all hydro and thermal power plants in a closed optimization. Neural network is trained to satisfy the volume constraint imposed by the hydro plant.
M.R. Babu, T.D. Sudhakar, K. Mohanadasse
openaire   +1 more source

A bundle method for hydrothermal scheduling

IEEE Transactions on Power Systems, 1999
Lagrangian relaxation has been widely used in hydrothermal scheduling. Complicating constraints are relaxed by multipliers which are usually updated by a subgradient method (SGM). The SGM suffers from slow convergence caused by the nondifferentiable characteristics of dual functions.
null Daoyuan Zhang   +2 more
openaire   +1 more source

Optimal scheduling of hydrothermal systems

Proceedings of the Institution of Electrical Engineers, 1972
The paper describes new algorithms based on 1st-order-gradient techniques for long-term and short-term scheduling of multistorage hydroelectric and multithermal systems for minimum operational cost, with system variables in discrete form, and water inflows and load demands as deterministic. Constraints on various para meters are duly taken into account.
S.K. Agarwal, I.J. Nagrath
openaire   +1 more source

Crisscross differential evolution algorithm for constrained hydrothermal scheduling

Applied Soft Computing, 2020
Abstract This paper proposes a novel chaotic-crisscross differential evolution (CCDE) algorithm to realize an optimal generation schedule of multi-chain short-term hydrothermal system over 24 hours’ time-horizon in a multi-objective framework, considering conflicting economic-environmental aspects of thermal units.
Manbir Kaur   +2 more
openaire   +1 more source

Optimal Scheduling Of Large Hydrothermal Power Systems

IEEE Transactions on Power Apparatus and Systems, 1985
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.
John J. Shaw   +2 more
openaire   +1 more source

Optimal hydrothermal scheduling with variable production coefficient

Mathematical Methods of Operations Research (ZOR), 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huberto J. Bortolossi   +2 more
openaire   +1 more source

Hydrothermal scheduling based Lagrangian relaxation approach to hydrothermal coordination

IEEE Transactions on Power Systems, 1998
This paper presents an improved Lagrangian relaxation based hydrothermal coordination algorithm. By using Lagrangian multipliers to relax system-wide demand and reserve requirements, the problem is decomposed into thermal and hydro subproblems. The thermal subproblem is solved by using dynamic programming without discretizing generation levels. Instead
M.S. Salam, K.M. Nor, A.R. Hamdam
openaire   +1 more source

A network flow algorithm for hydrothermal scheduling

POWERCON '98. 1998 International Conference on Power System Technology. Proceedings (Cat. No.98EX151), 2002
This paper presents a new primal-dual algorithm, which is capable of solving nonlinear network flow problem with convex separable cost. One of the main characteristics of the algorithm is that it can begin with any circulation, feasible or not, provided that node conservation conditions are satisfied. Furthermore, this paper introduces how to apply the
null Guangyu He   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy