The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Unit commitment by simulated annealing
Abstract
A general optimization method, known as simulated annealing, is applied to generation unit commitment. By exploiting the resemblance between a minimization process and the cooling of a molten metal, simulated annealing generates feasible solutions randomly and moves among these solutions using a strategy leading to a global minimum with high probabilities. The method assumes no specific problem structures and is highly flexible in handling unit commitment constraints. A concise introduction to the method is given. Numerical results on test systems of up to 100 units are reported.>
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
Meyer (1903) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01707005 · Cited by 587
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
Self-citationA 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
Statistical cooling : a general approach to combinatorial optimization problems
Aarts, E. E., & Laarhoven, V. P. P. (1985) · Philips Journal of Research · Cited by 366
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 thermodynamically motivated simulation procedure for combinatorial optimization problems
Burkard, R. E., & Rendl, F. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90231-5 · Cited by 345
Habibollahzadeh, H., & Bubenko, J. A. (1986) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.1986.4334842 · Cited by 177
A tutorial survey of theory and applications of simulated annealing
Hajek, B. (1985) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1985.268599 · Cited by 148
Secondary voltage control using pilot point information
Ilić-Spong, M., Christensen, J. B., & Eichorn, K. L. (1988) · IEEE Transactions on Power Systems · doi:10.1109/59.192920 · Cited by 116
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
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 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
Economic load dispatch for piecewise quadratic cost function using Hopfield neural network
Park, J. H., Kim, Y. S., Eom, I. K., & Lee, K. Y. (1993) · IEEE Transactions on Power Systems · doi:10.1109/59.260897 · Cited by 408
Simulated annealing based economic dispatch algorithm
Wong, K. P., & Fung, C. C. (1993) · IEE Proceedings C Generation, Transmission and Distribution · doi:10.1049/ip-c.1993.0074 · Cited by 377
Metadata
- Authors
- Zhuang, F., & Galiana, F. D.
- Venue
- IEEE Transactions on Power Systems
- Published
- 1990
- Volume
- 5
- Issue
- 1
- Pages
- 311-318
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2170794935
- Cited by
- 383
- References
- 12
- FWCI
- 6.66
- 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.