2019
DOI: 10.11591/ijece.v9i4.pp2732-2742
|View full text |Cite
|
Sign up to set email alerts
|

MILP-Based Short-Term Thermal Unit Commitment and Hydrothermal Scheduling Including Cascaded Reservoirs and Fuel Constraints

Abstract: <span>Reservoirs are often built in cascade on the same river system, introducing inexorable constraints. It is therefore strategically important to scheme out an efficient commitment of thermal generation units along with the scheduling of hydro generation units for better operational efficiency, considering practical system conditions. This paper develops a comprehensive, unit-wise hydraulic model with reservoir and river system constraints, as well as gas constraints, with head effects, to commit ther… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 24 publications
(64 reference statements)
0
12
0
Order By: Relevance
“…Reference [39] implemented Stochastic Mixed-Integer Linear Programming (SMILP) algorithm to solve CSTHTS problem under uncertainty on Chilean Central Interconnected system while using Progressive Hedging Algorithm (PHA) with which each sub-problem is solved in parallel. Reference [40] has implemented a mixed-integer linear programming (MILP) methodology, using the branch and bound & cut (BB&C) algorithm, to solve CSTHTS problem. In reference [41], a logarithmic size mixed-integer linear programming (MILP) method was proposed for the CSTHTS problem, [29]- [32], [40] Robust solutions achieved but not better than metaheuristic algorithms.…”
Section: Lagrangian Relaxation and Benders Decompositionmentioning
confidence: 99%
See 1 more Smart Citation
“…Reference [39] implemented Stochastic Mixed-Integer Linear Programming (SMILP) algorithm to solve CSTHTS problem under uncertainty on Chilean Central Interconnected system while using Progressive Hedging Algorithm (PHA) with which each sub-problem is solved in parallel. Reference [40] has implemented a mixed-integer linear programming (MILP) methodology, using the branch and bound & cut (BB&C) algorithm, to solve CSTHTS problem. In reference [41], a logarithmic size mixed-integer linear programming (MILP) method was proposed for the CSTHTS problem, [29]- [32], [40] Robust solutions achieved but not better than metaheuristic algorithms.…”
Section: Lagrangian Relaxation and Benders Decompositionmentioning
confidence: 99%
“…Reference [40] has implemented a mixed-integer linear programming (MILP) methodology, using the branch and bound & cut (BB&C) algorithm, to solve CSTHTS problem. In reference [41], a logarithmic size mixed-integer linear programming (MILP) method was proposed for the CSTHTS problem, [29]- [32], [40] Robust solutions achieved but not better than metaheuristic algorithms. Though the algorithms show better performance in terms of avoiding premature convergence to local optimum than Lagrangian and bender's decomposition methods.…”
Section: Lagrangian Relaxation and Benders Decompositionmentioning
confidence: 99%
“…In this turbine consists of: Base frame, Inlet Valve, Hang Regulator and Rotor (Runner). Base frame made of Mild Steel, Profiles "U", equipped with armature planted in the foundation and open-flume to direct wastewater into waterways [31][32][33][34].…”
Section: Turbine Plansmentioning
confidence: 99%
“…Application results reveal that for the proposed unit commitment problem, the scheduling of the distributed generations and the best sizes of BBs would be completely different when the accessibility of wind energy was taken into consideration in consequence of using HN method. In [84][85][86][87][88][89][90] unit commitment problem was elucidated by considering different hybrid renewable energy systems.…”
Section: Unit Commitment Using Optimization Techniquesmentioning
confidence: 99%