SearcharxivSearch

arXiv · 2411.19198

Optimal energy collection with rotational movements constraints in concentrated solar power plants

Abstract

In Concentrated Solar Power (CSP) plants based on Parabolic Trough Collectors (PTC), the Sun is tracked at discrete time intervals, with each interval representing a movement of the collector system. The act of moving heavy mechanical structures can lead to the development of cracks, bending, and/or displacements of components from their optimal optical positions. This, in turn, diminishes the overall performance of the entire system for energy capture. In this context, we introduce two combinatorial optimization problems to limit the number of tracking steps of the collector and hence the risk of failure incidents and contaminant leaks. On the one hand, the Minimum Tracking Motion (MTM)-Problem aims at detecting the minimum number of movements while maintaining the production within a given range. On the other hand, the Maximal Energy Collection (MEC)-Problem aims to achieve optimal energy production within a predetermined number of movements. Both problems are solved assuming scenarios where the energy collection function contains any number of local maximum/minimum due to optical errors of the elements in the PTCsystem. The MTM- and MEC-Problems are solved in O(n) time and O(n2mw*) time, respectively, being n the number of steps in the energy collection function, m the maximum number of movements of the solar structure, and w* the maximal amplitude angle that the structure can cover. The advantages of the solutions are shown in realistic experiments. While these problems can be solved in polynomial time, we establish the NP-hardness of a slightly modified version of the MEC-Problem. The proposed algorithms are generic and can be adapted to schedule solar tracking in other CSP systems.

Explore related subjects

Keep this discovery

BibTeXRIS

J. M. Díaz-Bañez, J. M. Higes-López, M. A. Pérez-Cutiño, J. Valverde. 2024-11-28. Optimal energy collection with rotational movements constraints in concentrated solar power plants. https://doi.org/10.1016/j.ejor.2024.04.027

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

KEEP EXPLORING

Related papers

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM