Subscribe

Issue No.03 - March (2014 vol.26)

pp: 514-527

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

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.46

ABSTRACT

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.

INDEX TERMS

Indexes, Planning, Approximation algorithms, Context, NP-complete problem, Vehicles,location-based service, Map reduce, trajectory, team orienteering problem, itinerary planning

CITATION

Gang Chen, Sai Wu, Jingbo Zhou, Anthony K.H. Tung, "Automatic Itinerary Planning for Traveling Services",

*IEEE Transactions on Knowledge & Data Engineering*, vol.26, no. 3, pp. 514-527, March 2014, doi:10.1109/TKDE.2013.46REFERENCES

- [1] S. Dunstall, M.E. Horn, P. Kilby, M. Krishnamoorthy, B. Owens, D. Sier, and S. Thiebaux, "An Automated Itinerary Planning System for Holiday Travel,"
Information Technology and Tourism, vol. 6, no. 3, pp. 195-210, 2004.- [2] S.B. Roy, G. Das, S. Amer-Yahia, and C. Yu, "Interactive Itinerary Planning,"
Proc. IEEE 27th Int'l Conf. Data Eng. (ICDE), pp. 15-26, 2011.- [3] I.-M. Chao, B.L. Golden, and E.A. Wasil, "The Team Orienteering Problem,"
European J. Operational Research, vol. 88, no. 3, pp. 464-474, Feb. 1996.- [4] J. Dean and S. Ghemawat, "MapReduce: A Flexible Data Processing Tool,"
Comm. ACM, vol. 53, pp. 72-77, Jan. 2010.- [5] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein,
Introduction to Algorithms, second ed. The MIT Press and McGraw-Hill Book Company, 2001.- [6] C. Archetti, A. Hertz, and M.G. Speranza, "Metaheuristics for the Team Orienteering Problem,"
J. Heuristics, vol. 13, pp. 49-76, Feb. 2007.- [7] P. Vansteenwegen, W. Souffriau, and D.V. Oudheusden, "The Orienteering Problem: A Survey,"
European J. Operational Research, vol. 209, pp. 1-10, Feb. 2011.- [8] M.M. Halldórsson and B. Chandra, "Greedy Local Improvement and Weighted Set Packing Approximation,"
J. Algorithms, vol. 39, pp. 223-240, May 2001.- [9] E.M. Arkin and R. Hassin, "On Local Search for Weighted K-Set Packing,"
Math. Operations Research, vol. 23, pp. 640-648, Mar. 1998.- [10] http:/hadoop.apache.org/, 2013.
- [11] T. Rattenbury, N. Good, and M. Naaman, "Toward Automatic Extraction of Event and Place Semantics from Flickr Tags,"
Proc. 30th Ann. Int'l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR '07), pp. 103-110, 2007.- [12] D.J. Crandall, L. Backstrom, D.P. Huttenlocher, and J.M. Kleinberg, "Mapping the World's Photos,"
Proc. 18th Int'l Conf. World Wide Web (WWW), pp. 761-770, 2009.- [13] M. Clements, P. Serdyukov, A.P. de Vries, and M.J. Reinders, "Using Flickr Geotags to Predict User Travel Behaviour,"
Proc. 33rd Int'l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR), 2010.- [14] C.-H. Tai, D.-N. Yang, L.-T. Lin, and M.-S. Chen, "Recommending Personalized Scenic Itinerary with Geo-Tagged Photos,"
Proc. IEEE Int'l Conf. Multimedia and Expo (ICME), pp. 1209-1212, 2008.- [15] M.D. Choudhury, M. Feldman, S. Amer-Yahia, N. Golbandi, R. Lempel, and C. Yu, "Automatic Construction of Travel Itineraries Using Social Breadcrumbs,"
Proc. 21st ACM Conf. Hypertext and Hypermedia (HT), pp. 35-44, 2010.- [16] H. Yoon, Y. Zheng, X. Xie, and W. Woo, "Smart Itinerary Recommendation Based on User-Generated GPS Trajectories,"
Proc. Seventh Int'l Conf. Ubiquitous Intelligence and Computing (UIC), pp. 19-34, 2010.- [17] I. Hefez, Y. Kanza, and R. Levin, "TARSIUS: A System for Traffic-Aware Route Search under Conditions of Uncertainty,"
Proc. 19th ACM SIGSPATIAL Int'l Conf. Advances in Geographic Information Systems (GIS), pp. 517-520, 2011.- [18] N. Christofides, "Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem," Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon Univ., 1976.
- [19] G. Laporte, "The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms,"
European J. Operational Research, vol. 59, no. 2, pp. 231-247, June 1992.- [20] R. Levin, Y. Kanza, E. Safra, and Y. Sagiv, "Interactive Route Search in the Presence of Order Constraints,"
Proc. VLDB Endowment, vol. 3, no. 1, pp. 117-128, 2010.- [21] W. Souffriau, P. Vansteenwegen, G.V. Berghe, and D.V. Oudheusden, "A Path Relinking Approach for the Team Orienteering Problem,"
Computers and Operations Research, vol. 37, pp. 1853-1859, 2010.- [22] M.V.S.P. de Aragao, H. Viana, and E. Uchoa, "The Team Orienteering Problem: Formulations and Branch-Cut and Price,"
Proc. Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), vol. 14, pp. 142-155, 2010.- [23] F. Chierichetti, R. Kumar, and A. Tomkins, "Max-Cover in Map-Reduce,"
Proc. 19th Int'l Conf. World Wide Web (WWW), pp. 231-240, 2010.- [24] Z. Zhao, G. Wang, A.R. Butt, M. Khan, V.A. Kumar, and M.V. Marathe, "SAHAD: Subgraph Analysis in Massive Networks Using Hadoop,"
IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), 2012. |