# travel-itinerary-recommendation

This code is about generating a multi-day travel itinerary recommendation using TSP (Traveling Salesman Problem) and VRP (Vehicle Routing Problem) approaches.
Several optimization algorithms are implemented in this code, such as:
- Genetic Algorithm (GA)
- Tabu Search (TS)
- Simulated Annealing (SA)
- Ant Colony System (ACS)
- Ant Colony Optimization (ACO)
- Branstorm Optimization (BSO)
- Hybrid Ant Colony System and Brainstorm Optimization (Hybrid ACS-BSO)
- Hybrid Ant Colony Optimization (HACO)
- Discrete Komodo Mlipir Algorithm (DKA)

Code for each optimization algorithm can be found in **Optimization** folder (the code is in .py format)

Code for results analysis can be found in Results_analysis.ipynb file (open with Jupyter Notebook)

We use the POIs and hotels in Yogyakarta as the dataset of this project obtained from Google Maps API and SerpAPI

For more detailed information please check our paper in https://inass.org/wp-content/uploads/2023/12/2024043020-2.pdf

Please cite to our paper if you use any information from this repository
