標題: An ordinal optimization theory-based algorithm for solving the optimal power flow problem with discrete control variables
作者: Lin, SY
Ho, YC
Lin, CH
電控工程研究所
Institute of Electrical and Control Engineering
關鍵字: discrete control variables;nonlinear programming;optimal power flow;ordinal optimization
公開日期: 1-Feb-2004
摘要: The optimal power flow (OPF) problem with discrete control variables is an NP-hard problem in its exact formulation. To cope with the immense computational-difficulty of this problem, we propose an ordinal optimization theory-based algorithm to solve for a good enough solution with high probability. Aiming for hard optimization problems, the ordinal optimization theory, in contrast to heuristic methods, guarantee to provide a top n% solution among all with probability more than 0.95. The approach of our ordinal optimization theory-based algorithm consists of three stages. First, select heuristically a large set of candidate solutions. Then, use a simplified model to select a subset of most promising solutions. Finally, evaluate the candidate promising-solutions of the reduced subset using the exact model. We have demonstrated the computational efficiency of our algorithm and the quality of the obtained solution by comparing with the competing methods and the conventional approach through simulations.
URI: http://dx.doi.org/10.1109/TPWRS.2003.818732
http://hdl.handle.net/11536/27079
ISSN: 0885-8950
DOI: 10.1109/TPWRS.2003.818732
期刊: IEEE TRANSACTIONS ON POWER SYSTEMS
Volume: 19
Issue: 1
起始頁: 276
結束頁: 286
Appears in Collections:Articles


Files in This Item:

  1. 000188951000037.pdf