A genetic algorithm solution to the unit commitment problem
S. Kazarlis, Anastasios G. Bakirtzis, V. Petridis · IEEE Transactions on Power Systems · 1996
This paper presents a genetic algorithm (GA) solution to the unit commitment problem. GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. A simple GA algorithm implementation using the standard crossover and mutation operators could locate near optimal solutions but in most cases failed to converge to the optimal solution. However, using the varying quality function technique and adding problem specific operators, satisfactory solutions to the unit commitment problem were obtained. Test results for power systems of up to 100 units and comparisons with results obtained using Lagrangian relaxation and dynamic programming are also reported.
Cited by 1,143 works. doi:10.1109/59.485989
Authors
References
- 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
- Towards a more rigorous and practical unit commitment by Lagrangian relaxation
- Solution of Large-Scale Optimal Unit Commitment Problems
- Large Scale Hydro-Thermal Unit Commitment-Method and Results
- Integer Programming Approach to the Problem of Optimal Unit Commitment with Probabilistic Reserve Determination
- A Study of the Economic Shutdown of Generating Units in Daily Dispatch
- Unit commitment by simulated annealing