Journal Press India^®

Author Details ( * ) denotes Corresponding author

Unit Commitment is large scale short-term optimization problem, in which main objective is to schedule generation to minimize the total fuel cost, subjected to large number of constraints that must be satisfied. In this paper unit commitment problem is solved by using a new evolutionary algorithm known as imperialistic algorithm. In ICA the initial populations individuals (countries) are the countries are in two types: imperialistic and colonies that all together form some empires .Imperialistic competitions among these empires converge to state in their exist only one empire. In the proposed ICA for the unit commitment problem, the scheduling variables are coded as integers; therefore the some constraints are handled are handled directly as minimum up and down type constraints. A new method for initializing the countries is proposed. To verify the performance of the Imperialistic Competition Algorithm (ICA), it is applied to systems with ten number of generating units in one-day scheduling period.

Keywords

Unit Commitment; Genetic Algorithm; Imperialistic Competition Algorithm

1. V. S. Pappala, I. Erlich, A new approach for solving the unit commitment problem by adaptive particle


2. T. O. Ting, M. V. C. Rao, C. K. Loo, A novel approach for unit commitment problem via an effective hybrid particle swarm optimization, IEEE Trans. Power Syst., 21(1), 2006, 411–418


3. Y. W. Jeong, J. B. Park, S. H. Jang, K. Y. Lee, A new quantum inspired binary PSO for thermal unit commitment problems, IEEE 15th Int. Conf. Intelligent System Applications to Power Systems, Curitibia, Brazil, 2009, 8–12, 1–6


4. R. M. Burns, C. A. Gibson, Optimization of priority lists for a unit commitment program, IEEE Power Eng. Soc. Summer Meeting, Paper A 75, 453-1 [5] G. B. Sheble, Solution of the unit commitment problem by the method of unit periods, IEEE Trans. Power Syst., 5(1), 1990, 257–260


5. W. L. Snyder, Jr., H. D. Powell, Jr., J. C. Rayburn, Dynamic programming approach to unit commitment,” IEEE Trans. Power Syst., 2(2), 1987, 339–350


6. HT, Yang PC, Huang CL., Evolutionary Programming Based Economic Dispatch for Units with Non-Smooth Fuel Cost Functions, IEEE Trans Power Systems, 11(1), 1996, 112–117


7. Jigneshsolanki, Anurag Srivastava, A genetic algorithm approach to price based unit commitment, IEEE Trans Power Systems, 11(1), 2012, 112–117


8. S. Virmani, C. Adrian, K. Imhof, S. Mukherjee, Implementation of a Lagrangian relaxation based unit commitment problem, IEEE Trans. Power Syst., 4(4), 1373– 1380


9. D. Srinivasan, J. Chazelas, A priority list-based evolutionary algorithm to solve large scale unit commitment problem, Power System Technology, 2004. Power Con


10. Z. Ouyang, S. M. Shahidehpour, An intelligent dynamic programming for unit commitment application, IEEE Trans. Power Syst., 6(3), 1991, 1203–1209


11. F. Zhuangand, F. D. Galiana, Toward amore rigorous and practical unit commitment by Lagrangian relaxation, IEEE Trans. Power Syst., 3(2), 1988, 763–770


12. F. N. Lee, A fuel-constrained unit commitment method, IEEE Trans. Power Syst., 4(3), 1989, 691–698


13. A. I. Cohen, M. Yoshimura, A branch-and-bound algorithm for unit commitment, IEEE Trans. Power App. Syst., vol. PAS-102, 1983, 444–451


14. J. A. Muckstadt, R. C. Wilson, An application of mixed-integer programming duality to scheduling thermal generating systems, IEEE Trans. Power App. Syst., PAS-, 1968, 1968– 1978


15. G. B. Sheble, T. T. Maifeld, Unit commitment by genetic algorithm and expertsystem, Elect. Power Syst. Res., 30(2), 1994, 115–121