Evolutionary Algorithms for the Unit Commitment Problem

This paper compares three evolutionary computation techniques, namely Steady-State Genetic Algorithms, Evolutionary Strategies and Differential Evolution for the Unit Commitment Problem. The comparison is based on a set of experiments conducted on benchmark datasets as well as on real-world data obtained from the Turkish Interconnected Power System. The results of two state-of-the-art evolutionary approaches, namely a Generational Genetic Algorithm and a Memetic Algorithm for the same benchmark datasets are also included in the paper for comparison. The tests show that Differential Evolution is the best performer among all approaches on the test data used in the paper. The performances of the other two evolutionary algorithms are also comparable to Differential Evolution and the results of the algorithms taken from literature showing that all EA approaches tested here are applicable to the Unit Commitment Problem. The results of this experimental study are very promising and promote further study.

Anahtar Kelimeler:

Unit commitment problem, evolutionary algorithms, steady-state genetic algorithms, generational genetic algorithms, differential evolution, evolutionary strategies

Evolutionary Algorithms for the Unit Commitment Problem

Keywords:

Unit commitment problem, evolutionary algorithms, steady-state genetic algorithms, generational genetic algorithms, differential evolution, evolutionary strategies,

PDF

___

P. G. Lowery, “Generating Unit Commitment by Dynamic Programming”, IEEE Transactions on Power Appa- ratus and Systems Vol. PAS-85, No. 5, pp. 422-426, 1966.
W. J. Hobbs, G. Hermon, S. Warner, G. B. Sheble, “An Enhanced Dynamic Programming Approach for Unit Commitment”, IEEE Transactions on Power Systems, Vol. 3, No. 3, pp. 1201-1205, 1988.
C. Cheng, C. W. Liu, and C. C. Liu, “Unit Commitment by Lagrangian Relaxation and Genetic Algorithms”, IEEE Transactions on Power Systems, Vol. 15, No. 2, pp. 707-714, 2000.
C. L. Chen, S. C. Wang, “Branch-and-Bound Scheduling for Thermal Generating Units”, IEEE Transactions on Energy Conversion, Vol. 8, No. 2, pp. 184-189, 1993.
G. Cote, M. A. Laughton, “Decomposition Techniques in Power System Planning: the Benders Partitioning Method”, Electrical Power and Energy Systems, Vol. 1, No. 1, pp. 57-64, 1979.
F. Zhuang, F. D. Galiana, “Unit Commitment by Simulated Annealing”, IEEE Transactions on Power Systems, Vol. 5, No. 1, pp. 311-317, 1990.
A. H. Mantawy, Y. L. Abdel-Magid, S. Z. Selim, “Unit Commitment by Tabu Search”, IEE Proceedings - Generation, Transmission and Distribution, Vol. 145, No. 1, pp. 56-64, 1998.
S. A. Kazarlis, A. G. Bakirtzis, V. Petridis, “A Genetic Algorithm Solution to the Unit Commitment Problem”, IEEE Transactions on Power Systems, Vol. 11, No. 1, pp. 83-92, 1996.
A. Rudolf, R. Bayrleithner, “A Genetic Algorithm for Solving the Unit Commitment Problem of a Hydro- Thermal Power System”, IEEE Transactions on Power Systems, Vol. 14, No. 4, pp. 1460-1468, 1999.
J. Valenzuela, A. E. Smith, “A Seeded Memetic Algorithm for Large Unit Commitment Problems”, Journal of Heuristics, Vol. 8, pp. 173-195, 2002.
G. Dudek, “Unit Commitment by Genetic Algorithm with Specialized Search Operators”, Electric Power Syst. Res., Vol.72, No. 3, pp. 299-308, Elsevier, 2004.
J. Maturana, M. C. Riﬀ, “Solving the Short-Term Electrical Generation Scheduling Problem by an Adaptive Evolutionary Approach”, European J. of Operational Research, Vol. 179, pp. 677-691, 2007.
Y. M. Chen, W. S. Wang, “Fast Solution Technique for Unit Commitment by Particle Swarm Optimisation and Genetic Algorithm”, International Journal of Energy Technology and Policy, Vol. 5, No. 4, pp. 440-456, 2007.
S. Patra, S. K. Goswami, B. Goswami, “Diﬀerential Evolution Algorithm for Solving Unit Commitment with Ramp Constraints”, Electric Power Components and Systems, Vol. 36, No. 8, pp. 771-787, 2008.
N. P. Padhy, “Unit Commitment -A Bibliographical Survey”, IEEE Transactions on Power Systems, Vol. 19, No. 2, pp. 1196-2005, 2004.
S. Salam, “Unit Commitment Solution Methods”, Proceedings of World Academy of Science, Engineering and Technology, Vol. 26, pp. 600-605, 2007.
I. J. Raglend, N. P. Padhy, “Comparison of Practical Unit Commitment Solutions”, Electric Power Components and Systems, Vol. 36, No. 8, pp. 844-863, 2008.
A. E. Eiben, J. E. Smith, Introduction to Evolutionary Computing, Springer Verlag, 2003.
J. H. Holland, Adaptation in Natural and ArtiŞcial Systems, University of Michigan Press, 1975.
I. Rechenberg, Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolu- tion, Fomman Holzboog Verlag, 1973.
L. J. Fogel, A. J. Owens, M. J. Walsh, ArtiŞcial Intelligence through Simulated Evolution, Wiley, New York, K. V. Price, R. M. Storn, J. A. Lampinen, Diﬀerential Evolution: A Practical Approach to Global Optimization, Springer, 2005.
A. Kele¸s, A. S¸. Etaner-Uyar, B. T¨urkay, “A Diﬀerential Evolution Approach for the Unit Commitment Problem”, ELECO 2007: 5th International Conference on Electrical and Electronics Engineering, Bursa, pp. 132-136, 2007.
S. Damousis, A. G. Bakirtzis, “Genetic Algorithm Solution to the Economic Dispatch Problem”, IEE Proceedings-C, Vol. 141, No. 4, pp. 377-382, 1996.
H. G. Beyer, H. P. Schwefel, “Evolution Strategies, A Comprehensive Introduction”, Natural Computing, Vol. , pp. 3-52, Kluwer, 2002.
G. Pampara, A. P. Engelbrecht, N. Franken, “Binary Diﬀerential Evolution”, IEEE Congress on Evolutionary Computation, pp. 1873-1879, 2006.
T. Gong, A. Tuson, “Diﬀerential Evolution for Binary Encoding”, 11th Online World Conference on Soft Computing in Industrial Applications, 2006.
R. W. Hamming, “Error-detecting and Error-correcting Codes”, Bell Systems Technical Journal, Vol. 29, pp. 160, 1950.
N. Krasnogor, J. Smith, “A Tutorial for Competent Memetic Algorithms: Model, Taxonomy and Design Issues”, IEEE Transactions on Evolutionary Computation, Vol. 9, No. 5, pp. 474-488, 2005.
A. J. Wood, B. F. Wollenberg, Power Generation, Operation, and Control, Wiley, New York, 1996. Appendix.
System Data used in the Experiments. Table 7. Test System 1 [33]. Unit 1 74 83 0021 Unit 4 Pmax (MW) Pmin (MW) a0 a1 a2 tup (h) tdown (h) Shot ($) Scold ($) tcoldstart (h) Initial State(h) 62 95 0042 5 6
Table 8. Demand and Reserve Loads for Test System 1 [33]. Hour Demand (Unit?) Reserve (Unit?) Hour Demand (Unit?) Reserve (Unit?) Table 9. Test System 2 [13]. 74 00079 Unit 9 Pmax (MW) Pmin (MW) a0 a1 a2 tup (h) tdown (h) Shot ($) Scold ($) tcoldstart (h) Initial State (h) 79 00173 1 1
Table 10. Demand and Reserve Loads for Test System 2 [13]. Hour Demand (Unit?) Reserve (Unit?) Hour Demand (Unit?) Reserve (Unit?) Hour Demand (Unit?) Reserve (Unit?) Table 11. Turkish Interconnected Power System. 5 4 5 6 ,5 ,5 4 4 2324 013
Table 12. Demand and Reserve Loads for the Turkish Interconnected Power System. Hour Demand (Unit?) Reserve (Unit?) Hour Demand (Unit?) Reserve (Unit?)