Please wait a minute...
浙江大学学报(工学版)
J4  2010, Vol. 44 Issue (4): 771-777    DOI: 10.3785/j.issn.1008-973X.2010.04.026
    
Analysis and improvement of interior point cutting plane method for
 optimal power flow in power systems
DING Xiao-ying1,2, WANG Jian-xue1, WANG Xi-fan1, LIU Lin1
1. School of Electrical Engineering, Xi’an Jiaotong University, Xi’an 710049, China;
2. State Key Laboratory of Electrical Insulation and Power Equipment, Xi’an Jiaotong University, Xi’an 710049, China
Download:   PDF(0KB) HTML
Export: BibTeX | EndNote (RIS)      

Abstract  

The research of optimal power flow simulation in power systems finds that interior point cutting plane method (IPCPM) fails to solve the linear programming problem which has multiple solutions. A new general optimal base identification method was presented to solve the above problem by revolving and mapping the solution space, which could move the optimum along the edge of the feasible region to the vertex of solution space. Furthermore, two measures, stochastic disturbance method and ladder matrix method, were used to enhance the calculation efficiency of IPCPM. Simulation show that the calculation time was saved by 20% in average. Simulation results of IEEE 14300 buses test systems indicate that the improved algorithm can properly handle various types of optimal solutions and significantly enlarge the application field of IPCPM.

Published: 14 May 2010
CLC:  TM744  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Cite this article:

DING Xiao-Ying, WANG Jian-Hua, WANG Ti-Fan, LIU Lin. Analysis and improvement of interior point cutting plane method for
 optimal power flow in power systems. J4, 2010, 44(4): 771-777.

URL:

http://www.zjujournals.com/eng/10.3785/j.issn.1008-973X.2010.04.026     OR     http://www.zjujournals.com/eng/Y2010/V44/I4/771


电力系统最优潮流的内点割平面法分析与改进

针对电力系统优化运行控制的最优潮流问题,采用内点割平面法求解多重解的线性规划问题,算法迭代次数多,计算速度低,严重的可能导致算法不收敛.为此提出一种识别最优基的方法,通过对优化问题的解空间进行旋转和映射,将最优解沿可行域的棱移动至顶点,得到问题的最优基,从而解决原算法失效的问题.进一步采用随机扰动法和阶梯矩阵变化法提高算法的计算效率,平均计算时间缩短了20%左右.对电力系统标准测试系统IEEE14300节点系统的数值仿真结果表明,改进算法能够正确处理最优解的各种情况,扩大了内点割平面法的应用范围.

［1］ 吴金华,吴耀武,熊信艮,等. 机组优化组合问题的随机tabu搜索算法［J］. 电网技术, 2003, 27(10): 3638.
WU Jinhua, WU Yaowu, XIONG Xinyin, et al. Random tabu search with simulated annealing approach for the unit commitment problem ［J］. Power System Technology, 2003, 27(10): 3638.
［2］ RAJAN C C A, MOHAN M R, MANIVANNAN K. Neural based tabu search method for solving unit commitment problem ［C］∥ IEE Fifth International Conference on Power System Management and Control. London: IEEE, 2002: 180185.
［3］ 吴金华,吴耀武,熊信艮. 基于退火演化算法和遗传算法的机组优化组合算法［J］. 电网技术, 2003, 27(1): 2629.
WU Jinhua, WU Yaowu, XIONG Xinyin. Optimization of unit commitment based on annealing evolutionary algorithm and genetic algorithm ［J］. Power System Technology, 2003, 27(1): 2629.
［4］ 孙力勇,张焰,蒋传文. 基于矩阵实数编码遗传算法求解大规模机组组合问题［J］. 中国电机工程学报, 2006, 26(2): 8287.
SUN Liyong, ZHANG Yan, JIANG Chuanwen. A solution to the unit commitment problem based on matrix realcoded genetic algorithm ［J］. Proceedings of the CSEE, 2006, 26(2): 8287.
［5］ LIAO G. C,TSAO T P. A novel GAbased and metaheuristics method for shortterm unit commitment problem ［C］∥ IEEE Power Engineering Society General Meeting. Denver: IEEE, 2004, 1: 10881093.
［6］ NIU Shufen, WANG Guoxin, SUN Xiaoling. A branch and bound algorithm for discrete multifactor portfolio optimization model ［J］. Journal of Shanghai University: English Edition, 2008, 12(1): 2630.
［7］ 燕子宗. 求解整数线性规划问题的一种新算法［J］. 长江大学学报：自然版, 2007, 4(1): 58.
YAN Zizong. A new algorithm for solving integer linear programming problem ［J］. Journal of Yangtze University: Natural Science Edition, 2007, 4(1): 58.
［8］ 范宏,韦化. 基于扰动KKT条件的原始对偶内点法和分支定界法的最优潮流研究［J］. 电力自动化设备, 2004, 24(5): 59.
FAN Hong, WEI Hua. Study on optimal power flow based on primaldual interior point algorithm under perturbed KKT conditions and branchandbound method ［J］. Electric Power Automation Equipment, 2004, 24(5): 59.
［9］ MITCHELL J E, TODD M J. Solving combinatorial optimization problems using Karmarkar’s algorithm ［J］. Mathematical Programming, 1992, 56: 245284.
［10］ MITCHELL J E, BORCHERS B. Solving realworld linear ordering problems using a primaldual interior point cutting plane method ［J］. Annals of Operations Research, 1996, 62: 253276.
［11］ DING Xiaoying, WANG Xifan, SONG Yonghua. An interior point cutting plane method for optimal power flow ［J］. International Journal of Management Mathematics, 2004, 15(4): 355368.
［12］ 方述诚,普森普拉·S. 线性优化及其扩展:理论与算法［J］. 北京：科学出版社, 1994.
［13］ TIJSSEN G A, SIERKSMA G. BalinskiTucker simplex tableaus: dimensions, degeneracy degrees, and interior points of optimal faces ［J］. Mathematical Programming, 1998, 81 (3): 349372.
No related articles found!