×

Application of a modified imperialist competitive algorithm for solving the traveling salesman problem. (Persian. English summary) Zbl 1304.68167

Summary: This paper proposes a modified Imperialist Competitive Algorithm (MICA) for solving the Traveling Salesman Problem (TSP) that is different with common Imperialist Competitive Algorithm (ICA) in assimilation policy between Imperialist and colonies countries and revolution of colonies. Furthermore, the 3-opt local search is used for increasing performance of the algorithm. The new ICA algorithm is tested on nineteen instances of TSBLIB and its performance is compared with ICA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Evolutionary Algorithm (EA) and Bee Colony Optimization (BCO). Extensive computational tests confirm the effectiveness of the proposed approach.

MSC:

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
90C27 Combinatorial optimization
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: Link