This article presented a parallel cooperative hybrid algorithm for solving traveling salesman
problem. Although heuristic approaches and hybrid methods obtain good results in solving …

Abstract The Traveling Salesman Problem (TSP) is one of the standard test problems used
in performance analysis of discrete optimization algorithms. The Ant Colony Optimization …

As one suitable optimization method implementing computational intelligence, ant colony
optimization (ACO) can be used to solve the traveling salesman problem (TSP). However …

This paper presents a new metaheuristic approach called ACOMAC algorithm for solving the
traveling salesman problem (TSP). We introduce multiple ant clans' concept from parallel …

This paper proposed a hierarchical hybrid algorithm for traveling salesman problem (TSP)
according to the idea of divide-and-conquer. The TSP problem is decomposed into a few …

The travelling salesman problem (TSP) is a classic problem of combinatorial optimization
and has applications in planning, scheduling, and searching in many scientific and …

The traveling salesman problem (TSP) is an NP complete problem with potential
applications. Thus far, numerous approaches have been proposed to solve the TSP …

Ant colony optimization (ACO) is a heuristic algorithm which has been proven a successful
technique and applied to a number of combinatorial optimization problems and is taken as …

As a typical representative of the NP-complete problem, the traveling salesman problem
(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this …

This paper presents a novel two-stage hybrid swarm intelligence optimization algorithm
called GA–PSO–ACO algorithm that combines the evolution ideas of the genetic algorithms …