Search
Now showing items 1-10 of 24
A branch-and-bound algorithm for the multi-stage transmission expansion planning
(2005-10-31)
This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models ...
A Branch and Bound algorithm to solve nonconvex MINLP problems via novel division strategy: An electric power system case study
(2017-07-12)
This paper presents two Branch and Bound algorithms (B&B) for solving mixed-integer nonlinear programming (MINLP) problems with nonconvex search space. The main advantage of the proposed algorithms, comparing with the ...
A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem
(Ieee, 2013-01-01)
In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of ...
A Branch and Bound Algorithm to Solve Nonconvex MINLP Problems via Novel Division Strategy: An Electric Power System Case Study
(Ieee, 2017-01-01)
This paper presents two Branch and Bound algorithms (B&B) for solving mixed-integer nonlinear programming (MINLP) problems with nonconvex search space. The main advantage of the proposed algorithms, comparing with the ...
Branch and bound algorithm for transmission network expansion planning using DC model
(2007-12-01)
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of ...
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
An analysis of the branch-and-bound method in solving the reactive optimal power flow problem
(2017-10-20)
The purpose of an Optimal Power Flow (OPF) problem is to determine the state of an electric power transmission system that optimizes a given system performance and satisfies its physical and operational constraints. The ...
An Analysis of the Branch-and-Bound Method in Solving the Reactive Optimal Power Flow Problem
(Ieee, 2017-01-01)
The purpose of an Optimal Power Flow (OPF) problem is to determine the state of an electric power transmission system that optimizes a given system performance and satisfies its physical and operational constraints. The ...