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 …

Abstract The Travelling Salesman Problem (TSP) is an NP-hard problem with high number
of possible solutions. The complexity increases with the factorial of n nodes in each specific …

Abstract Traveling Salesman Problem (TSP) has been seen in diverse applications, which is
proven to be NP-complete in most cases. Even though there are multiple heuristic …

The travelling salesman problem (TSP) is a nondeterministic Polynomial hard problem in
combinatorial optimization studied in operations research and theoretical computer science …

Combinatorial optimization problems operate on a set of problems, which have a range of
feasible solutions either discrete in nature or can be minimized to discrete. The primary …

This article presents a new modified version of the ant colony optimization (ACO) mixed with
insert, swap and 2-opt algorithm called NMACO for solving the multiple traveling salesman …

This research paper presents an adaptation of the cat swarm optimization (CSO) to solve the
traveling salesman problem (TSP). This evolutionary algorithm appeared in 2007 by Chu …

In this paper, we show a survey of meta-heuristics algorithms based on grouping of animals
by social behavior for the Traveling Salesman Problem, and propose a new classification of …

The traveling salesman problem (TSP) is one of the most widely studied NP-hard
combinatorial optimization problems and traditional genetic algorithm trapped into the local …

The traveling salesman problem (TSP) is one of the classical combinatorial optimization
problems and has wide application in various fields of science and technology. In the …