A polyhedral study of production ramping

Damci-Kurt, Pelin; Kucukyavuz, Simge; Rajan, Deepak; Atamturk, Alper

doi:10.1007/s10107-015-0919-9

Title: A polyhedral study of production ramping

Journal Article · Fri Jun 12 00:00:00 EDT 2015 · Mathematical Programming

DOI:https://doi.org/10.1007/s10107-015-0919-9· OSTI ID:1455405

Damci-Kurt, Pelin ^[1]; Kucukyavuz, Simge ^[1]; Rajan, Deepak ^[2]; Atamturk, Alper ^[3]

The Ohio State Univ., Columbus, OH (United States). Dept. of Integrated Systems Engineering
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing
Univ. of California, Berkeley, CA (United States). Dept. of Industrial Engineering and Operations Research

Here, we give strong formulations of ramping constraints—used to model the maximum change in production level for a generator or machine from one time period to the next—and production limits. For the two-period case, we give a complete description of the convex hull of the feasible solutions. The two-period inequalities can be readily used to strengthen ramping formulations without the need for separation. For the general case, we define exponential classes of multi-period variable upper bound and multi-period ramping inequalities, and give conditions under which these inequalities define facets of ramping polyhedra. Finally, we present exact polynomial separation algorithms for the inequalities and report computational experiments on using them in a branch-and-cut algorithm to solve unit commitment problems in power generation.

View Accepted Manuscript (DOE)

Cite

Export

Save

Research Organization:: Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)

Sponsoring Organization:: USDOE National Nuclear Security Administration (NNSA)

Grant/Contract Number:: AC52-07NA27344; 0970180

OSTI ID:: 1455405

Report Number(s):: LLNL-JRNL-732987; 884544

Journal Information:: Mathematical Programming, Vol. 158, Issue 1-2; ISSN 0025-5610

Publisher:: SpringerCopyright Statement

Country of Publication:: United States

Language:: English

Citation Metrics:

Cited by: 50 works

Citation information provided by
Web of Science

References (37)

Solving unit commitment problems with general ramp constraints Frangioni, Antonio; Gentile, Claudio; Lacalandra, Fabrizio International Journal of Electrical Power & Energy Systems, Vol. 30, Issue 5 https://doi.org/10.1016/j.ijepes.2007.10.003	journal	June 2008
Tighter Approximated MILP Formulations for Unit Commitment Problems Frangioni, A.; Gentile, C.; Lacalandra, F. IEEE Transactions on Power Systems, Vol. 24, Issue 1 https://doi.org/10.1109/TPWRS.2008.2004744	journal	February 2009
Unit commitment literature synopsis Sheble, G. B.; Fahd, G. N. IEEE Transactions on Power Systems, Vol. 9, Issue 1 https://doi.org/10.1109/59.317549	journal	January 1994
Generating Unit Commitment by Dynamic Programming Lowery, P. IEEE Transactions on Power Apparatus and Systems, Vol. PAS-85, Issue 5 https://doi.org/10.1109/TPAS.1966.291679	journal	May 1966
A strong conic quadratic reformulation for machine-job assignment with controllable processing times Aktürk, M. Seli̇m; Atamtürk, Alper; Gürel, Si̇nan Operations Research Letters, Vol. 37, Issue 3 https://doi.org/10.1016/j.orl.2008.12.009	journal	May 2009
Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem IEEE Transactions on Power Systems, Vol. 28, Issue 4 https://doi.org/10.1109/TPWRS.2013.2251373	journal	November 2013
Decomposition approach to problem of unit commitment schedule for hydrothermal systems Baptistella, L. F. B.; Geromel, J. C. IEE Proceedings D Control Theory and Applications, Vol. 127, Issue 6 https://doi.org/10.1049/ip-d.1980.0044	journal	January 1980
Production Smoothing with Fluctuating Price Pekelman, Dov Management Science, Vol. 21, Issue 5 https://doi.org/10.1287/mnsc.21.5.576	journal	January 1975
A Tutorial on Production Smoothing and Work Force Balancing Silver, Edward A. Operations Research, Vol. 15, Issue 6 https://doi.org/10.1287/opre.15.6.985	journal	December 1967
Optimal planning of cogeneration production with provision of ancillary services Havel, Petr; Šimovič, Tomáš Electric Power Systems Research, Vol. 95 https://doi.org/10.1016/j.epsr.2012.07.020	journal	February 2013
A Branch-and-Bound Algorithm for Unit Commitment Cohen, Arthur; Yoshimura, Miki IEEE Transactions on Power Apparatus and Systems, Vol. PAS-102, Issue 2 https://doi.org/10.1109/TPAS.1983.317714	journal	February 1983
Unit commitment by tabu search Mantawy, A. H.; Abdel-Magid, Y. L.; Selim, S. Z. IEE Proceedings - Generation, Transmission and Distribution, Vol. 145, Issue 1 https://doi.org/10.1049/ip-gtd:19981681	journal	January 1998
An effective heuristic for combined heat-and-power production planning with power ramp constraints Rong, Aiying; Lahdelma, Risto Applied Energy, Vol. 84, Issue 3 https://doi.org/10.1016/j.apenergy.2006.07.005	journal	March 2007
A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem Carrion, M.; Arroyo, J. M. IEEE Transactions on Power Systems, Vol. 21, Issue 3 https://doi.org/10.1109/TPWRS.2006.876672	journal	August 2006
Lotsizing with backlogging and start-ups: the case of Wagner–Whitin costs Agra, Agostinho; Constantino, Miguel Operations Research Letters, Vol. 25, Issue 2 https://doi.org/10.1016/S0167-6377(99)00030-9	journal	September 1999
A genetic algorithm modelling framework and solution technique for short term optimal hydrothermal scheduling Orero, S. O.; Irving, M. R. IEEE Transactions on Power Systems, Vol. 13, Issue 2 https://doi.org/10.1109/59.667375	journal	May 1998
A new method for unit commitment with ramping constraints Fan, Wei; Guan, Xiaohong; Zhai, Qiaozhu Electric Power Systems Research, Vol. 62, Issue 3 https://doi.org/10.1016/S0378-7796(02)00043-3	journal	July 2002
Unit commitment by simulated annealing Zhuang, F.; Galiana, F. D. IEEE Transactions on Power Systems, Vol. 5, Issue 1 https://doi.org/10.1109/59.49122	journal	January 1990
A Chance-Constrained Two-Stage Stochastic Program for Unit Commitment With Uncertain Wind Power Output Wang, Qianfan; Guan, Yongpei; Wang, Jianhui IEEE Transactions on Power Systems, Vol. 27, Issue 1 https://doi.org/10.1109/TPWRS.2011.2159522	journal	February 2012
Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints Frangioni, Antonio; Gentile, Claudio Operations Research, Vol. 54, Issue 4 https://doi.org/10.1287/opre.1060.0309	journal	August 2006
Min-up/min-down polytopes Lee, Jon; Leung, Janny; Margot, François Discrete Optimization, Vol. 1, Issue 1 https://doi.org/10.1016/j.disopt.2003.12.001	journal	June 2004
A solution to the unit commitment problem—a review Saravanan, B.; Das, Siddharth; Sikri, Surbhi Frontiers in Energy, Vol. 7, Issue 2 https://doi.org/10.1007/s11708-013-0240-3	journal	April 2013
Solving the Unit Commitment Problem by a Unit Decommitment Method Tseng, C. L.; Li, C. A.; Oren, S. S. Journal of Optimization Theory and Applications, Vol. 105, Issue 3 https://doi.org/10.1023/A:1004653526131	journal	June 2000
A genetic algorithm solution to the unit commitment problem Kazarlis, S. A.; Bakirtzis, A. G.; Petridis, V. IEEE Transactions on Power Systems, Vol. 11, Issue 1 https://doi.org/10.1109/59.485989	journal	January 1996
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem Ostrowski, James; Anjos, Miguel F.; Vannelli, Anthony IEEE Transactions on Power Systems, Vol. 27, Issue 1 https://doi.org/10.1109/TPWRS.2011.2162008	journal	February 2012
Lower Bounds in Lot-Sizing Models: A Polyhedral Study Constantino, Miguel Mathematics of Operations Research, Vol. 23, Issue 1 https://doi.org/10.1287/moor.23.1.101	journal	February 1998
Tight and Compact MILP Formulation of Start-Up and Shut-Down Ramping in Unit Commitment Morales-Espana, German; Latorre, Jesus M.; Ramos, Andres IEEE Transactions on Power Systems, Vol. 28, Issue 2 https://doi.org/10.1109/TPWRS.2012.2222938	journal	May 2013
Dynamic Programming Approach to Unit Commitment Snyder, Walter L.; Powell, H. David; Rayburn, John C. IEEE Transactions on Power Systems, Vol. 2, Issue 2 https://doi.org/10.1109/TPWRS.1987.4335130	journal	January 1987
The Next Generation of Electric Power Unit Commitment Models Hobbs, Benjamin F.; Rothkopf, Michael H.; O’Neill, Richard P. International Series in Operations Research & Management Science https://doi.org/10.1007/b108628	book	January 2001
Min-up/Min-down Polytopes Lee, Jon; Leung, Janny; Margot, Francois Carnegie Mellon University https://doi.org/10.1184/r1/6706820.v1	text	January 1982
Dynamic Programming Approach to Unit Commitment Snyder, Walter L.; Powell, H. David; Rayburn, John C. IEEE Power Engineering Review, Vol. PER-7, Issue 5 https://doi.org/10.1109/mper.1987.5527246	journal	May 1987
Tight and compact MILP formulation for the thermal unit commitment problem Morales-Espana, German; Latorre, Jesus; Ramos, Andres 2015 IEEE Power & Energy Society General Meeting https://doi.org/10.1109/pesgm.2015.7285639	conference	July 2015
Tight and compact MILP formulation of start-up and shut-down ramping in unit commitment Morales-Espana, German; Latorre, Jesus M.; Ramos, Andres 2013 IEEE Power & Energy Society General Meeting https://doi.org/10.1109/pesmg.2013.6672560	conference	January 2013
Integer and Combinatorial Optimization Connolly, David Bulletin of the London Mathematical Society, Vol. 21, Issue 5 https://doi.org/10.1112/blms/21.5.499	journal	September 1989
Min-up/Min-down Polytopes Lee, Jon; Leung, Janny; Margot, Francois Carnegie Mellon University https://doi.org/10.1184/r1/6706820	text	January 1982
Integer and Combinatorial Optimization Williams, H. P.; Nemhauser, George L.; Wolsey, Laurence A. The Journal of the Operational Research Society, Vol. 41, Issue 2 https://doi.org/10.2307/2583737	journal	February 1990
A Branch-and-Bound Algorithm for Unit Commitment Cohen, Arthur I.; Yoshimura, Miki IEEE Power Engineering Review, Vol. PER-3, Issue 2 https://doi.org/10.1109/mper.1983.5519636	journal	February 1983

