Abstract: The Travelling Salesman Problem (TSP) is a well known method for the optimisation problem that asks you to find the shortest route that visits each city in a set exactly once and then goes ...

We spend a lot of time thinking about the difficult people in our lives—the friend who can't take feedback, the partner who always has to be right, the coworker who turns everything into a fight. But ...

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 ...