A novel and efficient ant-based algorithm for solving traveling salesman problem

Abstract

In this pqer, we present an eflcient metaheuristic method for solving the problem of TSP (traveling salesman problem). We consider mult@le ant clans' concept fiom parallel genetic algorithm to search solutions space that using direrent islands to avoid local minima and so as to obtain global minimum for solving the TSP problem. OUT simulation results indicate that the proposed novel TSP method (called ACOUAC algorithm) performs better than the ant coloty system (ACS).