Buscar
Mostrando ítems 101-110 de 12602
An implementation of modified scatter search algorithm to transmission expansion planning
(Tubitak Scientific & Technical Research Council Turkey, 2012-01-01)
Transmission network expansion planning (TNEP) is one of the most important tasks in the field of power systems, especially in deregulated power system environments. TNEP is a nonlinear mixed integer programming problem ...
Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem
(Univ Nac Colombia, Fac Ingenieria, 2011-04-01)
This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network ...
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 ...
Improved disjunctive models for the transmission expansion planning
(2020-08-02)
This paper presents two improved disjunctive models for the transmission expansion planning problem, with the inclusion of additional critic cycles has been developed by the authors in recent works, in order to improve ...
Improved Disjunctive Models for the Transmission Expansion Planning
(Ieee, 2020-01-01)
This paper presents two improved disjunctive models for the transmission expansion planning problem, with the inclusion of additional critic cycles has been developed by the authors in recent works, in order to improve ...
Angular Cuts for Expansion Paths in Transmis-sion System Planning
(2018-10-26)
this paper presents a methodology to solve the long-Term transmission expansion planning problem incorporating angular cuts based in the constraints impose for expansion circuits with low capacity-reactance product over ...
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 ...
Transmission expansion planning via a constructive heuristic algorithm in restructured electricity industry
(2013-12-01)
The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm ...
Transmission network expansion planning for the Colombian electrical system: Connecting the Ituango hydroelectric power plant
(Elsevier B.V., 2014-05-01)
The hydroelectric power plant Hidroltuango represents a major expansion for the Colombian electrical system (with a total capacity of 2400 MW). This paper analyzes the possible interconnections and investments involved in ...
Robust Multi-Stage Substation Expansion Planning Considering Stochastic Demand
(Ieee-inst Electrical Electronics Engineers Inc, 2016-05-01)
This paper presents a novel mixed-integer secondorder cone programming model for the robust multi-stage substation expansion planning problem considering stochastic demand. The stochastic nature of the demands is considered ...