Back to projects

$ open traveling-salesperson

Traveling Salesperson

University Algorithms Project / 2024

Traveling Salesperson was one of my earlier algorithm-focused projects in university. I built it as a WPF desktop application where cities are plotted on a map, distances are calculated from their coordinates, and the selected route can be solved with a dynamic-programming approach instead of manual path drawing.

overview.md

An algorithm project that turned a classic optimization problem into an interactive desktop tool.

The app loads city coordinates from JSON, renders them as clickable points on a world map, and lets the user choose a starting city before running a Held-Karp style dynamic-programming solution for TSP. What I like about this project is that it connects the theory from algorithms class to something visual and testable: graph modeling, distance-matrix generation, recursion with memoization, and a simple UI that makes the problem easier to explore.

outcomes.log

  • Built an interactive desktop interface for exploring the traveling salesperson problem visually
  • Implemented a Held-Karp style dynamic-programming solution with memoization for route optimization
  • Modeled cities as graph vertices and generated weighted edges from Euclidean distance calculations
  • Loaded map markers from JSON and connected algorithm output to a simple WPF visualization