Abstract: The Traveling Salesman Problem (TSP) is a challenging combinatorial optimization problem classified as NP-hard. This paper investigates the performance of various meta-heuristic algorithms, ...
Abstract: In the realm of combinatorial optimization, the Multiple Traveling Salesman Problem (MTSP) presents a unique challenge by requiring optimal routes for multiple salesmen. This study ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback