An Iterated Local Search Heuristic for the Offshore Wind Farm Cable Routing Problem

Vol 57, 2025 - 339363
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract


The Wind Farm Cable Routing Problem (WFCRP) is an NP-hard optimization problem that minimizes the cost of inter-array cable infrastructure in offshore wind farms. Several metaheuristics, such as Tabu Search (TS), Simulated Annealing (SA), and Variable Neighborhood Search (VNS), have been proposed for this problem. However, these approaches often struggle to find high-quality solutions for instances with more than 100 turbines. This paper proposes an Iterated Local Search (ILS) algorithm for the WFCRP, a metaheuristic not previously explored for this problem. Computational experiments compare ILS with VNS, TS, and SA on 220 benchmark instances with up to 120 turbines. The results show that ILS produces the best solutions. Statistical analysis, using the Friedman and Nemenyi tests, confirms this superiority, showing that the ILS yields statistically better results across all instance sizes.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal da Bahia
Track
  • MH – Metaheurístics
Keywords
Offshore wind farm cable routing
Iterated local search
Energy optimization