Optimization algorithms for solving the traveling salesman problem and their parallelization

Abstract

Traveling salesman problem is often used for testing and comparing the performance of diffrent optimization algorithms. Here we present two of the most common algorithms for solving the problem: genetic algorithm and ant colony optimization. Detailed explanation and implementation notes are given as well as the results of testing. Also, we present a way to parallelize both of these algorithms and speedup that is achieved.

Keywords: Алгоритам колоније мрава, Генетски алгоритам, паралелизација, Проблем трговачког путника

Published on website: 19.2.2011