Paralelização da metaheurística busca tabu para solucionar o problema de roteamento de cabos em parques eólicos

Abstract

The highest rate of energy consumption in the world has been registered in recent years, with this increase, to meet this demand, the production of coal-fired energy has increased, which consequently increased the emission rates of ��!. Thinking about it, clean energy sources receive investors’ attention. Wind energy stands out for being one of the cleanest. In this term paper the Wind Farm Cable Routing Problem (WFCRP) with several types of cables and a single substation with limited connections, was studied. The objective of the problem is to find the lowest cost topology to connect all the turbines to the substation in order to collect the energy produced by each turbine. Throughout the work, a heuristic algorithm based on the Tabu Search metaheuristic was proposed, along with local search parallelization techniques. The algorithm was executed once for each given instance, having as initial solution the best solution found by OLIVEIRA, RIBEIRO (2020), taking a maximum of 2 minutes to provide the best solution found. The parallelized tabu search showed an improvement of 11% on average in the results obtained by OLIVEIRA, RIBEIRO (2020), but in no instance was it able to reach the best solution, being on average 21% above the best known solution.