New Heuristic to Optimize the Travelling Salesman Problem
Souhail Dhouib
Published: December 03, 2021
Abstract
One of the fundamental combinatorial problems is the Travelling Salesman Problem (TSP) where a salesman is invited to visit all cities with the cheapest cycle. To solve this problem, we designed in [1] a new column row heuristic entitled Dhouib-Matrix-TSP1 (DMTSP1).