Sprint 1: The motivating problem of tourism logistics and the general structure of the DSS tailored to solve them
Sprint 2: Building a prototype mathematical model for the minimum valuable problem of trip planning: the TSP
Sprint 3: Implementing the prototype model in Python and analyzing its outputs
Sprint 4: Creating a mechanism to deduce distances from locations, as a dependency for generating generic solutions to arbitrary TSPs
Sprint 5: Designing and coding an optimizer class integrating the model prototype and the distance matrix generator developed before, to seamlessly solve any TSP
Sprint 6: Creating interactive maps to visualize the optimal tours produced by the TSP Optimizer developed before