The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Simulated annealing based economic dispatch algorithm
Abstract
This paper develops an economic dispatch algorithm for the determination of the global or near global optimum dispatch solution. The algorithm is based on the simulated annealing technique. In the algorithm, the load balance constraint and the operating limit constraints of the generators are fully accounted for. In the development of the algorithm, transmission losses are first discounted and they are subsequently incorporated in the algorithm through the use of the B-matrix loss formula. The algorithm is demonstrated by its application to a test system. The results determined by the new algorithm are compared to those found by dynamic programming with a zoom feature.
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
Simulation and the Monte Carlo Method
Rubinstein, R. Y. (1981) · Wiley series in probability and statistics · doi:10.1002/9780470316511 · Cited by 2,450
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
Unit commitment by simulated annealing
Zhuang, F., & Galiana, F. D. (1990) · IEEE Transactions on Power Systems · doi:10.1109/59.49122 · Cited by 383
Styblinski, M. A., & Tang, T.-S. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90029-k · Cited by 231
Cited by
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Optimal power flow: a bibliographic survey I: Formulations and deterministic methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0056-y · Cited by 554
Optimal power flow: a bibliographic survey II: Non-deterministic and hybrid methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0057-x · Cited by 294
Metadata
- Authors
- Wong, K. P., & Fung, C. C.
- Venue
- IEE Proceedings C Generation, Transmission and Distribution
- Published
- 1993
- Volume
- 140
- Issue
- 6
- Pages
- 509
- ISSN
- 0143-7046 (ISSN-L)
- OpenAlex
- W2088254784
- Cited by
- 377
- References
- 6
- FWCI
- 4.94
- 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.