IEEE

Travelling Salesman Problem in the Classical to Quantum Era: A Comparative Review of ...

Abstract: The Travelling Salesman Problem (TSP) asks for the shortest tour that visits each city once and returns to the start. It is a classic NP-hard problem and a benchmark for optimization, ...
IEEE

Discrete Starfish Optimization Algorithm for Symmetric Travelling Salesman Problem

Abstract: This paper introduces a new discrete StarFish Optimization Algorithm (D-SFOA) to solve a complex discrete Symmetric Travelling Salesman Problem (STSP). The discrete SFOA algorithm is ...