The Traveling Salesman Problem (TSP) is a well-known problem in optimization, where the objective is to find the shortest route to visit all cities and return to the starting point. This project ...
The goal of this project was to compare different optimization algorithms on solving the Traveling Salesperson Problem. We compiled a set of 29 traveling salesperson problems with a maxmimum size of ...
Abstract: In order to solve the TSP problem with large scale and high complexity, the Beam-PSO hybrid optimization algorithm was constructed based on the framework of the standard particle swarm ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results