A Hybrid Cultural Algorithm with Local Search for Traveling Salesman Problem

Abstract

New hybrid cultural algorithm with local search (HCALS) is introduced to solve traveling salesman problem (TSP). The algorithm integrates the local search method into the cultural algorithm which uses social intelligence to guide and lead individuals in the population. Better solutions can be attained by controlling individuals which are locally optimized by the local search methods. The combination of these two methods can be a promising method for solving the combinatorial problems like TSP. The experimental results show that the proposed algorithm can find better solutions than other methods for TSP in most cases.