Parallelization strategies for Ant Colony Optimization
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 722-731
- https://doi.org/10.1007/bfb0056914
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Toward a Taxonomy of Parallel Tabu Search HeuristicsINFORMS Journal on Computing, 1997
- Combining simulated annealing with local search heuristicsAnnals of Operations Research, 1996
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Fast Algorithms for Geometric Traveling Salesman ProblemsINFORMS Journal on Computing, 1992
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- Genetic local search algorithms for the traveling salesman problemPublished by Springer Nature ,1991
- Slow annealing versus multiple fast annealing runs — an empirical investigationParallel Computing, 1990
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965