A path-based formulation for the hydro unit commitment and scheduling problem

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

A path-based formulation for the hydro unit commitment and scheduling problem

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

Research output: Contribution to conference › Paper › peer-review

Abstract

In this paper, we study a single-reservoir Hydro Unit Commitment Problem in a deterministic price-taker context, where production is assumed to be generated through discrete operational points. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to the discrete operational points, and arcs refer to possible state changes. Based on the graph representation, we show that our problem reduces to a Constrained Shortest Path Problem.

Original language	English
Pages	139-142
Number of pages	4
Publication status	Published - 1 Jan 2020
Event	15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017 - Cologne, Germany Duration: 6 Jun 2017 → 8 Jun 2017

Conference

Conference	15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017
Country/Territory	Germany
City	Cologne
Period	6/06/17 → 8/06/17

Keywords

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

Cite this

@conference{21f6cd9f8f7d4111917d91f7065d2c07,

title = "A path-based formulation for the hydro unit commitment and scheduling problem",

abstract = "In this paper, we study a single-reservoir Hydro Unit Commitment Problem in a deterministic price-taker context, where production is assumed to be generated through discrete operational points. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to the discrete operational points, and arcs refer to possible state changes. Based on the graph representation, we show that our problem reduces to a Constrained Shortest Path Problem.",

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

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

note = "Publisher Copyright: {\textcopyright} 2019 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017. All rights reserved.; 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017 ; Conference date: 06-06-2017 Through 08-06-2017",

year = "2020",

month = jan,

day = "1",

language = "English",

pages = "139--142",

}

TY - CONF

T1 - A path-based formulation for the hydro unit commitment and scheduling problem

AU - Thomopulos, Dimitri

AU - van Ackooij, Wim

AU - D'Ambrosio, Claudia

AU - Liberti, Leo

AU - Taktak, Raouia

AU - Toubaline, Sonia

PY - 2020/1/1

Y1 - 2020/1/1

N2 - In this paper, we study a single-reservoir Hydro Unit Commitment Problem in a deterministic price-taker context, where production is assumed to be generated through discrete operational points. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to the discrete operational points, and arcs refer to possible state changes. Based on the graph representation, we show that our problem reduces to a Constrained Shortest Path Problem.

AB - In this paper, we study a single-reservoir Hydro Unit Commitment Problem in a deterministic price-taker context, where production is assumed to be generated through discrete operational points. Under some hypotheses, we present a time expanded graph representation for the problem, where, at each time step, nodes correspond to the discrete operational points, and arcs refer to possible state changes. Based on the graph representation, we show that our problem reduces to a Constrained Shortest Path Problem.

KW - Constrained Shortest Path Problem

KW - Hydro Unit Commitment Problem

KW - Time expanded graph representation

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

M3 - Paper

AN - SCOPUS:85083387064

SP - 139

EP - 142

T2 - 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017

Y2 - 6 June 2017 through 8 June 2017

ER -

A path-based formulation for the hydro unit commitment and scheduling problem

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this