SearcharxivSearch

arXiv · 1410.2476

Hybrid global-local optimisation algorithms for the layout design of tidal turbine arrays

Abstract

Tidal stream power generation represents a promising source of renewable energy. In order to extract an economically useful amount of power, tens to hundreds of tidal turbines need to be placed within an array. The layout of these turbines can have a significant impact on the power extracted and hence on the viability of the site. Funke et al. formulated the question of the best turbine layout as an optimisation problem constrained by the shallow water equations and solved it using a local, gradient-based optimisation algorithm. Given the local nature of this approach, the question arises of how optimal the layouts actually are. This becomes particularly important for scenarios with complex bathymetry and layout constraints, both of which typically introduce locally optimal layouts. Optimisation algorithms which find the global optima generally require orders of magnitude more iterations than local optimisation algorithms and are thus infeasible in combination with an expensive flow model. This paper presents an analytical wake model to act as an efficient proxy to the shallow water model. Based upon this, a hybrid global-local two-stage optimisation approach is presented in which turbine layouts are first optimised with the analytical wake model via a global optimisation algorithm, and further optimised with the shallow water model via a local gradient-based optimisation algorithm. This procedure is applied to a number of idealised cases and a more realistic case with complex bathymetry in the Pentland Firth, Scotland. It is shown that in cases where bathymetry is considered, the two-stage optimisation procedure is able to improve the power extracted from the array by as much as 25% compared to local optimisation for idealised scenarios and by as much as 12% for the more realistic Pentland Firth scenario whilst in many cases reducing the overall computation time by approximately 35%.

Explore related subjects

Keep this discovery

BibTeXRIS

George L. Barnett, Simon W. Funke, Matthew D. Piggott. 2014-10-09. Hybrid global-local optimisation algorithms for the layout design of tidal turbine arrays. https://arxiv.org/abs/1410.2476

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC