Open Access
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
Publication type: Journal Article
Publication date: 2017-03-01
scimago Q1
wos Q3
SJR: 1.006
CiteScore: 5.5
Impact factor: 1.7
ISSN: 21924406, 21924414
Computational Mathematics
Control and Optimization
Modeling and Simulation
Management Science and Operations Research
Abstract
This paper elaborates compact MIP formulations for a discrete unit commitment problem with minimum stop and ramping constraints. The variables can be defined in two different ways. Both MIP formulations are tightened with clique cuts and local constraints. The projection of constraints from one variable structure to the other allows to compare and tighten the MIP formulations. This leads to several equivalent formulations in terms of polyhedral descriptions and thus in LP relaxations. We analyse how MIP resolutions differ in the efficiency of the cuts, branching and primal heuristics. The resulting MIP implementation allows to tackle real size instances for an industrial application.
Found
Nothing found, try to update filter.
Found
Nothing found, try to update filter.
Top-30
Journals
|
1
|
|
|
Algorithms
1 publication, 14.29%
|
|
|
Journal of Heuristics
1 publication, 14.29%
|
|
|
IFAC-PapersOnLine
1 publication, 14.29%
|
|
|
Communications in Computer and Information Science
1 publication, 14.29%
|
|
|
Discrete Optimization
1 publication, 14.29%
|
|
|
Scientific Reports
1 publication, 14.29%
|
|
|
Sustainable Energy, Grids and Networks
1 publication, 14.29%
|
|
|
1
|
Publishers
|
1
2
3
|
|
|
Springer Nature
3 publications, 42.86%
|
|
|
Elsevier
3 publications, 42.86%
|
|
|
MDPI
1 publication, 14.29%
|
|
|
1
2
3
|
- We do not take into account publications without a DOI.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
7
Total citations:
7
Citations from 2024:
3
(42.86%)
Cite this
GOST |
RIS |
BibTex |
MLA
Cite this
GOST
Copy
Dupin N. Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints // EURO Journal on Computational Optimization. 2017. Vol. 5. No. 1-2. pp. 149-176.
GOST all authors (up to 50)
Copy
Dupin N. Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints // EURO Journal on Computational Optimization. 2017. Vol. 5. No. 1-2. pp. 149-176.
Cite this
RIS
Copy
TY - JOUR
DO - 10.1007/s13675-016-0078-7
UR - https://doi.org/10.1007/s13675-016-0078-7
TI - Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
T2 - EURO Journal on Computational Optimization
AU - Dupin, Nicolas
PY - 2017
DA - 2017/03/01
PB - Springer Nature
SP - 149-176
IS - 1-2
VL - 5
SN - 2192-4406
SN - 2192-4414
ER -
Cite this
BibTex (up to 50 authors)
Copy
@article{2017_Dupin,
author = {Nicolas Dupin},
title = {Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints},
journal = {EURO Journal on Computational Optimization},
year = {2017},
volume = {5},
publisher = {Springer Nature},
month = {mar},
url = {https://doi.org/10.1007/s13675-016-0078-7},
number = {1-2},
pages = {149--176},
doi = {10.1007/s13675-016-0078-7}
}
Cite this
MLA
Copy
Dupin, Nicolas. “Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints.” EURO Journal on Computational Optimization, vol. 5, no. 1-2, Mar. 2017, pp. 149-176. https://doi.org/10.1007/s13675-016-0078-7.