Comparison of parallel metaheuristics for solving the TSP
Milena Kirilova Lazarova, Plаmеnkа Borovskа · 2008
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.