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 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 …

The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient
stagnation when applied to the traveling salesman problem (TSP). To address this issue, we …

Jaya algorithm is a newly proposed stochastic population-based metaheuristic optimization
algorithm to solve constrained and unconstrained continuous optimization problems. The …

This study addresses flexible job shop scheduling problem (FJSP) with two constraints,
namely fuzzy processing time and new job insertion. The uncertainty of processing time and …

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 …

Tree-Seed algorithm (TSA) is a recently developed nature inspired population-based
iterative search algorithm. TSA is proposed for solving continuous optimization problems by …

Abstract Traveling Salesman Problem (TSP) has been seen in diverse applications, which is
proven to be NP-complete in most cases. Even though there are multiple heuristic …

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 …

As one suitable optimization method implementing computational intelligence, ant colony
optimization (ACO) can be used to solve the traveling salesman problem (TSP). However …