Shortest Path Problem variants for the Hydro Unit Commitment Problem

Wim van Ackooij; Claudia D'Ambrosio; Leo Liberti; Raouia Taktak; Dimitri Thomopulos; Sonia Toubaline

doi:10.1016/j.endm.2018.07.040

Shortest Path Problem variants for the Hydro Unit Commitment Problem

Wim van Ackooij
, Claudia D'Ambrosio
, Leo Liberti
, Raouia Taktak
, Dimitri Thomopulos
, Sonia Toubaline

Lamsid/EDF/R and D
Sfax University
Laboratoire d'Informatique (LIX)
Université Paris Dauphine

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

Abstract

In this paper, we study the deterministic single-reservoir Hydro Unit Commitment Problem. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to discrete operational points, and arcs refer to possible state changes. We show that our problem reduces to a Constrained Shortest Path Problem, propose and compare different approaches to solve the HUCP, based on mixed integer linear or dynamic programming.

Original language	English
Pages (from-to)	309-316
Number of pages	8
Journal	Electronic Notes in Discrete Mathematics
Volume	69
DOIs	https://doi.org/10.1016/j.endm.2018.07.040
Publication status	Published - 1 Aug 2018

Keywords

Constrained Shortest Path Problem
Hydro Unit Commitment Problem
time expanded graph representation

Access to Document

10.1016/j.endm.2018.07.040

Cite this

@article{24efdbf50dc645bf93c6ca11d0b0b746,

title = "Shortest Path Problem variants for the Hydro Unit Commitment Problem",

abstract = "In this paper, we study the deterministic single-reservoir Hydro Unit Commitment Problem. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to discrete operational points, and arcs refer to possible state changes. We show that our problem reduces to a Constrained Shortest Path Problem, propose and compare different approaches to solve the HUCP, based on mixed integer linear or dynamic programming.",

keywords = "Constrained Shortest Path Problem, Hydro Unit Commitment Problem, time expanded graph representation",

author = "\{van Ackooij\}, Wim and Claudia D'Ambrosio and Leo Liberti and Raouia Taktak and Dimitri Thomopulos and Sonia Toubaline",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2018",

month = aug,

day = "1",

doi = "10.1016/j.endm.2018.07.040",

language = "English",

volume = "69",

pages = "309--316",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

}

TY - JOUR

T1 - Shortest Path Problem variants for the Hydro Unit Commitment Problem

AU - van Ackooij, Wim

AU - D'Ambrosio, Claudia

AU - Liberti, Leo

AU - Taktak, Raouia

AU - Thomopulos, Dimitri

AU - Toubaline, Sonia

PY - 2018/8/1

Y1 - 2018/8/1

N2 - In this paper, we study the deterministic single-reservoir Hydro Unit Commitment Problem. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to discrete operational points, and arcs refer to possible state changes. We show that our problem reduces to a Constrained Shortest Path Problem, propose and compare different approaches to solve the HUCP, based on mixed integer linear or dynamic programming.

AB - In this paper, we study the deterministic single-reservoir Hydro Unit Commitment Problem. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to discrete operational points, and arcs refer to possible state changes. We show that our problem reduces to a Constrained Shortest Path Problem, propose and compare different approaches to solve the HUCP, based on mixed integer linear or dynamic programming.

KW - Constrained Shortest Path Problem

KW - Hydro Unit Commitment Problem

KW - time expanded graph representation

UR - https://www.scopus.com/pages/publications/85051112484

U2 - 10.1016/j.endm.2018.07.040

DO - 10.1016/j.endm.2018.07.040

M3 - Article

AN - SCOPUS:85051112484

SN - 1571-0653

VL - 69

SP - 309

EP - 316

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Shortest Path Problem variants for the Hydro Unit Commitment Problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this