2018
DOI: 10.1007/s11227-018-2404-8
|View full text |Cite
|
Sign up to set email alerts
|

Design of a parallel genetic algorithm for continuous and pattern-free heliostat field optimization

Abstract: The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
15
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(17 citation statements)
references
References 25 publications
0
15
0
Order By: Relevance
“…In this configuration, dynamic receivers mounted on arrays of small towers enable heliostats in mini subfields to direct sunlight with minimal cosine losses, thus improving the field's overall optical efficiency. N. Cruz et al [21] also developed an algorithm using a genetic algorithm that generates a continuous pattern-free field layout. The algorithm developed, using parallelization, provides a solution to the conceptual complexity and high computational cost associated with pattern-free heliostat field optimization.…”
Section: Introductionmentioning
confidence: 99%
“…In this configuration, dynamic receivers mounted on arrays of small towers enable heliostats in mini subfields to direct sunlight with minimal cosine losses, thus improving the field's overall optical efficiency. N. Cruz et al [21] also developed an algorithm using a genetic algorithm that generates a continuous pattern-free field layout. The algorithm developed, using parallelization, provides a solution to the conceptual complexity and high computational cost associated with pattern-free heliostat field optimization.…”
Section: Introductionmentioning
confidence: 99%
“…In [28], a genetic algorithm is designed for this optimization approach. The proposal in [29] is also a genetic algorithm, but it allows infeasible solutions during the search.…”
Section: Introductionmentioning
confidence: 99%
“…Its name is 'Hector', which results from replacing the first letter in the word 'sector' with 'h' (from 'heliostat'). Its novelty lies in offering a mid-term solution between handling all the coordinates directly [29,12,28], and fixing the field after every deployment [8]. The greedy approach in [8] is limited due to its local scope.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations