Buscar
Mostrando ítems 1-10 de 68
MILP branch flow model for concurrent AC multistage transmission expansion and reactive power planning with security constraints
(Inst Engineering Technology-iet, 2016-09-02)
This study presents a mixed-integer linear programming (MILP) model to solve the simultaneous transmission network expansion planning (TNEP) and reactive power planning (RPP) problem. The proposed model considers reactive ...
Milp Branch Flow Model For Concurrent Ac Multistage Transmission Expansion And Reactive Power Planning With Security Constraints
(Inst Engineering Technology-IETHertford, 2016)
Planeamiento estático de la expansión del sistema de transmisión utilizando enlaces de corriente directa
(Universidad de Cuenca, 2022-06-21)
In recent years, high voltage direct current (HVDC) transmission has become technically
and economically feasible, to the point that HVDC networks integrated with alternating
current (AC) systems are being developed. ...
Planeamiento dinámico de la expansión de los sistemas de transmisión utilizando un algoritmo voraz iterativo
(Universidad de Cuenca, 2022-05-16)
The Dynamic Transmission System Expansion Planning (DTSEP) problem provides a
more efficient possibility for the investment in new infrastructure in the electrical system.
Currently, the use of meta-heuristics leads the ...
Particle swarm optimization aplicada ao planejamento da expansão de sistemas de transmissão
(Universidade Estadual Paulista (Unesp), 2014-02-28)
In this work, two methodologies to solve the transmission network expansion planning (TNEP) problem have been proposed. The first one is a presentation of a meta-heuristic based algorithm, Particle Swarm Optimization (PSO), ...
Meta-heurística Multipartida com Path Relinking aplicados ao planejamento da expansão de sistemas de transmissão de energia elétrica
(Universidade Estadual Paulista (Unesp), 2020-08-17)
O Planejamento da Expansão de Sistemas de Transmissão (PEST) é um problema que visa a seleção de novas linhas de transmissão (LTs) para garantir o atendimento ao crescimento da geração e da demanda respeitando os limites ...
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 ...
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
(2013-12-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 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 ...