ABSTRACT. To compensate for the shortcomings of existing methods used in TSP (Traveling Salesman Problem), such as the accuracy of solutions and the scale ...
We test the algorithm with Traveling Salesman Problem with 14 nodes and 30 nodes. The result shows that the algorithm can break away from local minimum earlier ...
This paper presents a novel two-stage hybrid swarm intelligence optimization algorithm called GA–PSO–ACO algorithm that combines the evolution ideas of the ...
Abstract: An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed.
An improved particle swarm optimization algorithm is proposed in this paper. The algorithm draws on the thinking of the greedy algorithm to initialize the ...
Sep 18, 2021 · This paper presents a competitive Particle Swarm Optimization algorithm for the Traveling Salesman Problem, where the velocity operator is based ...
Simulation results show that the proposed method with good stability can effectively reduce the error rate and improve the solution precision while ...
Secondly, PSO is then applied to improve the searching result and speed. Travelling salesman problem was experimented as well as the objective function ...
People also ask
What is improved particle swarm optimization?
Which is the best suitable algorithm for travelling salesman problem?
What is the best way to solve the travelling salesman problem?
What is the traveling salesman problem in optimization techniques?
This paper studies a transfer learning-based particle swarm optimization (PSO) algorithm, where the optimal information of historical problems is used to guide ...
May 23, 2021 · This work presents a novel Best-Worst Ant System (BWAS) based algorithm to settle the Traveling Salesman Problem (TSP).