An improved artificial bee colony optimization algorithm based on orthogonal learning for optimal power flow problem

被引:75
作者
Bai, Wenlei [1 ]
Eke, Ibrahim [2 ]
Lee, Kwang Y. [1 ]
机构
[1] Baylor Univ, Waco, TX 76706 USA
[2] Kirikkale Univ, TR-71000 Kirikkale, Turkey
关键词
Modern heuristic optimization; Optimal power flow (OPF); Artificial bee colony (ABC); Orthogonal learning (OL); Nonlinear optimization;
D O I
10.1016/j.conengprac.2017.02.010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The increasing fuel price has led to high operational cost and therefore, advanced optimal dispatch schemes need to be developed to reduce the operational cost while maintaining the stability of grid. This study applies an improved heuristic approach, the improved Artificial Bee Colony (IABC) to optimal power flow (OPF) problem in electric power grids. Although original ABC has provided robust solutions for a range of problems, such as the university timetabling, training neural networks and optimal distributed generation allocation, its poor exploitation often causes solutions to be trapped in local minima. Therefore, in order to adjust the exploitation and exploration of ABC, the IABC based on the orthogonal learning is proposed. Orthogonal learning is a strategy to predict the best combination of two solution vectors based on limited trials instead of exhaustive trials, and to conduct deep search in the solution space. To assess the proposed method, two fuel cost objective functions with high non-linearity and non-convexity are selected for the OPF problem. The proposed IABC is verified by IEEE-30 and 118 bus test systems. In all case studies, the IABC has shown to consistently achieve a lower cost with smaller deviation over multiple runs than other modern heuristic optimization techniques. For example, the quadratic fuel cost with valve effect found by IABC for 30 bus system is 919.567 $/hour, saving 4.2% of original cost, with 0.666 standard deviation. Therefore, IABC can efficiently generate high quality solutions to nonlinear, nonconvex and mixed integer problems.
引用
收藏
页码:163 / 172
页数:10
相关论文
共 40 条
[1]   Optimal power flow using tabu search algorithm [J].
Abido, MA .
ELECTRIC POWER COMPONENTS AND SYSTEMS, 2002, 30 (05) :469-483
[2]   Optimal power flow using differential evolution algorithm [J].
Abou El Ela, A. A. ;
Abido, M. A. ;
Spea, S. R. .
ELECTRIC POWER SYSTEMS RESEARCH, 2010, 80 (07) :878-885
[3]   Artificial bee colony algorithm for solving multi-objective optimal power flow problem [J].
Adaryani, M. Rezaei ;
Karami, A. .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 53 :219-230
[4]   Artificial bee colony algorithm for large-scale problems and engineering design optimization [J].
Akay, Bahriye ;
Karaboga, Dervis .
JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (04) :1001-1014
[5]   University Course Timetabling Using a Hybrid Harmony Search Metaheuristic Algorithm [J].
Al-Betar, Mohammed Azmi ;
Khader, Ahamad Tajudin ;
Zaman, Munir .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2012, 42 (05) :664-681
[6]   OPTIMAL LOAD FLOW WITH STEADY-STATE SECURITY [J].
ALSAC, O ;
STOTT, B .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1974, PA93 (03) :745-751
[7]  
[Anonymous], 2011, DESIGN EXPT USING TA
[8]  
[Anonymous], 1999, Springer Series in Statistics, DOI DOI 10.1007/978-1-4612-1478-6
[9]  
[Anonymous], 2011, P IEEE POW EN SOC GE
[10]  
[Anonymous], 2008, Modern heuristic optimization techniques with applications to power systems