In a bee colony, bees perform waggle dance in order to communicate the information of food
source to their hive mates. This foraging behaviour has been adapted in a bee colony …

Many real world industrial applications involve the Traveling Salesman Problem (TSP),
which is a problem that finds a Hamiltonian path with minimum cost. Examples of problems …

This paper presents a novel hybrid artificial bee colony algorithm (ABC&PR) to solve the
traveling salesman problem (TSP). The main feature of this hybrid algorithm is to hybridize …

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 …

This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling
salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a …

This paper presents a modified bee colony optimization (BCO) by pattern reduction to
reduce the computation time, called BCOPR. Although BCO was robustness optimization …

By combining the modified nearest neighbor approach and the improved inver-over
operation, an Artificial Bee Colony (ABC) Algorithm for Traveling Salesman Problem (TSP) is …

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 …

In this research paper, Artificial Bee Colony algorithm is modified with multiple update rules
and K-opt operation to solve the Traveling Salesman Problem. Here the features of swap …

Artificial bee colony (ABC) is a quite popular optimization approach that has been used in
many fields, with its not only standard form but also improved versions. In this paper, new …