2025 Edition

TSP

Localities

Join the challange
Read More

The second travelling salesman problem of the 2nd edition of the Moroccan TSP Competition involves finding the shortest path that visits 12289 Moroccan localities (cities, towns, villages and hamlets) and returns to the starting point. The localities are represented by their longitudes and latitudes.

Data set Download File

To participate, fill in the attached Excel file with the visiting order
Excel Link and complete the form below.

Fields with an asterisk (*) are mandatory.

Instructions

  • The file must be in Excel format. Other formats are not supported.
  • Visiting orders must be integers. Ensure all values are whole numbers.
  • Each visiting order must be unique. Make sure there are no duplicates.
  • All visiting orders must be present. Check that none are missing.
  • Visiting orders must be within the range of 1 to 12289. Verify that all values fall within this range.
  • If all the above conditions are met, the total distance will be calculated and displayed.
  • Files must be submited before 13th April 2025
File Upload
Please enable JavaScript in your browser to complete this form.
Click or drag a file to this area to upload.
Import your file (.xls, .xlsx)

Instructions:

  • Only Excel files (.xls, .xlsx) are allowed.
  • Visiting orders must be unique integers (1-12289).
  • Ensure no missing or duplicate values.
  • Total distance will be calculated if conditions are met.