2018
DOI: 10.1007/s40565-018-0472-7
|View full text |Cite
|
Sign up to set email alerts
|

Optimal configuration problem identification of electrical power cable in tidal turbine farm via traveling salesman problem modeling approach

Abstract: Electrical power cables in tidal turbine farms contribute a significant share to capital expenditure (CAPEX). As a result, the routing of electrical power cables connecting turbines to cable collector hubs must be designed so as to obtain the least cost configuration. This is referred to as a tidal cable routing problem. This problem possesses several variants depending on the number of cable collector hubs. In this paper, these variants are modeled by employing the approach of the single depot multiple travel… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 20 publications
(30 reference statements)
0
3
0
Order By: Relevance
“…The impedance, maximum current carrying capacity, etc., of each cable segment is determined after the cross-sectional area thereof is determined. A subset SF i is created for each branch F i to hold the number of all cable segments subordinate to this branch, and then the maximum voltage drop ∆U F,i for this branch is calculated using Equation (4) [36].…”
Section: Branch Voltage Drop Modelmentioning
confidence: 99%
“…The impedance, maximum current carrying capacity, etc., of each cable segment is determined after the cross-sectional area thereof is determined. A subset SF i is created for each branch F i to hold the number of all cable segments subordinate to this branch, and then the maximum voltage drop ∆U F,i for this branch is calculated using Equation (4) [36].…”
Section: Branch Voltage Drop Modelmentioning
confidence: 99%
“…For example, the capitalized MST and the dynamic MST were employed separately to enhance the processing power of a large number of constraints in the optimization of the topology [9,10]. Another applied graph-based model employed in the literature is the travelling salesman problem model [12,13], which obtained the optimal topology by traversing all nodes to form a collection containing multiple different shortest paths. In addition, a hop-indexed integer programming formulation to achieve the optimization of the string topology was introduced by Bauer et al [14], which replaced the graph theory method, by constructing a connection matrix combined with a random algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Finally, Section 5 presents the conclusions. Vartdal et al (2019) indicate that the electricity cables in tidal turbine farms generate high capital expenditure. They therefore aimed to find the cheapest configuration for routing the electrical supply cables, which connect the turbines to the collection center.…”
Section: Introductionmentioning
confidence: 99%