Artificial bee Colony algorithm (ABC) is a population based heuristic search technique used
for optimization problems. ABC is a very effective optimization technique for continuous …

A bee colony optimization (BCO) algorithm for traveling salesman problem (TSP) is
presented in this paper. The BCO model is constructed algorithmically based on the …

The purpose of this paper is to present a new hierarchic method based on swarm
intelligence algorithms for solving the well-known traveling salesman problem. The swarm …

Travelling salesman problem (TSP) is one of the optimization problems which has been
studied with a large number of heuristic and metaheuristic algorithms, wherein swarm and …

The artificial bee colony (ABC) algorithm, inspired intelligent behaviors of real honey bee
colonies, was introduced by Karaboğa for numerical function optimization. The basic ABC …

Coloured travelling salesman problem (CTSP) is an extended model of multiple travelling
salesman problems (MTSPs), as one kind of problem in combination optimisation problems …

Jaya algorithm is a newly proposed stochastic population-based metaheuristic optimization
algorithm to solve constrained and unconstrained continuous optimization problems. The …

Abstract Traveling Salesman Problem (TSP) is the combinatorial optimization problem,
where a salesman starting from a home city travels all the other cities and returns to the …

This paper introduces a new hybrid algorithmic nature inspired approach based on Honey
Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman …

An optimization problem is a problem of finding the best solution from all possible solutions.
In most computer science and mathematical applications, the decision to select the best …