A High-Performance Tensorial Evolutionary Computation for Solving Spatial Optimization Problems

초록

As a newly emerged evolutionary algorithm, tensorial evolution (TE) has shown promising performance in solving spatial optimization problems owing to its tensorial representation and tensorial evolutionary patterns. TE algorithm sequentially performed different tensorial evolutionary operations on a single individual or pairs of individuals in a population during iterations. Since tensor algebra considers all dimensions of data simultaneously, TE was explicitly parallel in dimension level. However, it was burdened with intensive tensor calculations especially when encountering large-scale problems. How to extend TE to efficiently solve large-scale problems is one of the most pressing issues currently. Toward this goal, we first devise an efficient TE (ETE) algorithm which expresses all the evolutionary processes in a unified tensorial computational model. Compared to TE, the tensorial evolutionary operations are directly executed on a population rather than sole individuals, enabling ETE to achieve explicit parallel in both dimension and individual levels. To further enhance the computational efficiency of ETE, we leverage the compute unified device architecture (CUDA), which provides access to computational resources on graphics processing units (GPUs). A CUDA-based implementation of ETE (Cu-ETE) is then presented that utilizes GPU to accelerate tensorial evolutionary computation. Notably, Cu-ETE is the first implementation of tensorial evolution on GPU. Experimental results demonstrate the enhanced computational efficiency of both ETE (CPU) and Cu-ETE (GPU) over TE (CPU). By harnessing the power of tensorial algebra and GPU acceleration, Cu-ETE opens up new possibilities for efficient problem-solving in more complex and large-scale problems across various fields of knowledge. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

키워드