- 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.
PrajitaB/TripRoutePlanning
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|