Abstract Transmission Expansion Planning (TEP), the problem of deciding the new
transmission lines that should be added to an existing transmission network in order to …

Path-relinking is a major enhancement to the basic greedy randomized adaptive search
procedure (GRASP), leading to significant improvements in solution time and quality. Path …

Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …

Renewable generation and distributed resources are becoming increasingly relevant due to
their various advantages and intense regulatory support. Therefore, there is a need to …

This paper proposes strategies to reduce the number of variables and the combinatorial
search space of the multistage transmission expansion planning problem (TEP). The …

In this study, a high‐performance hybrid genetic algorithm (HGA) is proposed to solve static
and multistage transmission network expansion planning (TNEP) problem. The main …

This paper presents a new focus to the Distribution Network Expansion Planning by
associating it with the locational Transmission Network Use of System (TNUoS) tariffs. A …

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 …

Neste trabalho, são propostas duas metodologias para resolver o problema de
planejamento da expansão de sistemas de transmissão (PPEST). A primeira delas é uma …