Abstract
We study the problem of computing a wind farm cabling with minimum costs allowing different cable types. Our model distinguishes different levels of granularity, where the highest level represents the cabling problem for the whole wind farm. Since even the most restricted of these problems is NP-hard, we introduce a novel Simulated Annealing approach for solving the cabling problem. While previous work focuses on few and small instances, often with less than 50 turbines, our simulations show that our approach gives good results on a varied benchmark set of complex large-scale wind farms 1. For wind farms with up to 450 turbines it outperforms our mixed-integer linear program in terms of quality and running time.
Original language | English |
---|---|
Title of host publication | e-Energy '17 Proceedings of the Eighth International Conference on Future Energy Systems, 16-19 May 2017, Shatin, Hong Kong |
Place of Publication | New York |
Publisher | Association for Computing Machinery, Inc |
Pages | 203-215 |
Number of pages | 13 |
ISBN (Print) | 978-1-4503-5036-5 |
DOIs | |
Publication status | Published - 2017 |
Event | 8th ACM International Conference on Future Energy Systems, e-Energy 2017 - Shatin, Hong Kong Duration: 16 May 2017 → 19 May 2017 |
Conference
Conference | 8th ACM International Conference on Future Energy Systems, e-Energy 2017 |
---|---|
Country/Territory | Hong Kong |
City | Shatin |
Period | 16/05/17 → 19/05/17 |
Keywords
- Benchmark Sets
- Simulated Annealing
- Wind Farm Cabling