A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems
The ABC algorithm is one of the popular optimization algorithms and has been used
successfully in solving many real-world problems. Numeric, binary, integer, mixed integer …
successfully in solving many real-world problems. Numeric, binary, integer, mixed integer …
Nature-inspired metaheuristic techniques for combinatorial optimization problems: Overview and recent advances
Combinatorial optimization problems are often considered NP-hard problems in the field of
decision science and the industrial revolution. As a successful transformation to tackle …
decision science and the industrial revolution. As a successful transformation to tackle …
Discrete sparrow search algorithm for symmetric traveling salesman problem
Z Zhang, Y Han - Applied Soft Computing, 2022 - Elsevier
The traveling salesman problem (TSP) is one of the most intensively studied problems in
computational mathematics. This paper proposes a swarm intelligence approach using a …
computational mathematics. This paper proposes a swarm intelligence approach using a …
A hybrid algorithm based on state-adaptive slime mold model and fractional-order ant system for the travelling salesman problem
The ant colony optimization (ACO) is one efficient approach for solving the travelling
salesman problem (TSP). Here, we propose a hybrid algorithm based on state-adaptive …
salesman problem (TSP). Here, we propose a hybrid algorithm based on state-adaptive …
An efficient harris hawk optimization algorithm for solving the travelling salesman problem
FS Gharehchopogh, B Abdollahzadeh - Cluster Computing, 2022 - Springer
Abstract Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
[HTML][HTML] Adaptive ant colony optimization with node clustering applied to the travelling salesman problem
This article presents the Ant Colony Optimization algorithm to solve the Travelling Salesman
Problem. The proposed algorithm implements three novel techniques to enhance the overall …
Problem. The proposed algorithm implements three novel techniques to enhance the overall …
A dynamical artificial bee colony for vehicle routing problem with drones
D Lei, Z Cui, M Li - Engineering Applications of Artificial Intelligence, 2022 - Elsevier
Truck-drone hybrid delivery is a hybrid one combining the advantages including large
capacity of truck and high travel speed of drone together. Vehicle routing problem with …
capacity of truck and high travel speed of drone together. Vehicle routing problem with …
An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop
This paper addresses a new multiple automatic guided vehicle dispatching problem
(AGVDP) from material handling process in a matrix manufacturing workshop. The problem …
(AGVDP) from material handling process in a matrix manufacturing workshop. The problem …
A novel design of differential evolution for solving discrete traveling salesman problems
Differential evolution is one of the most powerful and popular evolutionary algorithms, which
is primarily used to solve continuous-based optimization problems. Although differential …
is primarily used to solve continuous-based optimization problems. Although differential …
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 …