Cited By (4)

Tight MIP formulations for bounded up/down times and interval-dependent start-ups Queyranne, Maurice; Wolsey, Laurence A. Mathematical Programming, Vol. 164, Issue 1-2 https://doi.org/10.1007/s10107-016-1079-2	journal	October 2016
Lifted polymatroid inequalities for mean-risk optimization with indicator variables Atamtürk, Alper; Jeon, Hyemin Journal of Global Optimization, Vol. 73, Issue 4 https://doi.org/10.1007/s10898-018-00736-z	journal	January 2019
Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints Dupin, Nicolas; Talbi, El-ghazali International Transactions in Operational Research, Vol. 27, Issue 1 https://doi.org/10.1111/itor.12557	journal	May 2018
Lifted Polymatroid Inequalities for Mean-Risk Optimization with Indicator Variables Atamturk, Alper; Jeon, Hyemin arXiv https://doi.org/10.48550/arxiv.1705.05915	preprint	January 2017

Similar Records

Formulations and Valid Inequalities for Optimal Black Start Allocation in Power Systems

Journal Article · Tue Jun 30 00:00:00 EDT 2020 · Operations Research · OSTI ID:1455405

Patsakis, G; Aravena, I; Deepak, R; +1 more

A branch-and-cut algorithm for multiple sequence alignment

Conference · Mon Dec 01 00:00:00 EST 1997 · OSTI ID:1455405

Reinert, K; Lenhof, H P; Mutzel, P

Cutting planes for the multistage stochastic unit commitment problem

Journal Article · Wed Apr 20 00:00:00 EDT 2016 · Mathematical Programming · OSTI ID:1455405

Jiang, Ruiwei; Guan, Yongpei; Watson, Jean -Paul

Related Subjects

97 MATHEMATICS AND COMPUTING
Ramping
unit commitment
co-generation
production smoothing
convex hull
polytope
valid inequalities
facets
computation

Title: A polyhedral study of production ramping

Citation Formats

References (37)

Cited By (4)

Similar Records

Related Subjects