A Biased Random Key Genetic Algorithm to Solve the Transmission Expansion Planning Problem with Re-design
- 1 July 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Abstract
Most developing countries need to constantly work on the expansion of their electric transmission networks. This task needs to be carefully planned. Unlike several Network Design Problem, a transmission network may become more efficient after cutting-off some of its transmission lines. The version of the problem where the redesign is allowed when expanding is known in the literature as Transmission Expansion Planning Problem with Re-design, TEPr, and will be the focus of this paper. To solve TEPr, we propose a hybridization of Biased Random-Key Genetic Algorithm with Local Branching. Computational experiments showed the impact of the developed method in comparison to the straight forward application of the mathematical formulation.Keywords
This publication has 36 references indexed in Scilit:
- A biased random key genetic algorithm for 2D and 3D bin packing problemsInternational Journal of Production Economics, 2013
- Fuzzy job shop scheduling problem with availability constraintsComputers & Industrial Engineering, 2010
- Survivable IP network design with OSPF routingNetworks, 2006
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routingNetworks, 2005
- Power Transmission Network Design by Greedy Randomized Adaptive Path RelinkingIEEE Transactions on Power Systems, 2005
- An evolutionary algorithm for manufacturing cell formationComputers & Industrial Engineering, 2004
- Local branchingMathematical Programming, 2003
- Classification of publications and models on transmission expansion planningIEEE Transactions on Power Systems, 2003
- A greedy randomized adaptive search procedure for transmission expansion planningIEEE Transactions on Power Systems, 2001
- Transmission network expansion planning under a Tabu Search approachIEEE Transactions on Power Systems, 2001