The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem
Abstract
This paper presents a new mixed-integer linear formulation for the unit commitment problem of thermal units. The formulation proposed requires fewer binary variables and constraints than previously reported models, yielding a significant computational saving. Furthermore, the modeling framework provided by the new formulation allows including a precise description of time-dependent startup costs and intertemporal constraints such as ramping limits and minimum up and down times. A commercially available mixed-integer linear programming algorithm has been applied to efficiently solve the unit commitment problem for practical large-scale cases. Simulation results back these conclusions
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Power Generation, Operation, and Control
Wood, A. J., & Wollenberg, B. F. (1984) · Cited by 8,303
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Market Operations in Electric Power Systems: Forecasting, Scheduling, and Risk Management
Shahidehpour, M., Yamin, H., & Li, Z. (2002) · Wiley eBooks · doi:10.1002/047122412x · Cited by 1,616
Hill, P. G. (1977) · Cited by 1,394
A genetic algorithm solution to the unit commitment problem
Kazarlis, S., Bakirtzis, A. G., & Petridis, V. (1996) · IEEE Transactions on Power Systems · doi:10.1109/59.485989 · Cited by 1,255
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
Unit Commitment—A Bibliographical Survey
Padhy, N. P. (2004) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2003.821611 · Cited by 1,001
Genetic algorithm solution to unit commitment problem
Madraswala, H. S., & Deshpande, A. S. (2016) · 2016 IEEE 1st International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES) · doi:10.1109/icpeices.2016.7853075 · Cited by 963
Market operations in electric power systems: forecasting, scheduling, and risk management
(2002) · Choice Reviews Online · doi:10.5860/choice.40-1574 · Cited by 811
Applied Mathematical Programming
Bradley, S. P., Hax, A. C., & Magnanti, T. L. (1977) · Cited by 810
Optimal response of a thermal unit to an electricity spot market
Arroyo, J. M., & Conejo, A. J. (2000) · IEEE Transactions on Power Systems · doi:10.1109/59.871739 · Cited by 536
Self-citationTowards a more rigorous and practical unit commitment by Lagrangian relaxation
Zhuang, F., & Galiana, F. D. (1988) · IEEE Transactions on Power Systems · doi:10.1109/59.192933 · Cited by 453
Unit Commitment by Enhanced Adaptive Lagrangian Relaxation
Ongsakul, W., & Petcharaks, N. (2004) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2003.820707 · Cited by 429
A New Method for Unit Commitment at Electricite De France
Merlin, A., & Sandrin, P. (1983) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1983.318063 · Cited by 419
Unit commitment by simulated annealing
Zhuang, F., & Galiana, F. D. (1990) · IEEE Transactions on Power Systems · doi:10.1109/59.49122 · Cited by 383
Dillon, T. S., Edwin, K. W., Kochs, H.-D., & Taud, R. J. (1978) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1978.354719 · Cited by 362
A simulated annealing algorithm for unit commitment
Mantawy, A. H., Abdel-Magid, Y. L., & Selim, S. Z. (1998) · IEEE Transactions on Power Systems · doi:10.1109/59.651636 · Cited by 295
MIP: Theory and Practice — Closing the Gap
Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35514-6_2 · Cited by 258
Nowak, M. P., & Römisch, W. (2000) · Annals of Operations Research · doi:10.1023/a:1019248506301 · Cited by 253
Ramp-rate limits in unit commitment and economic dispatch incorporating rotor fatigue effect
Wang, C., & Shahidehpour, S. M. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.336106 · Cited by 171
A parallel repair genetic algorithm to solve the unit commitment problem
Arroyo, J. M., & Conejo, A. J. (2002) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2002.804953 · Cited by 133
Self-citationOptimal generation scheduling with ramping costs
Wang, C., & Shahidehpour, M. (1995) · IEEE Transactions on Power Systems · doi:10.1109/59.373928 · Cited by 103
Cited by
A comprehensive review of firefly algorithms
Fister, I., Fister, I., Yang, X.-S., & Brest, J. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.06.001 · Cited by 1,308
Genetic algorithm solution to unit commitment problem
Madraswala, H. S., & Deshpande, A. S. (2016) · 2016 IEEE 1st International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES) · doi:10.1109/icpeices.2016.7853075 · Cited by 963
A Model Predictive Control Approach to Microgrid Operation Optimization
Parisio, A., Rikos, E., & Glielmo, L. (2014) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2013.2295737 · Cited by 929
Stochastic Security for Operations Planning With Significant Wind Power Generation
Bouffard, F., & Galiana, F. D. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.919318 · Cited by 713
Unit Commitment for Systems With Significant Wind Penetration
Tuohy, A., Meibom, P., Denny, E., & O'Malley, M. (2009) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2009.2016470 · Cited by 703
Metadata
- Authors
- Carrion, M., & Arroyo, J. M.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2006-08
- Volume
- 21
- Issue
- 3
- Pages
- 1371-1378
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2110050136
- Cited by
- 1,731
- References
- 22
- FWCI
- 21.93
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.