Towards negative cycle canceling in wind farm cable layout optimization
Abstract In the Wind Farm Cabling Problem (WCP) the task is to design the internal cabling of a wind farm such that all power from the turbines can be transmitted to the substations and the costs for the cabling are minimized. Cables can be chosen from several available cable types, each of which ha...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-10-01
|
| Series: | Energy Informatics |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s42162-018-0030-6 |
| _version_ | 1818302050101886976 |
|---|---|
| author | Sascha Gritzbach Torsten Ueckerdt Dorothea Wagner Franziska Wegner Matthias Wolf |
| author_facet | Sascha Gritzbach Torsten Ueckerdt Dorothea Wagner Franziska Wegner Matthias Wolf |
| author_sort | Sascha Gritzbach |
| collection | DOAJ |
| description | Abstract In the Wind Farm Cabling Problem (WCP) the task is to design the internal cabling of a wind farm such that all power from the turbines can be transmitted to the substations and the costs for the cabling are minimized. Cables can be chosen from several available cable types, each of which has a thermal capacity and cost. Until now, solution approaches mainly use Mixed-integer Linear Programs (MILP) or metaheuristics. We present our current state of research on a fast heuristic specifically designed for WCP. We introduce an algorithm that iteratively improves a cable layout by finding and canceling negative cycles in a suitably defined network. Our simulations on publicly available benchmark sets show that the heuristic is not only fast but it tends to produce good results. Currently our algorithm gives better solutions on large wind farms compared to an MILP solver. However, on small to medium instances the solver performs better in terms of solution quality, which represents a starting point for future work. |
| first_indexed | 2024-12-13T05:32:44Z |
| format | Article |
| id | doaj.art-808b67b63b6741a0901c372ed1ffc663 |
| institution | Directory Open Access Journal |
| issn | 2520-8942 |
| language | English |
| last_indexed | 2024-12-13T05:32:44Z |
| publishDate | 2018-10-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Energy Informatics |
| spelling | doaj.art-808b67b63b6741a0901c372ed1ffc6632022-12-21T23:58:01ZengSpringerOpenEnergy Informatics2520-89422018-10-011S118319310.1186/s42162-018-0030-6Towards negative cycle canceling in wind farm cable layout optimizationSascha Gritzbach0Torsten Ueckerdt1Dorothea Wagner2Franziska Wegner3Matthias Wolf4Karlsruhe Institute of Technology, Department of Theoretical InformaticsKarlsruhe Institute of Technology, Department of Theoretical InformaticsKarlsruhe Institute of Technology, Department of Theoretical InformaticsKarlsruhe Institute of Technology, Department of Theoretical InformaticsKarlsruhe Institute of Technology, Department of Theoretical InformaticsAbstract In the Wind Farm Cabling Problem (WCP) the task is to design the internal cabling of a wind farm such that all power from the turbines can be transmitted to the substations and the costs for the cabling are minimized. Cables can be chosen from several available cable types, each of which has a thermal capacity and cost. Until now, solution approaches mainly use Mixed-integer Linear Programs (MILP) or metaheuristics. We present our current state of research on a fast heuristic specifically designed for WCP. We introduce an algorithm that iteratively improves a cable layout by finding and canceling negative cycles in a suitably defined network. Our simulations on publicly available benchmark sets show that the heuristic is not only fast but it tends to produce good results. Currently our algorithm gives better solutions on large wind farms compared to an MILP solver. However, on small to medium instances the solver performs better in terms of solution quality, which represents a starting point for future work.http://link.springer.com/article/10.1186/s42162-018-0030-6Wind farm cable layoutNegative cycle cancelingNetwork flowStep functionHeuristic |
| spellingShingle | Sascha Gritzbach Torsten Ueckerdt Dorothea Wagner Franziska Wegner Matthias Wolf Towards negative cycle canceling in wind farm cable layout optimization Energy Informatics Wind farm cable layout Negative cycle canceling Network flow Step function Heuristic |
| title | Towards negative cycle canceling in wind farm cable layout optimization |
| title_full | Towards negative cycle canceling in wind farm cable layout optimization |
| title_fullStr | Towards negative cycle canceling in wind farm cable layout optimization |
| title_full_unstemmed | Towards negative cycle canceling in wind farm cable layout optimization |
| title_short | Towards negative cycle canceling in wind farm cable layout optimization |
| title_sort | towards negative cycle canceling in wind farm cable layout optimization |
| topic | Wind farm cable layout Negative cycle canceling Network flow Step function Heuristic |
| url | http://link.springer.com/article/10.1186/s42162-018-0030-6 |
| work_keys_str_mv | AT saschagritzbach towardsnegativecyclecancelinginwindfarmcablelayoutoptimization AT torstenueckerdt towardsnegativecyclecancelinginwindfarmcablelayoutoptimization AT dorotheawagner towardsnegativecyclecancelinginwindfarmcablelayoutoptimization AT franziskawegner towardsnegativecyclecancelinginwindfarmcablelayoutoptimization AT matthiaswolf towardsnegativecyclecancelinginwindfarmcablelayoutoptimization |