IDEAS home Printed from https://ideas.repec.org/a/spr/infott/vyid10.1007_s40558-017-0076-5.html
   My bibliography  Save this article

Recommending a sequence of interesting places for tourist trips

Author

Listed:
  • Wolfgang Wörndl

    (Technical University of Munich (TUM))

  • Alexander Hefele

    (Technical University of Munich (TUM))

  • Daniel Herzog

    (Technical University of Munich (TUM))

Abstract

Tourist trip design problems (TTDP) support tourists in creating trips composed of multiple points of interest (POIs) or other travel-related items. We present a novel approach to generate routes comprising different POIs with a reasonable routing for a short city trip. In our scenario, a user enters a start and an end point in a web application together with preferences and receives a walking route with interesting places to visit along the way. The place discovery is based on retrieving arbitrarily rated places from Foursquare, so it is not restricted to certain cities or regions. The developed scoring mechanism rates the level of interest of a POI and accounts for the number of places per category. Discovered places are then combined to a practical route using a constraint-free and a constraint-based version of our algorithm. The algorithms are based on Dijkstra’s algorithm to find the shortest path in a graph. We show that Dijkstra’s algorithm can be modified to find not only the shortest paths, but also trips that solve the TTDP by maximizing the entertainment for the user while respecting time and budget constraints. The solution has been implemented in a practical web application. We conducted a user study showing that our test users highly accepted the application. Improvement with regard to user preferences for place categories lead to additional benefits in terms of user satisfaction with the routing and the match with their preferences. Finally, we outline challenges for future work on TTDPs in this article.

Suggested Citation

  • Wolfgang Wörndl & Alexander Hefele & Daniel Herzog, 0. "Recommending a sequence of interesting places for tourist trips," Information Technology & Tourism, Springer, vol. 0, pages 1-24.
    • Handle: RePEc:spr:infott:v::y::i::d:10.1007_s40558-017-0076-5
    DOI: 10.1007/s40558-017-0076-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40558-017-0076-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s40558-017-0076-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Angelelli, E. & Archetti, C. & Vindigni, M., 2014. "The Clustered Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 404-414.
    2. Ann Campbell & Michel Gendreau & Barrett Thomas, 2011. "The orienteering problem with stochastic travel and service times," Annals of Operations Research, Springer, vol. 186(1), pages 61-81, June.
    3. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
    4. Souffriau, Wouter & Vansteenwegen, Pieter & Vanden Berghe, Greet & Van Oudheusden, Dirk, 2011. "The planning of cycle trips in the province of East Flanders," Omega, Elsevier, vol. 39(2), pages 209-213, April.
    5. Moonyoung Kang, 2013. "Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions," Springer Books, in: Lorenzo Cantoni & Zheng (Phil) Xiang (ed.), Information and Communication Technologies in Tourism 2013, edition 127, pages 131-143, Springer.
    6. Rodríguez, Beatriz & Molina, Julián & Pérez, Fátima & Caballero, Rafael, 2012. "Interactive design of personalised tourism routes," Tourism Management, Elsevier, vol. 33(4), pages 926-940.
    7. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wolfgang Wörndl & Alexander Hefele & Daniel Herzog, 2017. "Recommending a sequence of interesting places for tourist trips," Information Technology & Tourism, Springer, vol. 17(1), pages 31-54, March.
    2. Ruiz-Meza, José & Montoya-Torres, Jairo R., 2022. "A systematic literature review for the tourist trip design problem: Extensions, solution techniques and future research lines," Operations Research Perspectives, Elsevier, vol. 9(C).
    3. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    4. Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
    5. Orlis, Christos & Laganá, Demetrio & Dullaert, Wout & Vigo, Daniele, 2020. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements," Omega, Elsevier, vol. 93(C).
    6. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    7. José Ruiz-Meza & Jairo R. Montoya-Torres, 2021. "Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations," Annals of Operations Research, Springer, vol. 305(1), pages 227-249, October.
    8. Álvarez-Miranda, Eduardo & Luipersbeck, Martin & Sinnl, Markus, 2018. "Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems," European Journal of Operational Research, Elsevier, vol. 265(2), pages 779-794.
    9. Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
    10. Riera-Ledesma, Jorge & Salazar-González, Juan José, 2017. "Solving the Team Orienteering Arc Routing Problem with a column generation approach," European Journal of Operational Research, Elsevier, vol. 262(1), pages 14-27.
    11. Bian, Zheyong & Liu, Xiang, 2018. "A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 246-266.
    12. Antonio R. Uguina & Juan F. Gomez & Javier Panadero & Anna Martínez-Gavara & Angel A. Juan, 2024. "A Learnheuristic Algorithm Based on Thompson Sampling for the Heterogeneous and Dynamic Team Orienteering Problem," Mathematics, MDPI, vol. 12(11), pages 1-19, June.
    13. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    14. Pěnička, Robert & Faigl, Jan & Saska, Martin, 2019. "Variable Neighborhood Search for the Set Orienteering Problem and its application to other Orienteering Problem variants," European Journal of Operational Research, Elsevier, vol. 276(3), pages 816-825.
    15. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    16. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    17. Samita Kedkaew & Warisa Nakkiew & Parida Jewpanya & Wasawat Nakkiew, 2024. "A Novel Tourist Trip Design Problem with Stochastic Travel Times and Partial Charging for Battery Electric Vehicles," Mathematics, MDPI, vol. 12(18), pages 1-19, September.
    18. Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
    19. Markus Sinnl, 2021. "Mixed-integer programming approaches for the time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 497-542, June.
    20. Qinxiao Yu & Yossiri Adulyasak & Louis-Martin Rousseau & Ning Zhu & Shoufeng Ma, 2022. "Team Orienteering with Time-Varying Profit," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 262-280, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:infott:v::y::i::d:10.1007_s40558-017-0076-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.