IDEAS home Printed from https://ideas.repec.org/a/spr/infott/v27y2025i3d10.1007_s40558-025-00318-2.html
   My bibliography  Save this article

Personalized travel itinerary recommendation enhancing by user interests and point-of-interest characteristics

Author

Listed:
  • Chia-Wen Chang

    (Yuan Ze University)

  • Chieh-Yuan Tsai

    (Yuan Ze University)

  • Liguo Yao

    (Guizhou Normal University
    Guizhou Normal University)

  • R. J. Kuo

    (National Taiwan University of Science and Technology)

  • Chi-Yang Tsai

    (Yuan Ze University)

Abstract

Personalized itinerary recommendations become critical as more people select travel as a primary leisure activity. Although online search engines and model-based recommendation systems can predict the points of interest (POIs) users are interested in, they are hard to generate an appropriate itinerary satisfying users’ preferences and specific temporal or spatial constraints. In this study, a novel optimization method enhanced by user interests and POI characteristics is proposed. The proposed method incorporates an interest value prediction model considering the interaction feature deriving from the user’s historical visiting sequence and visual feature from user-taken photo images. Aside from users’ interest in POIs, the POI characteristic is included in itinerary planning to increase the chance of visiting popular and nearby sites. Then, travel itinerary planning is formulated as a variant orienteering problem that aims to find the optimal itinerary that maximizes user interest and POI characteristics under user-specified constraints. Finally, an Iterated Local Search with Adaptive Perturbation (ILSAP) algorithm is proposed to escape the local optimum efficiently and explore other feasible solution regions. A real-life dataset from geo-tagged social media is implemented to demonstrate the benefits of the proposed personalized itinerary planning framework. The experiments show that the proposed method generates superior recommendations than popular baseline methods. In addition, the proposed ILSAP algorithm shows significant improvement compared to ILS algorithms with other perturbation strategies.

Suggested Citation

  • Chia-Wen Chang & Chieh-Yuan Tsai & Liguo Yao & R. J. Kuo & Chi-Yang Tsai, 2025. "Personalized travel itinerary recommendation enhancing by user interests and point-of-interest characteristics," Information Technology & Tourism, Springer, vol. 27(3), pages 649-682, September.
  • Handle: RePEc:spr:infott:v:27:y:2025:i:3:d:10.1007_s40558-025-00318-2
    DOI: 10.1007/s40558-025-00318-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40558-025-00318-2
    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-025-00318-2?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

    for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Li, Xiang & Zhou, Jiandong & Zhao, Xiande, 2016. "Travel itinerary problem," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 332-343.
    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. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    2. Sina Mohri, Seyed & Ghaderi, Hadi & Van Woensel, Tom & Mohammadi, Mehrdad & Nassir, Neema & Thompson, Russell G., 2024. "Contextualizing alternative delivery points in last mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    3. 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.
    4. 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.
    5. 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.
    6. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    7. José Ruiz-Meza & Julio Brito & Jairo R. Montoya-Torres, 2021. "Multi-Objective Fuzzy Tourist Trip Design Problem with Heterogeneous Preferences and Sustainable Itineraries," Sustainability, MDPI, vol. 13(17), pages 1-22, August.
    8. Enzi, Miriam & Parragh, Sophie N. & Pisinger, David & Prandtstetter, Matthias, 2021. "Modeling and solving the multimodal car- and ride-sharing problem," European Journal of Operational Research, Elsevier, vol. 293(1), pages 290-303.
    9. Kirac, Emre & Milburn, Ashlea Bennett & Gedik, Ridvan, 2025. "The Dynamic Team Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 324(1), pages 22-39.
    10. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    11. 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.
    12. Stavropoulou, F. & Repoussis, P.P. & Tarantilis, C.D., 2019. "The Vehicle Routing Problem with Profits and consistency constraints," European Journal of Operational Research, Elsevier, vol. 274(1), pages 340-356.
    13. Kotiloglu, S. & Lappas, T. & Pelechrinis, K. & Repoussis, P.P., 2017. "Personalized multi-period tour recommendations," Tourism Management, Elsevier, vol. 62(C), pages 76-88.
    14. Xia, Jun & Wang, Kai & Wang, Shuaian, 2019. "Drone scheduling to monitor vessels in emission control areas," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 174-196.
    15. Sun, Peng & Veelenturf, Lucas P. & Dabia, Said & Van Woensel, Tom, 2018. "The time-dependent capacitated profitable tour problem with time windows and precedence constraints," European Journal of Operational Research, Elsevier, vol. 264(3), pages 1058-1073.
    16. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
    17. Roberto Aringhieri & Sara Bigharaz & Davide Duma & Alberto Guastalla, 2022. "Fairness in ambulance routing for post disaster management," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(1), pages 189-211, March.
    18. Xabier A. Martin & Marc Escoto & Antoni Guerrero & Angel A. Juan, 2024. "Battery Management in Electric Vehicle Routing Problems: A Review," Energies, MDPI, vol. 17(5), pages 1-25, February.
    19. 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).
    20. Anupam Mukherjee & Partha Sarathi Barma & Joydeep Dutta & Goutam Panigrahi & Samarjit Kar & Manoranjan Maiti, 2022. "A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots," Operational Research, Springer, vol. 22(3), pages 1813-1851, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:27:y:2025:i:3:d:10.1007_s40558-025-00318-2. 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.