2016
DOI: 10.1007/978-3-319-51469-7_27
|View full text |Cite
|
Sign up to set email alerts
|

Cultural Ant Colony Optimization on GPUs for Travelling Salesman Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…Similarly, a 22x speedup was achieved in [47] solving pr1002 TSP and 44x on fnl4461 TSP instance in [48]. However, there are also various hybrid approaches for solving TSP - [49] solves parallel Cultural ACO (pCACO) (a hybrid of genetic algorithm and ACO). Research showed that pCACO outperformed sequential and parallel ACO implementations in terms of solution quality.…”
Section: Gpusmentioning
confidence: 98%
“…Similarly, a 22x speedup was achieved in [47] solving pr1002 TSP and 44x on fnl4461 TSP instance in [48]. However, there are also various hybrid approaches for solving TSP - [49] solves parallel Cultural ACO (pCACO) (a hybrid of genetic algorithm and ACO). Research showed that pCACO outperformed sequential and parallel ACO implementations in terms of solution quality.…”
Section: Gpusmentioning
confidence: 98%