2018
DOI: 10.1007/s10479-018-2900-5
|View full text |Cite
|
Sign up to set email alerts
|

Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 58 publications
0
6
0
Order By: Relevance
“…Therefore, we extended this tight model in order to manage the coordination between thermal and storage units (cf. Franz et al 2019, where also explanations for the tightness of the described model are given). Furthermore, a reformulation and an adjustment of constraints (i.e., constraints for start-up processes and reserve capacity) are performed so that the resulting model provides near-optimal solutions significantly faster than the model formulation presented by Morales-España et al (2013).…”
Section: Unit Commitment Problem With Hydrothermal Coordinationmentioning
confidence: 96%
See 1 more Smart Citation
“…Therefore, we extended this tight model in order to manage the coordination between thermal and storage units (cf. Franz et al 2019, where also explanations for the tightness of the described model are given). Furthermore, a reformulation and an adjustment of constraints (i.e., constraints for start-up processes and reserve capacity) are performed so that the resulting model provides near-optimal solutions significantly faster than the model formulation presented by Morales-España et al (2013).…”
Section: Unit Commitment Problem With Hydrothermal Coordinationmentioning
confidence: 96%
“…Simple procedures are based on priority lists or truncated dynamic programming. In recent years, Lagrange relaxation or fix-and-optimize methods based directly on the mathematical model of the problem have become standard (e.g., Ongsakul and Petcharaks 2004;Gollmer et al 1999;Franz et al 2019). Metaheuristics have also been developed for UCPs, but typically without pump storages (e.g., Kazarlis et al 1996;Viana et al 2008).…”
Section: Definitionmentioning
confidence: 99%
“…Wolter and Helber [66] applied F&O heuristic to a dynamic production and maintenance planning problem. In recent years, F&O heuristic is becoming popular to solve the problems of variety of domains such as vendor selection [50], facility location-transportation problem [46], patient admission scheduling problem [61], network function virtualization [45], unit commitment problem [16] and gantry crane scheduling problem for intermodal transportation [23]. These studies have enriched the body of knowledge for F&O heuristic with distinct methods for obtaining an initial feasible solution, parameter tuning and integrating F&O with other heuristic or metaheuristic.…”
Section: Literature On Fix-and-optimize Heuristicmentioning
confidence: 99%
“…The application of the UC problem to manage a MG in an optimal way constitutes an extensively discussed topic in the literature [16,[21][22][23]. In this framework, the UC problem can be applied by considering a wide range of different objective functions and optimization methods, such as linear programming (LP), non-linear programming (NLP), stochastic programming (SP), dynamic programming (DP), non-differential programming (NDP), and MPC [12,24].…”
Section: Related Workmentioning
confidence: 99%