Chordal Conversion Based Convex Iteration Algorithm for Three-Phase Optimal Power Flow Problems
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm based PID Tuning for Optimal Power Control of a Three- shaft Brayton Cycle based Power Conversion Unit
This paper considers the development of a PID control strategy to optimally control the power output of a High Temperature Gas-cooled Reactor (HTGR) power plant. A specific type of HTGR called the Pebble Bed Modular Reactor (PBMR) that utilises a closed recuperative Brayton cycle with helium as working fluid is considered. The power control of this kind of plant is significantly different from ...
متن کاملSolving Multi-objective Optimal Power Flow Using Modified GA and PSO Based on Hybrid Algorithm
The Optimal Power Flow (OPF) is one of the most important issues in the power systems. Due to the complexity and discontinuity of some parameters of power systems, the classic mathematical methods are not proper for this problem. In this paper, the objective function of OPF is formulated to minimize the power losses of transmission grid and the cost of energy generation and improve the voltage ...
متن کاملOptimal power flow based on gray wolf optimization algorithm using probability density functions extraction considering wind power uncertainty
In recent years, utilization of the renewable based power plants has become widespread in the power systems. One of the most widely used renewable based power plants is wind power plants. Due to the utilization of wind energy to generate electricity, wind turbines have not emitted any environmental pollution. Thus, in addition to economic benefits, utilization of these power plants is of great ...
متن کاملAn Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.
متن کاملCapacity scaling algorithm for scalable M-convex submodular flow problems
An M-convex function is a nonlinear discrete function defined on integer points introduced by Murota in 1996, and the M-convex submodular flow problem is one of the most general frameworks of efficiently solvable combinatorial optimization problems. It includes the minimum cost flow and the submodular flow problems as its special cases. In this paper, we first devise a successive shortest path ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2018
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2017.2735942