2019
DOI: 10.1007/978-3-030-25636-4_12
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing a GPU-Parallelized Ant Colony Metaheuristic by Parameter Tuning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…The ACO is a probabilistic technique that bio-mimics the behavior of ants and the process of searching foods by searching the optimal path route to solve the complex optimization problem [227]. Implementing the ACO algorithm for solving the path optimization problems has several advantages, such as strong robustness [228,229] and parallel computation [230,231]. However, the algorithm could easily trap in the local optimum as well as slow convergence speed [232,233].…”
Section: ) Swarm Intelligencementioning
confidence: 99%
“…The ACO is a probabilistic technique that bio-mimics the behavior of ants and the process of searching foods by searching the optimal path route to solve the complex optimization problem [227]. Implementing the ACO algorithm for solving the path optimization problems has several advantages, such as strong robustness [228,229] and parallel computation [230,231]. However, the algorithm could easily trap in the local optimum as well as slow convergence speed [232,233].…”
Section: ) Swarm Intelligencementioning
confidence: 99%