Abstract: The Traveling Salesman Problem (TSP) is a fundamental combinatorial optimization problem that remains challenging due to its $\mathcal{N}\mathcal{P}$-hard nature. Metaheuristic Algorithms ...

Abstract: Metaheuristic algorithms have demonstrated strong effectiveness in solving complex real-world optimization problems. This paper presents two discrete metaheuristic approaches for the ...