Heuristic computational intelligence techniques are widely used in combinatorial
optimization problems, essentially in large size configurations. Bio-inspired heuristics such …

In this paper, a parameter adaptation-based ant colony optimization (ACO) algorithm based
on particle swarm optimization (PSO) algorithm with the global optimization ability, fuzzy …

Traveling salesman problem (TSP) is one typical combinatorial optimization problem. Ant
colony optimization (ACO) is useful for solving discrete optimization problems whereas the …

This paper capitalizes on the increasingly high relevance gained by data-intensive
technologies in the development of intelligent transportation system, which calls for the …

Abstract Grey Wolf Optimizer (GWO) is a recently developed population-based metaheuristic
algorithm which imitates the behaviour of grey wolves for survival. Initially, GWO was …

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 …

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 …

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 …

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 …

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 …