The Travelling Salesman Problem TSP consists of finding the shortest path that permits visiting all destinations exactly once and returning to the starting point. In this Moroccan TSP, the objective is to visit the 1538 Moroccan communes.
Practical TSP applications include scheduling, pickup and delivery tours, 3D printer routes, DNA sequencing, etc.
Anyone interested in the TSP issue is invited to participate
The trophy for the best tour found each year will be awarded on the 3rd Saturday of April
(Submissions end by: april 15, 2024)
For any remark, inquiry, or suggestion, don’t hesitate to get in touch with m.elalaoui@usms.ma
