Name
Abstract | ||
|---|---|---|
An integer programming model for minimizing the cabling costs of offshore wind farms which allows for branching of the cables is developed. Model features include upper bounds on the number of cable branches made at any wind turbine, upper bounds on the cable loads, and exclusion of crossing cable segments. The resulting model resembles the capacitated minimum spanning tree problem, with the addition of degree and planarity constraints. Numerical experiments with realistic wind farm data indicate that the benefit from branching is small when using only one cable type, but is up to 13% if allowing for two different cable types. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-18161-5_3 | MODELLING, COMPUTATION AND OPTIMIZATION IN INFORMATION SYSTEMS AND MANAGEMENT SCIENCES - MCO 2015, PT 1 |
Keywords | Field | DocType |
offshore wind farms,cable routes,integer programming,constrained minimum spanning tree | Capacitated minimum spanning tree,Mathematical optimization,Integer programming model,Planarity testing,Offshore wind power,Computer science,Integer programming,Turbine,Branching (version control) | Conference |
Volume | ISSN | Citations |
359 | 2194-5357 | 1 |
PageRank | References | Authors |
0.41 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arne Klein | 1 | 1 | 0.41 |
| Dag Haugland | 2 | 151 | 15.18 |
| Joanna Bauer | 3 | 65 | 5.72 |
| Mario Mommer | 4 | 1 | 0.41 |