Parallel genetic algorithms for a hypercube
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Future Generation Computer Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Journal of Heuristics
Parallelization Strategies for Ant Colony Optimization
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Ant Colony Optimization
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Parallel Metaheuristics: A New Class of Algorithms
Parallel Metaheuristics: A New Class of Algorithms
Ant Colony Optimization with Castes
ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part I
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Ant colony optimization for Steiner tree problems
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
WSEAS Transactions on Computers
Comparison of parallel metaheuristics for solving the TSP
CompSysTech '08 Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Review: A review of ant algorithms
Expert Systems with Applications: An International Journal
Parallel shared memory strategies for ant-based optimization algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
A hybrid algorithm for the vehicle routing problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An analysis of communication policies for homogeneous multi-colony ACO algorithms
Information Sciences: an International Journal
Cunning ant system for quadratic assignment problem with local search and parallelization
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Ant algorithms for the exam timetabling problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
WSEAS Transactions on Computers
Parallel ant colony optimization algorithm on a multi-core processor
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
Information Sciences: an International Journal
A survey on parallel ant colony optimization
Applied Soft Computing
An improved parallel ant colony optimization based on message passing interface
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Information Sciences: an International Journal
Parallel Ant Colony Optimization on Graphics Processing Units
Journal of Parallel and Distributed Computing
A parallel approach to clustering with ant colony optimization
SBIA'12 Proceedings of the 21st Brazilian conference on Advances in Artificial Intelligence
Parallel ACO with a Ring Neighborhood for Dynamic TSP
Journal of Information Technology Research
Hi-index | 0.00 |
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a high-performing ant colony optimization (ACO) algorithm for the traveling salesman problem using message passing libraries. In particular, we examine synchronous and asynchronous communications on different interconnection topologies. We find that the simplest way of parallelizing the ACO algorithms, based on parallel independent runs, is surprisingly effective; we give some reasons as to why this is the case.