International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056 Volume: 02 Issue: 02 | May-2015 www.irjet.net p-ISSN: 2395-0072 © 2015, IRJET.NET- All Rights Reserved Page 108 EFFICIENT MULTIUSER ITINERARY PLANNING FOR TRAVELLING SERVICES USING FKM-CLUSTERING ALGORITHM R.Rajeswari 1 , J. Mannar Mannan 2 1 III-M.tech(IT) , Department of Information technology, Regional Centre, Anna University, Coimbatore, India 2 Teaching Assistant, Department of Information technology, Regional Centre, Anna University, Coimbatore, India ---------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - This paper proposes, previous efforts address the problem by providing an automatic itinerary planning service that organizes the points-of- interests (POIs) into a customized itinerary. The search space of all possible itineraries is too costly to fully visit, to simplify the complexity, most work assume that user’s trip is limited to some important POIs and will complete within one day. To address the above Problem, design a more general automatic itinerary planning service, this generates multiday itineraries for the users. All POIs are considered and ranked based on the user’s preference. Since the many users are planning for a trip with various requirements then their search complexity is increased. To overcome this limitation using the concept of grouping or clustering the users based on user’s requirement similarity. The novel modified clustering is using for grouping the user according to their requirement similarity. The membership values are defined for clustering process and it’s based on the users. It is used to reduce the search complexity as well as time complexity of the system. Key Words: POI, Grouping Clustering, Itinerary 1. Introduction Transportation systems have played an important role in real applications such as the traffic control, location-based services (LBS), trip planning, and geographical data management. One typical example of such systems is the European Traffic Message Channel (TMC), which has been operated in many European countries, North America, and Australia. With the increasing interest in the management of transportation systems, recently, the spatial road network has received much attention from the database community. Specifically, a spatial road network can be modeled by a large graph in a 2-dimensional geographical space whose edges correspond to road segments, and are associated with weights related to the traffic information (e.g., road-network distance, speed of vehicles, or the delay time). Over such road networks, a wide spectrum of practical problems have been extensively studied, including range queries, k-nearest neighbor (kNN) queries, reverse nearest neighbor queries, shortest path queries, multi-source skyline queries and so on. Traveling market is divided into two parts. For casual customers, they will pick a package from local travel agents. The package, in fact, represents a pre- generated itinerary. The agency will help the customer book the hotels, arrange the transportations, and preorder the tickets of museums/parks. It prevents the customers from constructing their personalized itineraries, which is very time consuming and inefficient. For instance, a four- day package to Hong Kong provided by a Singapore agency is covers the most popular POIs for a first-time traveler. Although the travel agencies provide efficient and convenient services, for experienced travelers, the itineraries provided by the travel agents lack customization and cannot satisfy individual requirements. Some interested POIs are missing in the itineraries and the packages are too expensive for a backpack traveler. Therefore, they have to plan their trips in every detail, such as selecting the hotels, picking POIs for visiting, and contacting the car rental service. First, current planning algorithms only consider a single dayǯs trip, while in real cases, most users will schedule an n-day itinerary. Generating an n-day itinerary is more complex than generating a single day one. It is not equal to constructing single-day itineraries and combining them together, as a POI can only appear once in the itinerary. It is tricky to group POIs into different days. One possible solution is to exploit the geo-locations, for example, nearby PO)s are put in the same dayǯs itinerary. Alternatively, it can also rank POIs by their importance and use a priority queue to schedule the trip. Second, the travel agents tend to favor the popular POIs. Even for a city with a large number of POIs, the travel agents always provide the same set of trip plans, composed with top POIs. However, those popular POIs may not be attractive for the users, who have visited the city for several times or have limited time budget. It is impossible for a user to get his personal trip plan. The travel agentǯs service cannot cover the whole PO) set, leading to few choices for the users. In our algorithm, we adopt a different approach by giving high priorities to the selected POIs and generating a customized trip plan on the fly.