Downloads: 123
Research Paper | Computer Science Engineering | Volume 4 Issue 1, January 2015 | Pages: 2368 - 2371 | India
Automated Travel Itineraries using Hadoop
Abstract: Nowadays travel and tourism activities are becoming increasingly needed to provide travelers with real time information to assist them in itinerary planning. In other words traveler needi) Customized itinerary plans according to their needs and preferences, ii) Timely availability and accuracy should be there. This system will provide decision support to user on the basis ofi) Access to real time and dynamically updated information, ii) Access to travel and tourism information on the move. , iii) Provision of customized information. The problem of searching customized and cost effective itinerary is a team orienting problem (TOP), well known NP-Complete Problem. Here two stage processing system is designed for lowering cost. In first stage i. e. Preprocessing stage which is offline, single day itineraries are precomputed via MapReduce jobs. In second phase which is online, an approximate search is used to obtain multiple day itineraries by combining multiple single day itineraries. In this way a team orienteering problem is converted into Set-Packing another NP-Complete Problem.
Keywords: Itinerary Planning, team orienteering problem TOP, Map reduce, set-packing
How to Cite?: Pallavi S. Ghogare, Harmeet Khanuja, "Automated Travel Itineraries using Hadoop", Volume 4 Issue 1, January 2015, International Journal of Science and Research (IJSR), Pages: 2368-2371, https://www.ijsr.net/getabstract.php?paperid=SUB15868, DOI: https://dx.doi.org/10.21275/SUB15868