Issue No. 03 - March (2014 vol. 26)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.46
Gang Chen , Zhejiang University, China
Sai Wu , Zhejiang University, China
Jingbo Zhou , National University of Singapore, Singapore
Anthony K.H. Tung , National University of Singapore, Singapore
Creating an efficient and economic trip plan is the most annoying job for a backpack traveler. Although travel agency can provide some predefined itineraries, they are not tailored for each specific customer. Previous efforts address the problem by providing an automatic itinerary planning service, which organizes the points-of-interests (POIs) into a customized itinerary. Because the search space of all possible itineraries is too costly to fully explore, 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 limitation, in this paper, we design a more general itinerary planning service, which generates multiday itineraries for the users. In our service, all POIs are considered and ranked based on the users' preference. The problem of searching the optimal itinerary is a team orienteering problem (TOP), a well-known NP-complete problem. To reduce the processing cost, a two-stage planning scheme is proposed. In its preprocessing stage, single-day itineraries are precomputed via the MapReduce jobs. In its online stage, an approximate search algorithm is used to combine the single day itineraries. In this way, we transfer the TOP problem with no polynomial approximation into another NP-complete problem (set-packing problem) with good approximate algorithms. Experiments on real data sets show that our approach can generate high-quality itineraries efficiently.
Indexes, Planning, Approximation algorithms, Context, NP-complete problem, Vehicles
G. Chen, S. Wu, J. Zhou and A. K. Tung, "Automatic Itinerary Planning for Traveling Services," in IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. 3, pp. 514-527, 2014.