Comparison of parallel metaheuristics for solving the TSP

Authors:
Milena Lazarova;Plamenka Borovska
Affiliations:
Technical University of Sofia;Technical University of Sofia
Venue:
CompSysTech '08 Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Year:
2008

Citing 8
Cited 0

Parallel simulated annealing algorithms

Journal of Parallel and Distributed Computing
The ant colony optimization meta-heuristic

New ideas in optimization
Parallelization Strategies for Ant Colony Optimization

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory

Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms
Parallel ant colony optimization for the traveling salesman problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper compares the efficiency of several metaheuristics for solving the travelling salesman problem. Parallel computational models are suggested for ant colony optimization, simulated annealing and genetic algorithm. The models utilize multiple independent runs on multicomputer platform. The performance parameters and parallelism profiling of the metaheuristics are made based on hybrid (MPI+OpenMP) implementations of the suggested models for solving several instances of TSP from the TSPLIB.