The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A New Method for Unit Commitment at Electricite De France
Abstract
Unit commitment is a complex problem which, until now and for real size systems, has been solved using heuristic methods only. This paper proposes a new Lagrangian relaxation method, which produces ε-optimal solutions. The flexibility of the algorithm is such that numerous developments can be envisaged, such as simultaneous management of pumping units, probabilistic determination of the spinning reserve, etc.
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
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, M. L. (1981) · Management Science · doi:10.1287/mnsc.27.1.1 · Cited by 2,109
Optimization Theory of Large Systems
Lasdon, L. S., & Tabak, D. (1971) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1971.4308301 · Cited by 1,677
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Everett, H. (1963) · Operations Research · doi:10.1287/opre.11.3.399 · Cited by 1,274
Lagrangian Relaxation for Integer Programming
Geoffrion, A. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_9 · Cited by 974
Optimization by decomposition and coordination: A unified approach
Cohen, G. (1978) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1978.1101718 · Cited by 175
Cited by
A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem
Carrion, M., & Arroyo, J. M. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2006.876672 · Cited by 1,731
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
Factoring the elasticity of demand in electricity prices
Kirschen, D. S., Strbac, G., Cumperayot, P., & de Paiva Mendes, D. (2000) · IEEE Transactions on Power Systems · doi:10.1109/59.867149 · Cited by 616
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
Towards 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
A Novel Approach for Unit Commitment Problem via an Effective Hybrid Particle Swarm Optimization
Ting, T. O., Rao, M. V. C., & Loo, C. K. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.860907 · Cited by 446
Unit commitment by simulated annealing
Zhuang, F., & Galiana, F. D. (1990) · IEEE Transactions on Power Systems · doi:10.1109/59.49122 · Cited by 383
Metadata
- Authors
- Merlin, A., & Sandrin, P.
- Venue
- IEEE Transactions on Power Apparatus and Systems
- Published
- 1983-05
- Volume
- PAS-102
- Issue
- 5
- Pages
- 1218-1225
- ISSN
- 0018-9510 (ISSN-L)
- OpenAlex
- W2142339771
- Cited by
- 419
- References
- 5
- FWCI
- 4.45
- 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.