The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Genetic algorithm solution to unit commitment problem
Abstract
In this paper, Genetic Algorithm (GA) is used to solve the Unit Commitment (UC) Problem. Unit commitment problem was formulated with consideration of up & down time, startup cost (Hot & Cold start), and production cost. Unit commitment schedule as well as economic dispatch is obtained to obtain total cost of generation. Problem specific operators are used in the algorithm to improve the quality of the solution obtained and increase the convergence speed of problem. Performance of the GA is tested on 2 IEEE test systems, one of 5 units, 14 bus and another of 7 units, 56 bus respectively over the scheduling period of 24 hours. Results give an insight in the superiority of GA to other methods for solving UC problem.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
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
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
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 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
Effects of ramp-rate limits on unit commitment and economic dispatch
Wang, C., & Shahidehpour, M. (1993) · IEEE Transactions on Power Systems · doi:10.1109/59.260859 · Cited by 387
Cited by
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
Multi-agent system for energy resource scheduling of integrated microgrids in a distributed system
Logenthiran, T., Srinivasan, D., & Khambadkone, A. M. (2011) · Electric Power Systems Research · doi:10.1016/j.epsr.2010.07.019 · Cited by 324
Carbon tax incentive policy towards air passenger transport carbon emissions reduction
Qiu, R., Xu, J., Xie, H., Zeng, Z., & Lv, C. (2020) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2020.102441 · Cited by 83
Metadata
- Authors
- Madraswala, H. S., & Deshpande, A. S.
- Venue
- 2016 IEEE 1st International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES)
- Publisher
- IEEE
- Published
- 2016-07
- Pages
- 1-6
- OpenAlex
- W2588401480
- Cited by
- 963
- References
- 15
- FWCI
- 112.60
- Type
- conference paper
- 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: Genetic algorithm solution to unit commitment problem. https://app.cochat.ai/papers/10.1109/icpeices.2016.7853075
- The paper
- Madraswala, H. S., & Deshpande, A. S. (2016). Genetic algorithm solution to unit commitment problem. 2016 IEEE 1st International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES). https://doi.org/10.1109/icpeices.2016.7853075
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.
