The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem
Abstract
This paper presents a new algorithm based on integrating genetic algorithms, tabu search and simulated annealing methods to solve the unit commitment problem. The core of the proposed algorithm is based on genetic algorithms. Tabu search is used to generate new population members in the reproduction phase of the genetic algorithm. A simulated annealing method is used to accelerate the convergence of the genetic algorithm by applying the simulated annealing test for all the population members. A new implementation of the genetic algorithm is introduced. The genetic algorithm solution is coded as a mix between binary and decimal representation. The fitness function is constructed from the total operating cost of the generating units without penalty terms. In the tabu search part of the proposed algorithm, a simple short-term memory procedure is used to counter the danger of entrapment at a local optimum, and the premature convergence of the genetic algorithm. A simple cooling schedule has been implemented to apply the simulated annealing test in the algorithm. Numerical results showed the superiority of the solutions obtained compared to genetic algorithms, tabu search and simulated annealing methods, and to two exact algorithms.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Power Generation, Operation, and Control
Wood, A. J., & Wollenberg, B. F. (1984) · Cited by 8,303
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
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,147
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
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
A simulated annealing algorithm for the clustering problem
Selim, S. Z., & Alsultan, K. (1991) · Pattern Recognition · doi:10.1016/0031-3203(91)90097-o · Cited by 459
Self-citationUnit commitment by simulated annealing
Zhuang, F., & Galiana, F. D. (1990) · IEEE Transactions on Power Systems · doi:10.1109/59.49122 · Cited by 383
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
Self-citationNew approaches for heuristic search: A bilateral linkage with artificial intelligence
Glover, F., & Greenberg, H. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90185-9 · Cited by 244
Artificial intelligence, heuristic frameworks and tabu search
Glover, F. (1990) · Managerial and Decision Economics · doi:10.1002/mde.4090110512 · Cited by 127
Tabu search and design optimization
Bland, J. A., & Dawson, G. P. (1991) · Computer-Aided Design · doi:10.1016/0010-4485(91)90089-f · Cited by 111
Cited by
Unit Commitment—A Bibliographical Survey
Padhy, N. P. (2004) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2003.821611 · Cited by 1,001
Study of Reconfiguration for the Distribution System With Distributed Generators
Wu, Y.-K., Lee, C.-Y., Liu, L.-C., & Tsai, S.-H. (2010) · IEEE Transactions on Power Delivery · doi:10.1109/tpwrd.2010.2046339 · Cited by 336
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
Intelligent unit commitment with vehicle-to-grid —A cost-emission optimization
Saber, A. Y., & Venayagamoorthy, G. K. (2010) · Journal of Power Sources · doi:10.1016/j.jpowsour.2009.08.035 · Cited by 311
Reserve Constrained Dynamic Dispatch of Units With Valve-Point Effects
Victoire, T. A. A., & Jeyakumar, A. E. (2005) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.851958 · Cited by 259
Metadata
- Authors
- Mantawy, A. H., Abdel-Magid, Y. L., & Selim, S. Z.
- Venue
- IEEE Transactions on Power Systems
- Published
- 1999
- Volume
- 14
- Issue
- 3
- Pages
- 829-836
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2121957462
- Cited by
- 265
- References
- 21
- FWCI
- 3.56
- 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.