Evolutionary Multi-Move Path-Relinking for Transmission Network Expansion Planning

Author(s)

Rahmani, M. ; Rashidinejad, M. ; Carreno, E. M. ; Romero, R. A. ; IEEE

• Document type: Journal article
• Source: IEEE PES GENERAL MEETING; v. N/A, p. 6-pg., 2010-01-01.

Abstract

This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to generate a set of high quality initial solutions with different topologies. The population is evolved using a multi-move path-relinking with the objective of finding minimum investment cost for the transmission expansion planning problem employing the DC representation. The algorithm is tested on the southern Brazilian system, obtaining the optimal solution for the system with better performance than similar metaheuristics algorithms applied to the same problem. (AU)

• FAPESP's process: 09/14816-7 - Analysis of new mathematical models for the transmission network expansion problem.
• Grantee: Mohsen Rahmani
• Support Opportunities: Scholarships in Brazil - Doctorate