Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure

R. Figueiredo (1) , P. Gonzalez Silva (2) , Michael Poss (3)

1 CIDMA - Center for Research & Development in Mathematics and Applications [Aveiro]
2 UERJ - Universidade do Estado do Rio de Janeiro [Brasil] = Rio de Janeiro State University [Brazil] = Université d'État de Rio de Janeiro [Brésil]
3 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]

Transmission expansion planning with re-design has been recently proposed in the literature to improve on the classical transmission expansion planning by allowing to cut-off circuits while expanding the network. Although the reductions in the solution costs are significant, the resulting mixed-integer linear programming formulations are very difficult to solve exactly for large networks. In this work, we propose the first metaheuristic for the transmission expansion planing problem with re-design: a simple yet efficient GRASP metaheuristic. We show on realistic networks for which the optimal solutions are known that our method is able to provide in short amounts of time feasible solutions as cheap as the optimal ones. Moreover, we are able to compute a new feasible solution for benchmark instance Brazil Southeast that is cheaper than the best solution from the literature.

Domaines: Recherche opérationnelle [math.OC]

R. Figueiredo, P. Gonzalez Silva, Michael Poss. Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure. ICORES, Feb 2012, Portugal. pp.380-385. ⟨hal-00781328⟩