Automatic Itinerary Planning for Traveling Service Based on Budget using Spatial Datamining with Hadoop

To plan effective and economic successful trip is a very big challenge for a traveler. Even-though the travel agency can provide some arrangements for customer as per there schedule. But most of the customer will not satisfy there predefined itinerary. Existing system provides the automatic itinerary planning, which assumes the point of interest. In the previous system there are two stages to reduce the processing cost. In which offline stage for one day itineraries are pre-computed using map reduced and online stage for those one day itineraries are combined using a search algorithm. In our paper we consider the multi-day itinerary using nearest neighbor chain algorithm with budget based technique to get geographical information from spatial database and store the planed trip using Hadoop and also to reduce the complexity for a successful and satisfied trip for customer.