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 …
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 …
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 …
A discrete artificial bee colony algorithm for TSP problem
L Li, Y Cheng, L Tan, B Niu - … , ICIC 2011, Zhengzhou, China, August 11 …, 2012 - Springer
In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric
traveling salesman problem (TSP). The concept of Swap Operator has been introduced to …
traveling salesman problem (TSP). The concept of Swap Operator has been introduced to …
Multi-objective traveling salesman problem: an ABC approach
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) Artificial Bee Colony (ABC) algorithm is modified to …
A combinatorial artificial bee colony algorithm for traveling salesman problem
D Karaboga, B Gorkemli - 2011 International Symposium on …, 2011 - ieeexplore.ieee.org
Traveling Salesman Problem is an important optimization issue of many fields such as
transportation, logistics and semiconductor industries and it is about finding a Hamiltonian …
transportation, logistics and semiconductor industries and it is about finding a Hamiltonian …
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 …
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
This paper introduces a new hybrid algorithmic nature inspired approach based on Honey
Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman …
Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman …