This paper involves Bee Colony Optimization for travelling salesman problem. The ABC
optimization is a population-based search algorithm which applies the concept of social …

This paper presents a new variant of Ant Colony Optimization (ACO) for the Traveling
Salesman Problem (TSP). ACO has been successfully used in many combinatorial …

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

Swarm Intelligence algorithms are computational intelligence algorithms inspired from the
collective behavior of real swarms such as ant colony, fish school, bee colony, bat swarm …

The travelling salesman problem (TSP) is one of the well-known NP-hard combinatorial
optimization and extensively studied problems in discrete optimization. The bat algorithm is …

Using the concept of swap operation and swap sequence on the sequence of paths of a
Traveling Salesman Problem (TSP) Artificial Bee Colony (ABC) algorithm is modified to …

Traveling salesman problem (TSP) is one typical combinatorial optimization problem. Ant
colony optimization (ACO) is useful for solving discrete optimization problems whereas the …

Bat algorithm is a swarm-intelligence-based metaheuristic proposed in 2010. This algorithm
was inspired by echolocation behavior of bats when searching their prey in nature. Since it …

The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient
stagnation when applied to the traveling salesman problem (TSP). To address this issue, we …

This paper introduces three new heuristics for the Euclidean Traveling Salesman Problem
(TSP). One of the heuristics called Initialization Heuristics (IH) is applicatbe only to the …