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 …

Abstract The Artificial Bee Colony (ABC) technique is a highly effective method of
optimization inspired by the behavior of bees. Notably, the importance of the ABC algorithm …

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 …

Aiming at the problems of slow convergence speed, low solution quality, and easily falling
into a local optimum in solving traveling salesman problem (TSP) with genetic algorithm …

Multiple traveling salesmen problem (MTSP) is not only a generalization of the traveling
salesman problem (TSP), but also more suitable for modeling practical problems in the real …

Abstract Traveling Salesman Problem (TSP) is an intricate discrete hybrid optimization
problem that is categorized as an NP‐Hard problem. The objective of the TSP is to find the …

Trackless rubber-tyerd vehicles are the core equipment for auxiliary transportation in
inclined-shaft coal mines, and the rationality of their routes plays the direct impact on …

ABSTRACT Travelling Salesman Problem (TSP) is a discrete hybrid optimization problem
considered NP-hard. TSP aims to discover the shortest Hamilton route that visits each city …

Harri's Hawk Optimization (HHO) algorithm manifests as a new meta-heuristic algorithm in
literature. When we look at studies that have used with this algorithm, we can see that its …

The paper gives an optimization model named multiple bottleneck traveling salesmen
problem (MBTSP), which can model the optimization problems where there are multiple …