An Innovative Tour Recommendation System using Graph Algorithms
Background: Tour recommendation and path planning are the most challenging jobs for tourists as they decide Points of Interest (POI). Objective: To reduce the physical effort of the tourists and recommend them a personalized tour is the main objective of this paper. Most of the time people had to f...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Airlangga
2019-04-01
|
| Series: | Journal of Information Systems Engineering and Business Intelligence |
| Subjects: | |
| Online Access: | https://e-journal.unair.ac.id/JISEBI/article/view/11808 |
| _version_ | 1827998570863656960 |
|---|---|
| author | Md. Sabir Hossain Ahsan Sadee Tanim Nabila Nawal Sharmin Akter |
| author_facet | Md. Sabir Hossain Ahsan Sadee Tanim Nabila Nawal Sharmin Akter |
| author_sort | Md. Sabir Hossain |
| collection | DOAJ |
| description | Background: Tour recommendation and path planning are the most challenging jobs for tourists as they decide Points of Interest (POI).
Objective: To reduce the physical effort of the tourists and recommend them a personalized tour is the main objective of this paper. Most of the time people had to find the places he wants to visit in a difficult way. It kills a lot of time.
Methods: To cope with this situation we have used different methodology. First, a greedy algorithm is used for filtering the POIs and BFS (Breadth First Search) algorithm will find POI in terms of user interest. The maximum number of visited POI within a limited time will be considered. Then, the Dijkstra algorithm finds the shortest path from the point of departure to the end of tours.
Results: This work shows its users list of places according to the user's interest in a particular city. It also suggests them places to visit in a range from the location of the user where a user can dynamically change this range and it also suggests nearby places they may want to visit.
Conclusion: This tour recommendation system provides its users with a better trip planning and thus makes their holidays enjoyable. |
| first_indexed | 2024-04-10T05:45:15Z |
| format | Article |
| id | doaj.art-567745e094f144949ba4e796fe33f1cd |
| institution | Directory Open Access Journal |
| issn | 2598-6333 2443-2555 |
| language | English |
| last_indexed | 2024-04-10T05:45:15Z |
| publishDate | 2019-04-01 |
| publisher | Universitas Airlangga |
| record_format | Article |
| series | Journal of Information Systems Engineering and Business Intelligence |
| spelling | doaj.art-567745e094f144949ba4e796fe33f1cd2023-03-06T02:56:32ZengUniversitas AirlanggaJournal of Information Systems Engineering and Business Intelligence2598-63332443-25552019-04-0151323910.20473/jisebi.5.1.32-399483An Innovative Tour Recommendation System using Graph AlgorithmsMd. Sabir HossainAhsan Sadee TanimNabila NawalSharmin AkterBackground: Tour recommendation and path planning are the most challenging jobs for tourists as they decide Points of Interest (POI). Objective: To reduce the physical effort of the tourists and recommend them a personalized tour is the main objective of this paper. Most of the time people had to find the places he wants to visit in a difficult way. It kills a lot of time. Methods: To cope with this situation we have used different methodology. First, a greedy algorithm is used for filtering the POIs and BFS (Breadth First Search) algorithm will find POI in terms of user interest. The maximum number of visited POI within a limited time will be considered. Then, the Dijkstra algorithm finds the shortest path from the point of departure to the end of tours. Results: This work shows its users list of places according to the user's interest in a particular city. It also suggests them places to visit in a range from the location of the user where a user can dynamically change this range and it also suggests nearby places they may want to visit. Conclusion: This tour recommendation system provides its users with a better trip planning and thus makes their holidays enjoyable.https://e-journal.unair.ac.id/JISEBI/article/view/11808personalized tourtouriststrip planningtour recommendationuser's interest |
| spellingShingle | Md. Sabir Hossain Ahsan Sadee Tanim Nabila Nawal Sharmin Akter An Innovative Tour Recommendation System using Graph Algorithms Journal of Information Systems Engineering and Business Intelligence personalized tour tourists trip planning tour recommendation user's interest |
| title | An Innovative Tour Recommendation System using Graph Algorithms |
| title_full | An Innovative Tour Recommendation System using Graph Algorithms |
| title_fullStr | An Innovative Tour Recommendation System using Graph Algorithms |
| title_full_unstemmed | An Innovative Tour Recommendation System using Graph Algorithms |
| title_short | An Innovative Tour Recommendation System using Graph Algorithms |
| title_sort | innovative tour recommendation system using graph algorithms |
| topic | personalized tour tourists trip planning tour recommendation user's interest |
| url | https://e-journal.unair.ac.id/JISEBI/article/view/11808 |
| work_keys_str_mv | AT mdsabirhossain aninnovativetourrecommendationsystemusinggraphalgorithms AT ahsansadeetanim aninnovativetourrecommendationsystemusinggraphalgorithms AT nabilanawal aninnovativetourrecommendationsystemusinggraphalgorithms AT sharminakter aninnovativetourrecommendationsystemusinggraphalgorithms AT mdsabirhossain innovativetourrecommendationsystemusinggraphalgorithms AT ahsansadeetanim innovativetourrecommendationsystemusinggraphalgorithms AT nabilanawal innovativetourrecommendationsystemusinggraphalgorithms AT sharminakter innovativetourrecommendationsystemusinggraphalgorithms |