Be the first to like this
In optimization problem, Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO) have
been known as good alternative techniques. GA is designed by adopting the natural evolution process,
while ACO is inspired by the foraging behaviour of ant species. This paper presents a hybrid GA-ACO for
Travelling Salesman Problem (TSP), called Genetic Ant Colony Optimization (GACO). In this method, GA
will observe and preserve the fittest ant in each cycle in every generation and only unvisited cities will be
assessed by ACO. From experimental result, GACO performance is significantly improved and its time
complexity is fairly equal compared to the GA and ACO.