Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley

Wim van Ackooij; Claudia D'Ambrosio; Dimitri Thomopulos; Renan Spencer Trindade

doi:10.1016/j.ejor.2020.12.029

Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley

Wim van Ackooij
, Claudia D'Ambrosio
, Dimitri Thomopulos
, Renan Spencer Trindade

Lamsid/EDF/R and D
DESTEC
University of Pisa
Laboratoire d'Informatique (LIX)

Research output: Contribution to journal › Article › peer-review

12 Citations (Scopus)

Abstract

In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on graphs with or without resource constraints. We compare our method with a commercial solver for mixed integer linear programming, run on a formulation of the problem and show promising results.

Original language	English
Pages (from-to)	935-943
Number of pages	9
Journal	European Journal of Operational Research
Volume	291
Issue number	3
DOIs	https://doi.org/10.1016/j.ejor.2020.12.029
Publication status	Published - 16 Jun 2021

Keywords

Bundle method
Combinatorial optimization
Decomposition
Hydro unit commitment
Shortest path problem variants

Access to Document

10.1016/j.ejor.2020.12.029

Cite this

@article{ee6a8f6f42b4484ba4ce94cf2c8b2e4b,

title = "Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley",

abstract = "In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on graphs with or without resource constraints. We compare our method with a commercial solver for mixed integer linear programming, run on a formulation of the problem and show promising results.",

keywords = "Bundle method, Combinatorial optimization, Decomposition, Hydro unit commitment, Shortest path problem variants",

author = "\{van Ackooij\}, Wim and Claudia D'Ambrosio and Dimitri Thomopulos and Trindade, \{Renan Spencer\}",

note = "Publisher Copyright: {\textcopyright} 2020",

year = "2021",

month = jun,

day = "16",

doi = "10.1016/j.ejor.2020.12.029",

language = "English",

volume = "291",

pages = "935--943",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley

AU - van Ackooij, Wim

AU - D'Ambrosio, Claudia

AU - Thomopulos, Dimitri

AU - Trindade, Renan Spencer

PY - 2021/6/16

Y1 - 2021/6/16

N2 - In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on graphs with or without resource constraints. We compare our method with a commercial solver for mixed integer linear programming, run on a formulation of the problem and show promising results.

AB - In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on graphs with or without resource constraints. We compare our method with a commercial solver for mixed integer linear programming, run on a formulation of the problem and show promising results.

KW - Bundle method

KW - Combinatorial optimization

KW - Decomposition

KW - Hydro unit commitment

KW - Shortest path problem variants

U2 - 10.1016/j.ejor.2020.12.029

DO - 10.1016/j.ejor.2020.12.029

M3 - Article

AN - SCOPUS:85099620477

SN - 0377-2217

VL - 291

SP - 935

EP - 943

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley

Abstract

Keywords

Access to Document

Fingerprint

Cite this