Research Article
Optimization design of heliostat field based on high-dimensional particle swarm and multiple population genetic algorithms
@ARTICLE{10.4108/ew.5653, author={Yiwen Huang}, title={Optimization design of heliostat field based on high-dimensional particle swarm and multiple population genetic algorithms}, journal={EAI Endorsed Transactions on Energy Web}, volume={11}, number={1}, publisher={EAI}, journal_a={EW}, year={2024}, month={4}, keywords={Single-objective optimization, high-dimensional particle swarm algorithm, multiple group genetic algorithm, ray tracing}, doi={10.4108/ew.5653} }
- Yiwen Huang
Year: 2024
Optimization design of heliostat field based on high-dimensional particle swarm and multiple population genetic algorithms
EW
EAI
DOI: 10.4108/ew.5653
Abstract
INTRODUCTION: Tower-type heliostat field is a new type of energy conversion, which has the advantages of high energy efficiency, flexibility and sustainability and environmental friendliness. OBJECTIVES: Through the research and improvement of the tower heliostat field to promote the development of solar energy utilization technology. METHODS: In this paper, we calculate and optimize the tower heliostat field by using single objective optimization, high-dimensional particle swarm algorithm and multiple group genetic algorithm. RESULTS: In this case of question setting, average annual optical efficiency is 0.6696; average annual cosine efficiency is 0.7564; annual average shadow occlusion efficiency is 0.9766; average annual truncation efficiency is 0.9975; average annual output thermal power is 35539.1747W; mean annual output thermal power per unit area is 0.5657W.The optimal solution after the initial optimization of the algorithm is that the total number of mirror fields is 6,384 pieces, and the average annual output power per unit area is 530.6W. CONCLUSION: The model of this paper can reasonably solve the problem and has strong practicability and high efficiency, but high dimensional particle swarm algorithm due to easily get local optimal solution, so can introduce the chaotic mapping to increase the randomness of the search space, improve the global search ability of the algorithm.
Copyright © 2024 Y. Huang et al., licensed to EAI. This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.