The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A simulated annealing algorithm for unit commitment
Abstract
This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproblems: a combinatorial optimization problem; and a nonlinear programming problem. The former is solved using the SAA while the latter problem is solved via a quadratic programming routine. Numerical results showed an improvement in the solutions costs compared to previously obtained results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Cited by
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
Unit Commitment by an Enhanced Simulated Annealing Algorithm
Simopoulos, D. N., Kavatza, S. D., & Vournas, C. D. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.860922 · Cited by 331
Metadata
- Authors
- Mantawy, A. H., Abdel-Magid, Y. L., & Selim, S. Z.
- Venue
- IEEE Transactions on Power Systems
- Published
- 1998
- Volume
- 13
- Issue
- 1
- Pages
- 197-204
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2158281339
- Cited by
- 295
- References
- 1
- FWCI
- 2.92
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A simulated annealing algorithm for unit commitment. https://app.cochat.ai/papers/10.1109/59.651636
- The paper
- Mantawy, A. H., Abdel-Magid, Y. L., & Selim, S. Z. (1998). A simulated annealing algorithm for unit commitment. IEEE Transactions on Power Systems. https://doi.org/10.1109/59.651636
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.
