Skip to content

PrajitaB/TripRoutePlanning

Repository files navigation

Multi-city Trip Route Planner

  • Focusing on time and expenses built an optimized tour planning model.
  • Used Knapsack to choose the tourist spots which can be covered within the time and expenses provided.
  • Tried with Dijkstra and Travelling Salesman Problem solving method to find the optimal route through the selected tourist spots so that our time and expenses can be minimized.

About

Developed an optimized tour planning machine which makes a desired tourist spot affordable and within the time constraint.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors