Parameter adaptation-based ant colony optimization with dynamic hybrid mechanism

X Zhou, H Ma, J Gu, H Chen, W Deng - Engineering Applications of …, 2022 - Elsevier
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 …

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 …

A hybrid algorithm based on state-adaptive slime mold model and fractional-order ant system for the travelling salesman problem

X Gong, Z Rong, J Wang, K Zhang, S Yang - Complex & Intelligent …, 2023 - Springer
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 …

A Quantum-inspired Ant Colony Optimization for solving a sustainable four-dimensional traveling salesman problem under type-2 fuzzy variable

M Das, A Roy, S Maity, S Kar - Advanced Engineering Informatics, 2023 - Elsevier
In this paper, a Quantum-inspired Ant Colony Optimization (Qi-ACO) is proposed to solve a
sustainable four-dimensional traveling salesman problem (4DTSP). In 4DTSP, various paths …

[HTML][HTML] Adaptive ant colony optimization with node clustering applied to the travelling salesman problem

P Stodola, P Otřísal, K Hasilová - Swarm and Evolutionary Computation, 2022 - Elsevier
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 …

A novel sparrow search algorithm for the traveling salesman problem

C Wu, X Fu, J Pei, Z Dong - IEEE Access, 2021 - ieeexplore.ieee.org
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 …

Discrete Mayfly Algorithm for spherical asymmetric traveling salesman problem

T Zhang, Y Zhou, G Zhou, W Deng, Q Luo - Expert Systems with …, 2023 - Elsevier
Abstract The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling
salesman problem, aims to find a group of circuits when a salesman travels all cities at the …

Heuristic smoothing ant colony optimization with differential information for the traveling salesman problem

W Li, C Wang, Y Huang, Y Cheung - Applied Soft Computing, 2023 - Elsevier
The traveling salesman problem (TSP) is an NP complete problem with potential
applications. Thus far, numerous approaches have been proposed to solve the TSP …

Adaptive ant colony optimization with node clustering for the multidepot vehicle routing problem

P Stodola, J Nohel - IEEE Transactions on Evolutionary …, 2022 - ieeexplore.ieee.org
This article deals with the novel metaheuristic algorithm based on the ant colony
optimization (ACO) principle. It implements several novel mechanisms that improve its …

An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect

Z Zhang, X Song, X Gong, Y Yin, B Lev… - International Journal of …, 2023 - Taylor & Francis
This paper is concerned with the scheduling problem in a new-type seru production system
by consideration of DeJong's learning effect to minimise the total weighted completion time …