Multi-GPU Accelerating Strategies of Ant Colony Optimization Algorithms Using Rank Based and Strong Elitist Versions
The most used problem to compare these meta-heuristics is the classical Travelling Salesman Problem (TSP) on a network with sizes from tens to millions of nodes. Nature-based metaheuristics are the main source of optimization techniques to solve this problem. Although there is a zoo of possibilities...
Uložené v:
| Vydané v: | 2023 International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW) s. 68 - 76 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
17.10.2023
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!