BrkgaCuda 2.0: a framework for fast biased random-key genetic algorithms on GPUs.
Saved in:
| Title: | BrkgaCuda 2.0: a framework for fast biased random-key genetic algorithms on GPUs. |
|---|---|
| Authors: | Oliveira, Bruno A., Xavier, Eduardo C., Borin, Edson |
| Source: | Soft Computing - A Fusion of Foundations, Methodologies & Applications; Nov2024, Vol. 28 Issue 21, p12689-12704, 16p |
| Subject Terms: | VEHICLE routing problem, TRAVELING salesman problem, PARALLEL algorithms, GENETIC algorithms, COMPUTING platforms |
| Abstract: | In this paper, we present the development of a new version of the BrkgaCuda, called BrkgaCuda 2.0, to support the design and execution of Biased Random-Key Genetic Algorithms (BRKGA) on CUDA/GPU-enabled computing platforms, employing new techniques to accelerate the execution. We compare the performance of our implementation against the standard CPU implementation and a previous GPU implementation. In the same spirit as the standard implementation, all central aspects of the BRKGA logic are dealt with in our framework, and little effort is required to reuse the framework on another problem. The user can also implement the decoder on the CPU in C++ or GPU in CUDA. Moreover, the BrkgaCuda 2.0 provides a decoder that receives a permutation created by sorting the indices of the chromosomes using the genes as keys. To evaluate our framework, we use a total of 54 instances of the Traveling Salesman Problem, the Set Cover Problem, and the Capacitated Vehicle Routing Problem, using two decoders in the last one. Our focus on this work is to improve the performance within the BRKGA logic. We show that the BrkgaCuda 2.0 is the fastest among similar frameworks while still providing solutions of similar quality. [ABSTRACT FROM AUTHOR] |
| Copyright of Soft Computing - A Fusion of Foundations, Methodologies & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!