检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《电力自动化设备》2004年第5期5-9,共5页Electric Power Automation Equipment
摘 要:针对严格最优潮流模型的精确求解提出了一种新算法。新算法将基于扰动KKT(Karush鄄Kuhn鄄Tucker)条件的原始-对偶内点法和分支定界法巧妙结合,运用分支定界法的分支处理对离散变量进行整数逼近,同时采用基于扰动KKT条件的原始-对偶内点法求解系列松驰问题,然后通过剪支处理和逐层定界达到收敛,实现了精确求解严格最优潮流的目的。此外,新算法将原问题的可行域进行逐步细分实现了全局寻优性。通过对IEEE14-118节点测试系统的数值仿真和不同算法的比较分析,证明了该算法是行之有效的。A new algorithm for rigorous optimal power flow is presented,which is based on the primal-dual interior point algorithm under perturbed KKT(Karush-Kuhn-Tucker) conditions and the branch-and-bound method. It uses the branch-and-bound method to deal with the discrete variables through disparting-tree manner,adopts the primal-dual interior point algorithm under perturbed KKT conditions to solve series of relaxed child-problems and applies cutting-tree principle and bounding mode to get the best outcomes,the rigorous optimal power flow is then obtained. The feasible domain of original problem is divided gradually to realize the global optimization. Numerical si-mulations on test systems,ranging in size from 14 to 118 buses,have shown that the proposed algorithm is promising and superior for the rigorous optimal power flow of mixed-integer pro-gramming due to its robustness and precise.
关 键 词:严格最优潮流 混合整数非线性规划 原始-对偶内点法 KKT条件 分支定界法
分 类 号:TM744[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40