Browse > Article
http://dx.doi.org/10.5370/JEET.2011.6.2.174

A Novel Binary Ant Colony Optimization: Application to the Unit Commitment Problem of Power Systems  

Jang, Se-Hwan (Dept. of Electrical Engineering, Konkuk University)
Roh, Jae-Hyung (Dept. of Electrical Engineering, Konkuk University)
Kim, Wook (Korea Southern Power Co.)
Sherpa, Tenzi (Dept. of Electrical Engineering, Konkuk University)
Kim, Jin-Ho (Dept. of Electrical Engineering, Kyungwon University)
Park, Jong-Bae (Dept. of Electrical Engineering, Konkuk University)
Publication Information
Journal of Electrical Engineering and Technology / v.6, no.2, 2011 , pp. 174-181 More about this Journal
Abstract
This paper proposes a novel binary ant colony optimization (NBACO) method. The proposed NBACO is based on the concept and principles of ant colony optimization (ACO), and developed to solve the binary and combinatorial optimization problems. The concept of conventional ACO is similar to Heuristic Dynamic Programming. Thereby ACO has the merit that it can consider all possible solution sets, but also has the demerit that it may need a big memory space and a long execution time to solve a large problem. To reduce this demerit, the NBACO adopts the state probability matrix and the pheromone intensity matrix. And the NBACO presents new updating rule for local and global search. The proposed NBACO is applied to test power systems of up to 100-unit along with 24-hour load demands.
Keywords
Binary ant colony optimization; Combinatorial optimization; Unit commitment; Swarm intelligence;
Citations & Related Records

Times Cited By Web Of Science : 3
Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 F. Zhuang and F. D. Galiana, “Toward a more rigorous and practical unit commitment by Lagrangian relaxation,” IEEE Trans. on Power Systems, Vol. 3, No. 2, pp. 763-770, May 1988.   DOI   ScienceOn
2 A. I. Cohen and M. Yoshimura, “A branch-and-bound algorithm for unit commitment,” IEEE Trans. on Power Apparatus and Systems, Vol. PAS-102, pp. 444-451, Feb. 1983.   DOI   ScienceOn
3 J. A. Muckstadt and R. C. Wilson, “An application of mixed-integer programming duality to scheduling thermal generating systems,” IEEE Trans. on Power Apparatus and Systems, pp. 1968-1978, 1968   DOI   ScienceOn
4 S. A. Kazarlis, A. G. Bakirtzis, and V. Petridis, “A genetic algorithm solution to the unit commitment problem,” IEEE Trans. on Power Systems, Vol. 11, No. 1, pp. 83-92, Feb. 1996.   DOI   ScienceOn
5 K. A. Juste, H. Kita, E. Tanaka, and J. Hasegawa, “An evolutionary programming solution to the unit commitment problem,” IEEE Trans. on Power Systems, Vol. 14, pp. 1452-1459, Nov. 1999.   DOI   ScienceOn
6 D. N. Simopoulos, S. D. Kavatza, and C. D. Vournas, “Unit commitment by an enhanced simulated annealing algorithm,” IEEE Trans. on Power Systems, Vol. 21, No. 1, pp. 68-76, Feb. 2006.   DOI   ScienceOn
7 B. Zhao, C. X. Guo, B. R. Bai and Y. J. Cao, “An improved particle swarm optimization algorithm for unit commitment,” Electrical Power & Energy Systems, Vol. 28, Issue 7, pp. 482-490, Sep. 2006.   DOI   ScienceOn
8 Y.-W. Jeong, J.-B. Park, J.-R. Shin, and K. Y. Lee, “A thermal unit commitment approach using an improved quantum evolutionary algorithm”, Electric Power Components and Systems, Vol. 37, No. 7, pp. 770-786, July 2009.   DOI   ScienceOn
9 S.-J. Huang, “Enhancement of hydroelectric generation scheduling using ant colony system based optimization approaches”, IEEE Trans. Energy Conv., Vol. 16, No. 3, pp. 296-301, Mar. 2001.   DOI   ScienceOn
10 Y. H. Hou, Y. W. Wu, L. J. Lu and X. Y. Xiong, “Generlized Ant Colony Optimization for Economic Dispatch of Power Systems”, IEEE, 2002.
11 L. Shi, J. Hao, J. Zhou and G. Xu, “Ant colony optimisation algorithm with random perturbation behaviour to the problem of optimal unit commitment with probabilistic spinning reserve determination”, Electric Power Syst. Res., Vol. 69, pp. 295-303, 2004.   DOI   ScienceOn
12 S. P. Simon, N. P. Padhy and R. S. Anand, “An ant colony system for unit commitment problem,” Elect. Power Energy Syst., 2006
13 S. Chusanapiputt, D. Nualhong and S. Phoomvuthisarn, “Relativity Pheromone Updating Strategy in Ant Colony Optimization for Constrained Unit Commitment Problem”, Power System Technology, IEEE, 2006
14 Ahmed Yousuf Saber and Tomomobu Senjyu, “Memory-Bounded Ant Colony Optimization with Dynamic Programming and $A^{*}$ Local Search for Generator Planning”, IEEE Trans. on Power Systems, Vol. 22, No. 4, pp. 1965-1973, Nov. 2007   DOI   ScienceOn
15 A. J. Wood and B. F. Wollenberg, Power Generation, Operation, and Control. New York: John Wiley & Sons, Inc., 1984.
16 R. M. Burns and C. A. Gibson, “Optimization of priority lists for a unit commitment program,” in Proc. IEEE Power Engineering Society Summer Meeting, Paper A, 75 453-1, 1975.
17 G. B. Sheble, “Solution of the unit commitment problem by the method of unit periods,” IEEE Trans. on Power Systems, Vol. 5, No. 1, pp. 257-260, Feb. 1990.   DOI   ScienceOn
18 M. Dorigo and L.M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Trans. on Evol. Compiut., Vol. 1, pp. 53-66, Apr. 1997.   DOI
19 Z. Ouyang and S. M. Shahidehpour, “An intelligent dynamic programming for unit commitment application,” IEEE Trans. on Power Systems, Vol. 6, No. 3, pp. 1203-1209, Aug. 1991.   DOI   ScienceOn
20 M. Dorigo, “Optimization, learning, and natural algorithms,” Ph.D. dissertation (in Italian), Dipartimento di Elettronica, Politecnico di Milano, Milano, Italy, 1992.
21 G. Wu and H. Huang, “Theoretical Framework of Binary Ant Colony Optimization Algorithm”, IEEE Computer society, 2008
22 Christian Blum and Marco Dorigo, “The Hyper-Cube Framework for Ant Colony Optimization”, IEEE Trans. Systems, Man and Cybernetics, Vol. 34, No. 2, pp. 1161-1172, April. 2004   DOI   ScienceOn