Performance analysis of the traveling salesman problem optimization using ant colony algorithm and OpenMP
Optimization using ant colony (ACO) is one of algorithms which is used for distributed control and optimization. Beside static methods these methods and algorithms are more flexible and robust in dynamical environments such as traffic on Internet and standard telephony. These problems belong to class of hard problems because of huge space of possible solutions which need to be found in reasonable time. Traveling salesman problem (TSP) belongs to hard problems. Since solving these problems need a lot of time for execution this paper presents an attempt to decrees execution time using parallelization on multicore processors. OpenMP was used as a main parallelization tool. Certain acceleration was achieved.