Genetic algorithm solution to unit commitment problem
Hatim S. Madraswala, M. Deshpande · IEEE International Conference on Power Electronics, Intelligent Control and Energy Systems · 2016
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.
Cited by 963 works. doi:10.1109/icpeices.2016.7853075
Authors
References
- Genetic algorithms in search, optimization, and machine learning
- Adaptation in Natural and Artificial Systems
- A fast and elitist multiobjective genetic algorithm: NSGA-II
- Genetic Algorithms in Search
- Power Generation, Operation, and Control
- A New Method for Unit Commitment at Electricite De France
- Optimal short-term thermal unit commitment
- Genetic algorithm solution of economic dispatch with valve point loading
- Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit Commitments
- A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem