Syed Auon RAZA, Aftab AHMAD, Muhammad Noman SIDDIQUE, Syed Basit Ali BUKHARI

A ring crossover genetic algorithm for the unit commitment problem

The unit commitment problem (UCP) is a nonlinear, mixed-integer, constraint optimization problem and is considered a complex problem in electrical power systems. It is the combination of two interlinked subproblems, namely the generator scheduling problem and the generation allocation problem. In large systems, the UCP turns out to be increasingly complicated due to the large number of possible ON and OFF combinations of units in the power system over a scheduling time horizon. Due to the insufficiency of conventional approaches in handling large systems, numerous metaheuristic techniques are being developed for solving this problem. The genetic algorithm (GA) is one of these metaheuristic methods. In this study, an attempt is made to solve the unit commitment problem using the GA with ring crossover and swap mutation operators. One half of the initial population is intelligently generated by focusing on load curve to obtain better convergence. Lambda iteration is used to solve the generation allocation subproblem. Tests are carried out on systems with up to 100 generators over a time horizon of 24 h. Test outcomes demonstrate the proficiency of the presented scheme when compared with previously used techniques.

PDF

___

[1] Saravanan B, Das S, Sikri S, Kothari D. A solution to the unit commitment problema review. Frontiers in Energy 2013; 7: 223-236.
[2] Senjyu T, Miyagi T, Saber AY, Urasaki N, Funabashi T. Emerging solution of large-scale unit commitment problem by stochastic priority list. Electr Pow Syst Res 2006; 76: 283-292.
[3] Delarue E, DHaeseleer W. Adaptive mixed-integer programming unit commitment strategy for determining the value of forecasting. Appl Energ 2008; 85: 171-181.
[4] Ongsakul W, Petcharaks N. Unit commitment by enhanced adaptive Lagrangian relaxation. IEEE T Power Syst 2004; 19: 620-628.
[5] Singhal PK, Sharma RN. Dynamic programming approach for large scale unit commitment problem. In: IEEE 2011 International Conference on Communication Systems and Network Technologies; 35 June 2011; Katra, Jammu, India. New York, NY, USA: IEEE. pp. 714-717.
[6] Chen CL, Wang SC. Branch-and-bound scheduling for thermal generating units. IEEE T Power Syst 1993; 8: 184-189.
[7] Ouyang Z, Shahidehpour S. Short-term unit commitment expert system. Electr Pow Syst Res 1990; 20: 1-13.
[8] Kothari D, Ahmad A. An expert system approach to the unit commitment problem. Energ Convers Manage 1995; 36: 257-261.
[9] Rajan CCA, Mohan M. An evolutionary programming-based tabu search method for solving the unit commitment problem. IEEE T Power Syst 2004; 19: 577-585.
[10] Juste K, Kita H, Tanaka E, Hasegawa J. An evolutionary programming solution to the unit commitment problem. IEEE T Power Syst 1999; 14: 1452-1459.
[11] Wong MH, Chung TS, Wong YK. An evolving neural network approach in unit commitment solution. Microprocess Microsy 2000; 24: 251-262.
[12] Datta D. Unit commitment problem with ramp rate constraint using a binary-real-coded genetic algorithm. Appl Soft Comput 2013; 13: 3873-3883.
[13] Dudek G. Genetic algorithm with binary representation of generating unit start-up and shut-down times for the unit commitment problem. Expert Syst Appl 2013; 40: 6080-6086.
[14] Sun L, Zhang Y, Jiang C. A matrix real-coded genetic algorithm to the unit commitment problem. Electr Pow Syst Res 2006; 76: 716-728.
[15] Dudek G. Unit commitment by genetic algorithm with specialized search operators. Electr Pow Syst Res 2004; 72: 299-308.
[16] Swarup K, Yamashiro S. Unit commitment solution methodology using genetic algorithm. IEEE T Power Syst 2002; 17: 87-91.
[17] Bukhari SBA, Ahmad A, Raza SA, Zaki AUM. Genetic algorithm based generator scheduling - a review. World Applied Sciences Journal 2014; 30: 1826-1833.
[18] Ahmad A, Malik T. Unit commitment problem of thermal generation units for short term operational planning using simple genetic algorithm. Journal of the Institution of Electrical and Electronic Engineers Pakistan 2006; 52: 22-26.
[19] Rajan C, Mohar R. An evolutionary programming-based tabu search method for solving the unit commitment problem. IEEE T Power Syst 2004; 19: 557-585.
[20] Mantawy AH, Abdel-Magid YL, Selim SZ. A new genetic-based tabu search algorithm for unit commitment problem. Electr Pow Syst Res 1999; 49: 71-78.
[21] Ting T, Rao M, Loo C. A novel approach for unit commitment problem via an effective hybrid particle swarm optimization. IEEE T Power Syst 2006; 21: 411-418.
[22] Mantawy A, Abdel-Magid YL, Selim SZ. A simulated annealing algorithm for unit commitment. IEEE T Power Syst 1998; 13: 197-204.
[23] Simopoulos DN, Kavatza SD, Vournas CD. Unit commitment by an enhanced simulated annealing algorithm. IEEE T Power Syst 2006; 21: 68-76.
[24] Saneifard S, Prasad NR, Smolleck HA. A fuzzy logic approach to unit commitment. IEEE T Power Syst 1997; 12: 988-995.
[25] Datta D, Dutta S. A binary-real-coded differential evolution for unit commitment problem. Int J Elec Power 2012; 42: 517-524.
[26] Uyar AS¸, T¨urkay B, Kele¸s A. A novel differential evolution application to short-term electrical power generation scheduling. Int J Elec Power 2011; 33: 1236-1242.
[27] Simon SP, Padhy NP, Anand R. An ant colony system approach for unit commitment problem. Int J Elec Power 2006; 28: 315-323.
[28] Vaisakh K, Srinivas LR. Evolving ant colony optimization based unit commitment. Appl Soft Comput 2011; 11: 2863-2870.
[29] Nayak R, Sharma JD. A hybrid neural network and simulated annealing approach to the unit commitment problem. Comput Electr Eng 2000; 26: 461-477.
[30] Sadati N, Hajian M, Zamani M. Unit commitment using particle swarm-based-simulated annealing optimization approach. In: IEEE 2007 Swarm Intelligence Symposium; 15 April 2007; Honolulu, HI, USA: IEEE. pp. 297-302.
[31] Patra S, Goswami S, Goswami B. Fuzzy and simulated annealing based dynamic programming for the unit commitment problem. Expert Syst Appl 2009; 36: 5081-5086.
[32] Kumar SS, Palanisamy V. A dynamic programming based fast computation Hopfield neural network for unit commitment and economic dispatch. Electr Pow Syst Res 2007; 77: 917-925.
[33] Dang C, Li M. A floating-point genetic algorithm for solving the unit commitment problem. Eur J Oper Res 2007; 181: 1370-1395.
[34] Pavez-Lazo B, Soto-Cartes J. A deterministic annular crossover genetic algorithm optimisation for the unit commitment problem. Expert Syst Appl 2011; 38: 6523-6529.
[35] Yuan X, Su A, Nie H, Yuan Y, Wang L. Application of enhanced discrete differential evolution approach to unit commitment problem. Energ Convers Manage 2009; 50: 2449-2456.
[36] Senjyu T, Yamashiro H, Uezato K, Funabashi T. A unit commitment problem by using genetic algorithm based on unit characteristic classification. In: IEEE 2002 Power Engineering Society Winter Meeting; 2731 January 2002. New York, NY, USA: IEEE. pp. 58-63.
[37] Zhao B, Guo CX, Bai BR, Cao YJ. An improved particle swarm optimization algorithm for unit commitment. Int J Elec Power 2006; 28: 482-490.
[38] Senthil Kumar V, Mohan MR. Solution to security constrained unit commitment problem using genetic algorithm. Int J Elec Power 2010; 32: 117-125.
[39] Moghimi Hadji M, Vahidi B. A solution to the unit commitment problem using imperialistic competition algorithm. IEEE T Power Syst 2012; 27: 117-124.
[40] Senjyu T, Yamashiro H, Shimabukuro K, Uezato K, Finabashi T. A fast solution technique for large scale unit commitment problem using genetic algorithm. In: IEEE 2002 Transmission and Distribution Conference and Exhibition; 610 October 2002. New York, NY, USA: IEEE. pp. 1611-1616.
[41] Zhao B, Guo C, Bai B, Cao Y. An improved particle swarm optimization algorithm for unit commitment. Int J Elec Power 2006; 28: 482-490.
[42] Senthil Kumar V, Mohan M. Solution to security constrained unit commitment problem using genetic algorithm. Int J Elec Power 2010; 32: 117-125.
[43] Datta D. Unit commitment problem with ramp rate constraint using a binary-real-coded genetic algorithm. Appl Soft Comput 2013; 13: 3873-3883.
[44] Saber AY, Alshareef AM. Scalable unit commitment by memory-bounded ant colony optimization with a local search. Int J Elec Power 2008; 30: 403-414.
[45] Saber A, Senjyu T, Yona A, Funabashi T. Unit commitment computation by fuzzy adaptive particle swarm optimisation. IET Gener Transm Dis 2007; 1: 456-465.
[46] Saber AY, Senjyu T, Miyagi T, Urasaki N, Funabashi T. Fuzzy unit commitment scheduling using absolutely stochastic simulated annealing. IEEE T Power Syst 2006; 21: 955-964.
[47] Saber A, Senjyu T, Miyagi T, Urasaki N, Funabashi T. Unit commitment by heuristics and absolutely stochastic simulated annealing. IET Gener Transm Dis 2007; 1: 234-243.