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

被引：22

作者：

Jang, Se-Hwan ^{[1
]}

Roh, Jae Hyung ^{[1
]}

Kim, Wook ^{[2
]}

Sherpa, Tenzi ^{[1
]}

Kim, Jin-Ho ^{[3
]}

Park, Jong-Bae ^{[1
]}

机构：

[1] Konkuk Univ, Dept Elect Engn, Seoul, South Korea

[2] Korea So Power Co, Seoul, South Korea

[3] Kyungwon Univ, Dept Elect Engn, Songnam, South Korea

来源：

JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY | 2011年 / 6卷 / 02期

关键词：

Binary ant colony optimization; Combinatorial optimization; Unit commitment; Swarm intelligence; ALGORITHM;

D O I：

10.5370/JEET.2011.6.2.174

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：174 / 181

页数：8

共 50 条

[1] Mixed ant colony optimization for the unit commitment problem
Serban, Ana-Talida
Sandou, Guillaume
ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT 1, 2007, 4431 : 332 - +
[2] Feeding a genetic algorithm with an ant colony for constrained optimization - An application to the Unit Commitment problem
Sandou, Guillaume
Font, Stephane
Tebbani, Sihem
ICINCO 2008: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS, VOL ICSO: INTELLIGENT CONTROL SYSTEMS AND OPTIMIZATION, 2008, : 163 - 168
[3] Hybrid ant colony optimization algorithm for generation unit commitment problem
Wang, Jian
Liu, Tian-Qi
Dianli Xitong Baohu yu Kongzhi/Power System Protection and Control, 2010, 38 (20): : 85 - 89
[4] Unit Commitment by Evolving Ant Colony Optimization
Vaisakh, K.
Srinivas, L. R.
INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE RESEARCH, 2010, 1 (03) : 67 - 77
[5] Ant colony optimization algorithm with random perturbation behavior for unit commitment problem
Hao, Jin
Shi, Libao
Zhou, Jiaqi
Dianli Xitong Zidonghua/Automation of Electric Power Systems, 2002, 26 (23): : 23 - 28
[6] Diversity control approach to ant colony optimization for unit commitment problem.
Nualhong, D
Chusanapiputt, S
Phomvuttisarn, S
Saengsuwan, T
Jantarang, S
TENCON 2004 - 2004 IEEE REGION 10 CONFERENCE, VOLS A-D, PROCEEDINGS: ANALOG AND DIGITAL TECHNIQUES IN ELECTRICAL ENGINEERING, 2004, : C488 - C491
[7] Discrete genetic algorithm and real ant colony optimization for the unit commitment problem
Sandou, Guillaume
ICINCO 2007: PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS, VOL ICSO: INTELLIGENT CONTROL SYSTEMS AND OPTIMIZATION, 2007, : 256 - 261
[8] An ant colony system approach for unit commitment problem
Simon, Sishaj P.
Padhy, Narayana Prasad
Anand, R. S.
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2006, 28 (05) : 315 - 323
[9] Evolving ant colony optimization based unit commitment
Vaisakh, K.
Srinivas, L. R.
APPLIED SOFT COMPUTING, 2011, 11 (02) : 2863 - 2870
[10] Unit Commitment by Genetic Evolving Ant Colony Optimization
Vaisakh, K.
Srinivas, L. R.
2009 WORLD CONGRESS ON NATURE & BIOLOGICALLY INSPIRED COMPUTING (NABIC 2009), 2009, : 1161 - +

← 1 2 3 4 5 →