An artificial bee colony algorithm with a modified choice function for the traveling salesman problem
Abstract The Artificial Bee Colony (ABC) algorithm is a swarm intelligence approach which
has initially been proposed to solve optimisation of mathematical test functions with a unique …
has initially been proposed to solve optimisation of mathematical test functions with a unique …
A swap sequence based artificial bee colony algorithm for traveling salesman problem
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 …
and K-opt operation to solve the Traveling Salesman Problem. Here the features of swap …
Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem
Y Zhong, J Lin, L Wang, H Zhang - Information Sciences, 2017 - Elsevier
Artificial bee colony (ABC) algorithm, which has explicit strategies to balance intensification
and diversification, is a smart swarm intelligence algorithm and was first proposed for …
and diversification, is a smart swarm intelligence algorithm and was first proposed for …
Solving traveling salesman problem by using combinatorial artificial bee colony algorithms
D Karaboga, B Gorkemli - International Journal on Artificial …, 2019 - World Scientific
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 …
many fields, with its not only standard form but also improved versions. In this paper, new …
Bee colony optimization with local search for traveling salesman problem
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 …
which is a problem that finds a Hamiltonian path with minimum cost. Examples of problems …
Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem
X Dong, Q Lin, M Xu, Y Cai - IET Intelligent Transport Systems, 2019 - Wiley Online Library
Coloured travelling salesman problem (CTSP) is an extended model of multiple travelling
salesman problems (MTSPs), as one kind of problem in combination optimisation problems …
salesman problems (MTSPs), as one kind of problem in combination optimisation problems …
An efficient bee colony optimization algorithm for traveling salesman problem using frequency-based pruning
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 …
source to their hive mates. This foraging behaviour has been adapted in a bee colony …
The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem
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 …
colonies, was introduced by Karaboğa for numerical function optimization. The basic ABC …
A bee colony optimization algorithm for traveling salesman problem
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 …
presented in this paper. The BCO model is constructed algorithmically based on the …
A hyper-heuristic based artificial bee colony algorithm for k-interconnected multi-depot multi-traveling salesman problem
This paper addresses a newly introduced variant of traveling salesman problem, viz. k-
Interconnected Multi-Depot Multi-Traveling Salesman Problem (k-IMDMTSP). This problem …
Interconnected Multi-Depot Multi-Traveling Salesman Problem (k-IMDMTSP). This problem …