How sumitjotrao/travelling_salesman_problem works
Project type and purpose
• This is a standalone Python-based Travelling Salesman Problem (TSP) solver library/application.
• Purpose: load benchmark TSP instances, pre-process them, then solve via exact (integer programming) and approximate (heuristic) algorithms.
File structure
• Root scripts
– TSP.py → main entrypoint/CLI wrapper
– data_processing.py → routines to parse/clean raw instance files
• algorithms/
– Integer_programming_model.py → exact solver using MIP
– (you would likely add other modules here for heuristics)
• data/
– dozens of “tsp_<n>_<id>” files → raw instance datasets from Coursera discrete optimization course
• .gitignore, README.md
README for additional insights
• Confirms two solver categories: exact and approximate.
• Problem instances sourced externally (data directory).
Detailed capture of essential elements
• Don’t omit the Data Processing step—raw files must be parsed.
• Explicitly show external solver dependency separate from your code.
• Your main script (TSP.py) as orchestrator, not just a passive wrapper.