Abstract
In this paper, a mixed integer programming method based on ant colony optimization is presented, and applied to the classical Unit Commitment problem. The idea is to reformulate the problem into a graph exploration structure, and to use discrete ant colony optimization to explicitly take into account time down, time up and demand constraints in the optimization procedure. This method is coupled with a continuous ant colony algorithm to compute produced powers. Results, obtained on relatively small cases, show the viability of the proposed approach: a near optimal solution, with guarantees of feasibility, can be computed with low computation times.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Padhy, N.P.: Unit commitment – a bibliographical survey. IEEE Transactions on Power Systems 9, 1196–1205 (2004)
Chen, C.-L., Wang, S.-C.: Branch and Bound scheduling for thermal generating units. IEEE Transactions on Energy Conversion 8(2), 184–189 (1993)
Ouyang, Z., Shahidehpour, S.M.: An intelligent dynamic programming for unit commitment application. IEEE Transactions on Power Systems 6(3), 1203–1209 (1991)
Senjyu, T., Shimabukuro, K., Uezato, K., Funabashi, T.: A fast technique for Unit Commitment problem by extended priority list. IEEE Transactions on Power Systems 19(4), 2119–2120 (2004)
Zhai, Q., Guan, X.: Unit Commitment with identical units: successive subproblems solving method based on Lagrangian relaxation. IEEE Transactions on Power Systems 17(4), 1250–1257 (2002)
Cheng, C.-P., Liu, C.-W., Liu, C.-C.: Unit Commitment by Lagrangian Relaxation and Genetic Algorithms. IEEE Transactions on Power Systems 15(2), 707–714 (2000)
Dotzauer, E., Holmström, K., Ravn, H.F.: Optimal Unit Commitment and Economic Dispatch of Cogeneration Systems with a Storage. In: 13th Power Systems Computation Conference, Trondheim, Norway, pp. 738–744 (1999)
Wong, S.Y.W.: An Enhanced Simulated Annealing Approach to Unit Commitment. Electrical Power & Energy Systems 20(5), 359–368 (1998)
Rajan, C.C.A., Mohan, M.R.: An evolutionary programming-based tabu search method for solving the unit commitment problem. IEEE Transactions on Power Systems 19(1), 577–585 (2004)
Swarup, K.S., Yamashiro, S.: Unit commitment solution methodology using genetic algorithm. IEEE Transactions on Power Systems 17(1), 87–91 (2002)
Cheng, C.-P., Liu, C.-W., Liu, C.-C.: Unit Commitment by annealing-genetic algorithm. Electrical Power and Energy Systems 24, 149–158 (2002)
Song, Y.H., Chou, C.S., Stonham, T.J.: Combined heat and power economic dispatch by improved ant colony search algorithm. Electric Power System Research 52, 115–121 (1999)
Simon, S.P., Padhy, N.P., Anand, R.S.: An ant colony system approach for unit commitment problem. Electrical Power & Energy Systems 28(5), 315–323 (2006)
Sisworarhardjo, N.S., El-Keib, A.A.: Unit commitment using the ant colony search algorithm. In: Large Engineering Systems Conference on Power Engineering, Halifax, Canada (2002)
Sum-Im, T., Ongsakul, W.: Ant colony search algorithm for unit commitment. In: IEEE International Conference on Industrial Technology, Maribor, Slovenia (2003)
Bilchev, G., Parmee, I.: The ant colony metaphor for searching continuous spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 25–39. Springer, Heidelberg (1995)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics-Part B 26(1), 1–13 (1996)
Dorigo, M., Gambardella, L.M.: Ant Colony System: a Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Sandou, G., Font, S., Tebbani, S., Hiret, A., Mondon, C.: Optimisation par colonies de fourmis d’un site de génération d’énergie. Journal Européen des Systèmes Automatisés (Numéro spécial Métaheuristiques pour l’optimisation difficile) 38(9/10), 1097–1119 (2004)
Stützle, T., Hoos, H.H.: MAX-MIN Ant System. Future Generation Computer Systems 16, 889–914 (2000)
Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Accepted to special issue of EJOR on adapting metaheuristics to continuous optimization (2006)
Sandou, G.: Modélisation, optimisation et commande de parcs de production multi énergies complexes. PhD. Thesis, University Paris XI (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Serban, AT., Sandou, G. (2007). Mixed Ant Colony Optimization for the Unit Commitment Problem. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71618-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-71618-1_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71589-4
Online ISBN: 978-3-540-71618-1
eBook Packages: Computer ScienceComputer Science (R0)