A Hybrid Genetic-Ant Colony Algorithm for Travelling Salesman Problem

Abstract

Travelling salesman problem is a well-known problem in optimization algorithms. In this study, we propose a hybrid genetic-ant colony algorithm to solve this problem. There are no certain formulas to determine the parameters of ant colony algorithm. Usually, programmers use the trial and error method to find best values. We use the genetic algorithm to optimize best parameter values of ant colony algorithm. In this way, the success rate of ant colony algorithm is maximized.