Abstract
The paper shows that the use of a memetic algorithm (MA), a genetic algorithm (GA) combined with local search, synergistically combined with Lagrangian relaxation is effective and efficient for solving large unit commitment problems in electric power systems. It is shown that standard implementations of GA or MA are not competitive with the traditional methods of dynamic programming (DP) and Lagrangian relaxation (LR). However, an MA seeded with LR proves to be superior to all alternatives on large problems. Eight problems from the literature and a new large, randomly generated problem are used to compare the performance of the proposed seeded MA with GA, MA, DP and LR. Compared with previously published results, this hybrid approach solves the larger problems better and uses less computational time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baptistella, L.F. and J.C. Geromel. (1980). “ADecomposition Approach to Problem of Unit Commitment Schedule for Hydrothermal Systems.” IEEE Proc. 127(6), part D, 250.
Bard, J.F. (1988). “Short-Term Scheduling of Thermal-Electric Generators using Lagrangian Relaxation.” Operations Research 36(5), 756–766.
Beasley, D. (1997). “Designing a Reduced-Complexity Algorithm for Quaternion Multiplication.” In T. Baeck, D.B. Fogel, and Z. Michalewicz (eds.), Handbook of Evolutionary Computation. Bristol, UK: IOP Publishing Ltd. and Oxford University Press, Chap. G1.1.
Blickle, T. (1997). “Tournament Selection.” In T. Baeck, D.B. Fogel, and Z. Michalewicz (eds.), Handbook of Evolutionary Computation. Bristol, UK: IOP Publishing Ltd. and Oxford University Press, Chap. C2.3.
Cohen, A.I. and M. Yoshimura. (1983). “A Branch and Bound Algorithm for Unit Commitment.” IEEE Trans. Power App. Syst. PAS-102, 444–451.
Dawkins, R. (1976). The Selfish Gene. Oxford, UK: Oxford University Press.
Dillon, T.S., K.W. Edwin, H.D. Kochs, and R.J. Taud. (1978). “Integer Programming Commitment with Probabilistic Reserve Determination.” IEEE Trans. Power App. Syst. PAS-97(6), 2154–2166.
Garver, L.L. (1963). “Power Generation Scheduling by Integer Programming—Development of Theory.” IEEE Trans. Power App. Syst. PAS-82, 730–735.
Gen, M. and R. Cheng. (1997). Genetic Algorithms &;; Engineering Design. New York: John Wiley &;; Sons, 31–34.
Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison Wesley.
Kazarlis, S.A., A.G. Bakirtzis, and V. Petridis. (1996). “A Genetic Algorithm Solution to the Unit Commitment Problem.” IEEE Trans. on Power Systems 11(1), 83–90.
Lee, F.N. (1980). “Short-Term Unit Commitment—A New Method.” IEEE Trans. on Power Systems 3(2), 625–633.
Lee, F.N. (1991). “The Application of Commitment Utilization Factor (CUF) to Thermal Unit Commitment.” IEEE Trans. on Power Systems 6(2), 691–698.
Lowery, P.G. (1996). “Generating Unit Commitment by Dynamic Programming.” IEEE Trans. Power App. Syst. PAS-85(5), 422–426.
Mantawy, A.H., Y.L. Abdel-Magid, and S.Z. Selim. (1997). “A New Genetic Algorithm Approach for Unit Commitment.” Genetic Algorithms in Engineering Systems: Innovations and Applications, IEE Conference Publication 0537-9989 1997 No. 446, Sept. 1997, pp. 215–220.
Orero, S.O. and M.R. Irving. (1998). “A Genetic Algorithm Modeling Framework and Solution Technique for Short Term Optimal Hydrothermal Scheduling.” IEEE Trans. on Power Systems 13(2), 501–516.
Radcliffe, N.J. (1994). “Formal Memetic Algorithms.” In T. Fogarty (ed.), Evolutionary Computing. Springer Lecture Notes in Computer Science, Vol. 865, pp. 250–263.
Schwefel, H.-P. (1995). Evolution and Optimum Seeking. New York: John Wiley &;; Sons.
Sheble, G.B. (1990). “Solution of the Unit Commitment Problem by the Method of Unit Periods.” IEEE Trans. on Power Systems 5(1), 257–260.
Sheble, G.B. and G.N. Fahd. (1994). “Unit Commitment Literature Synopsis.” IEEE Trans. on Power Systems 9(1), 128–135.
Snyder, W.L., H.D. Powel, and J. C. Rayburn. (1987). “Dynamic Programming Approach to Unit Commitment.” IEEE Trans. on Power Systems 2(2), 339–350.
Spears, W.M. and K.A. DeJong. (1991). “On the Virtues of Parameterized Uniform Crossover.” In Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230–236.
Tong, S.K., S.M. Shahidepour, and Z. Ouyang. (1991). “A Heuristic Short-Term Unit Commitment.” IEEE Trans. on Power Systems 6(3), 1210–1216.
Turgeon, A. (1978). “Optimal Scheduling of Thermal Generating Units.” IEEE Trans. on Automatic Control AC-23(6), 100–105.
Whitley, D. (1997). “Permutations.” In T. Baeck, D.B. Fogel, and Z. Michalewicz (eds.), Handbook of Evolutionary Computation. Bristol, UK: IOP Publishing Ltd. and Oxford University Press, Chap. C1.4.
Wood, A.J. and B.F. Wollenberg. (1996). Power Generation, Operation, and Control. New York: John Wiley &;; Sons.
Xiaomin, B., S.M. Shahidehpour, and Y. Erkeng. (1996). “Constrained Unit Commitment by Using Tabu Search Algorithm.” In Proceedings of the International Conference on Electrical Engineering, Vol. 2, pp. 1088–1092.
Zhuang, F. and F.D. Galiana. (1988). “Towards a More Rigorous and Practical Unit Commitment by Lagrangian Relaxation.” IEEE Trans. on Power Systems 3, 763–770.
Zhuang, F. and F.D. Galiana. (1990). “Unit Commitment by Simulated Annealing.”IEEE Trans. on Power Systems 5(1), 311–317.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Valenzuela, J., Smith, A.E. A Seeded Memetic Algorithm for Large Unit Commitment Problems. Journal of Heuristics 8, 173–195 (2002). https://doi.org/10.1023/A:1017960507177
Issue Date:
DOI: https://doi.org/10.1023/A:1017960507177