{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:44:58Z","timestamp":1774896298277,"version":"3.50.1"},"reference-count":54,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:00:00Z","timestamp":1739750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Chiang Mai University, Thailand"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Tourism refers to the activity of traveling for pleasure, recreation, or leisure purposes. It encompasses a wide range of activities and experiences, from sightseeing to cultural exploration. In today\u2019s digital age, tourists often organize their excursions independently by utilizing information available on websites. However, due to constraints in designing customized tour routes such as travel time and budget, many still require assistance with vacation planning to optimize their experiences. Therefore, this paper proposes an algorithm for personalized tourism planning that considers tourists\u2019 preferences. For instance, the algorithm can recommend places to visit and suggest activities based on tourist requirements. The proposed algorithm utilizes an extended model of the team orienteering problem with time windows (TOPTW) to account for mandatory locations and activities at each site. It offers trip planning that includes a set of locations and activities designed to maximize the overall score accumulated from visiting these locations. To solve the proposed model, the Adaptive Neighborhood Simulated Annealing (ANSA) algorithm is applied. ANSA is an enhanced version of the well-known Simulated Annealing algorithm (SA), providing an adaptive mechanism to manage the probability of selecting neighborhood moves during the SA search process. The computational results demonstrate that ANSA performs well in solving benchmark problems. Furthermore, a real-world attractive location in Tak Province, Thailand, is used as the case study in this paper to illustrate the effectiveness of the proposed model.<\/jats:p>","DOI":"10.3390\/a18020110","type":"journal-article","created":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T04:40:25Z","timestamp":1739767225000},"page":"110","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimized Travel Itineraries: Combining Mandatory Visits and Personalized Activities"],"prefix":"10.3390","volume":"18","author":[{"given":"Parida","family":"Jewpanya","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai 50200, Thailand"}]},{"given":"Pinit","family":"Nuangpirom","sequence":"additional","affiliation":[{"name":"Department of Technical Education and Technology, Faculty of Engineering, Rajamangala University of Technology Lanna, Chiang Mai 50300, Thailand"}]},{"given":"Siwasit","family":"Pitjamit","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Faculty of Engineering, Rajamangala University of Technology Lanna, Tak 63000, Thailand"}]},{"given":"Warisa","family":"Nakkiew","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai 50200, Thailand"}]}],"member":"1968","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s40558-017-0080-9","article-title":"Planning the trip itinerary for tourist groups","volume":"17","author":"Sylejmani","year":"2017","journal-title":"Inf. Technol. Tour."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"103956","DOI":"10.1016\/j.tourman.2019.103956","article-title":"Using a heuristic approach to design personalized urban tourism itineraries with hotel selection","volume":"76","author":"Zheng","year":"2020","journal-title":"Tour. Manag."},{"key":"ref_3","unstructured":"Lim, K.H., Chan, J., Leckie, C., and Karunasekera, S. (2015, January 25\u201331). Personalized tour recommendation based on user interests and points of interest visit durations. Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"113070","DOI":"10.1016\/j.eswa.2019.113070","article-title":"Personalized itinerary recommendation: Deep and collaborative learning with textual information","volume":"144","author":"Chen","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Hassannia, R., Vatankhah Barenji, A., Li, Z., and Alipour, H. (2019). Web-Based Recommendation System for Smart Tourism: Multiagent Technology. Sustainability, 11.","DOI":"10.3390\/su11020323"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Mehmood, F., Ahmad, S., and Kim, D. (2019). Design and development of a real-time optimal route recommendation system using big data for tourists in Jeju Island. Electronics, 8.","DOI":"10.3390\/electronics8050506"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1007\/s10115-018-1297-4","article-title":"Tour recommendation and trip planning using location-based social media: A survey","volume":"60","author":"Lim","year":"2019","journal-title":"Knowl. Inf. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Gionis, A., Lappas, T., Pelechrinis, K., and Terzi, E. (2014, January 24\u201328). Customized tour recommendations in urban areas. Proceedings of the WSDM 2014\u20147th ACM International Conference on Web Search and Data Mining, New York, NY, USA.","DOI":"10.1145\/2556195.2559893"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10288-008-0086-4","article-title":"Planning in tourism and public transportation","volume":"7","author":"Vansteenwegen","year":"2008","journal-title":"4OR"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Souffriau, W., and Vansteenwegen, P. (2010). Tourist trip planning functionalities: State-of-the-art and future. Current Trends in Web Engineering, Lecture Notes in Computer Science; Springer.","DOI":"10.1007\/978-3-642-16985-4_46"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"12439","DOI":"10.1016\/j.eswa.2011.04.025","article-title":"Time-dependent personal tour planning and scheduling in metropolises","volume":"38","author":"Abbaspour","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-010-0763-5","article-title":"On the tour planning problem","volume":"192","author":"Zhu","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/978-3-642-16985-4_47","article-title":"Personalized tourist route generation","volume":"Volume 6385","author":"Garcia","year":"2010","journal-title":"Current Trends in Web Engineering"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/j.cor.2011.03.020","article-title":"Integrating public transportation in personalized electronic tourist guides","volume":"40","author":"Garcia","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.jnca.2013.04.006","article-title":"Mobile recommender systems in tourism","volume":"39","author":"Gavalas","year":"2014","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipm.2014.10.003","article-title":"On planning sightseeing tours with TripBuilder","volume":"51","author":"Brilhante","year":"2015","journal-title":"Inf. Process. Manag."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"7303","DOI":"10.1016\/j.eswa.2015.05.046","article-title":"The eCOMPASS multimodal tourist tour planner","volume":"42","author":"Gavalas","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1080\/08839510802379626","article-title":"A personalized tourist trip design algorithm for mobile tourist guides","volume":"22","author":"Souffriau","year":"2008","journal-title":"Appl. Artif. Intell."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"6540","DOI":"10.1016\/j.eswa.2010.11.085","article-title":"The City Trip Planner: An expert system for tourists","volume":"38","author":"Vansteenwegen","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_20","unstructured":"Buhalis, D., and Schertler, W. (1999). Combinatorial Optimization Based Decision Support System for Trip Planning. Information and Communication Technologies in Tourism 1999, Springer."},{"key":"ref_21","unstructured":"Brilhante, I., Macedo, J.A., Nardini, F.M., Perego, R., and Renso, C. (November, January 27). Where shall we go today?. Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, San Francisco, CA, USA."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Maervoet, J., Brackman, P., Verbeeck, K., De Causmaecker, P., and Vanden Berghe, G. (2013, January 4\u20135). Tour suggestion for outdoor activities. Proceedings of the 12th International Symposium on Web and Wireless Geographical Information Systems, Banff, AB, Canada.","DOI":"10.1007\/978-3-642-37087-8_5"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s42452-020-04038-6","article-title":"A route planning framework for smart wearable assistive navigation systems","volume":"3","author":"Ntakolia","year":"2021","journal-title":"SN Appl. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Trachanatzi, D., Rigakis, M., Taxidou, A., Marinaki, M., Marinakis, Y., and Matsatsinis, N. (2020). A novel solution encoding in the differential evolution algorithm for optimizing tourist trip design problems. Learning and Intelligent Optimization, Springer.","DOI":"10.1007\/978-3-030-38629-0_21"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","article-title":"Metaheuristics for the bi-objective orienteering problem","volume":"3","author":"Schilde","year":"2009","journal-title":"Swarm Intell."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1057\/ori.2007.17","article-title":"The Mobile Tourist Guide: An OR Opportunity","volume":"20","author":"Vansteenwegen","year":"2007","journal-title":"OR Insight"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Wang, X., Golden, B.L., and Wasil, E.A. (2008). Using a Genetic Algorithm to Solve the Generalized Orienteering Problem. The Vehicle Routing Problem: Latest Advances and New Challenges, Springer.","DOI":"10.1007\/978-0-387-77778-8"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.cie.2018.11.044","article-title":"Team orienteering problem with time windows and time-dependent scores","volume":"127","author":"Yu","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"106084","DOI":"10.1016\/j.cie.2019.106084","article-title":"Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores","volume":"138","author":"Yu","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","article-title":"A fast and effective heuristic for the orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: A survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","article-title":"A tabu search heuristic for the team orienteering problem","volume":"32","author":"Tang","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","article-title":"Orienteering Problem: A survey of recent variants, solution approaches, and applications","volume":"255","author":"Gunawan","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Vansteenwegen, P., and Gunawan, A. (2019). Other Orienteering Problem Variants. Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits, Springer International Publishing.","DOI":"10.1007\/978-3-030-29746-6"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10288-006-0009-1","article-title":"An exact algorithm for team orienteering problems","volume":"5","author":"Boussier","year":"2007","journal-title":"4OR"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","article-title":"Solving the Orienteering Problem through Branch-and-Cut","volume":"10","author":"Fischetti","year":"1998","journal-title":"INFORMS J. Comput."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","article-title":"Ants can solve the team orienteering problem","volume":"54","author":"Ke","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_38","first-page":"287","article-title":"An ant colony system for team orienteering problems with time windows. Found","volume":"34","author":"Montemanni","year":"2009","journal-title":"Comput. Decis. Sci."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10479-011-0895-2","article-title":"The orienteering problem with stochastic travel and service times","volume":"186","author":"Campbell","year":"2011","journal-title":"Ann. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","article-title":"Heuristics for the multi-period orienteering problem with multiple time windows","volume":"37","author":"Tricoire","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","article-title":"Iterated local search for the team orienteering problem with time windows","volume":"36","author":"Vansteenwegen","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ejor.2011.08.024","article-title":"A simulated annealing heuristic for the team orienteering problem with time windows","volume":"217","author":"Lin","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10732-010-9153-z","article-title":"Hybridized evolutionary local search algorithm for the team orienteering problem with time windows","volume":"17","author":"Labadie","year":"2011","journal-title":"J. Heuristics"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"105205","DOI":"10.1016\/j.cor.2020.105205","article-title":"Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks","volume":"129","author":"Yu","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.cie.2017.10.020","article-title":"Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing","volume":"114","author":"Lin","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"126067","DOI":"10.1016\/j.physa.2021.126067","article-title":"A thorough study of the performance of simulated annealing in the traveling salesman problem under correlated and long-tailed spatial scenarios","volume":"577","author":"Filho","year":"2021","journal-title":"Physica A"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.neucom.2018.04.006","article-title":"Training ANFIS structure using simulated annealing algorithm for dynamic systems identification","volume":"302","author":"Haznedar","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"108566","DOI":"10.1016\/j.asoc.2022.108566","article-title":"Multi-neighborhood simulated annealing for personalized user project planning","volume":"119","author":"Li","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.eswa.2017.08.034","article-title":"Portfolio model for analyzing human resources: An approach based on neuro-fuzzy modeling and the simulated annealing algorithm","volume":"90","author":"Lukovac","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_50","first-page":"64","article-title":"Multi-period evacuation shelter selection considering dynamic hazards assessment","volume":"1","author":"Maghfiroh","year":"2019","journal-title":"Indones. J. Comput. Eng. Des."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Redi, A.A.N.P., Jewpanya, P., Kurniawan, A.C., Persada, S.F., Nadlifatin, R., and Dewi, O.A. (2020). A simulated annealing algorithm for solving two-echelon vehicle routing problem with locker facilities. Algorithms, 13.","DOI":"10.3390\/a13090218"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Reinaldi, M., Redi, A.A., Prakoso, D.F., Widodo, A.W., Wibisono, M.R., Supranartha, A., Liperda, R.I., Nadlifatin, R., Prasetyo, Y.T., and Sakti, S. (2021). Solving the two-echelon vehicle routing problem using simulated annealing algorithm considering drop box facilities and emission cost: A case study of reverse logistics application in Indonesia. Algorithms, 14.","DOI":"10.3390\/a14090259"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"107404","DOI":"10.1016\/j.asoc.2021.107404","article-title":"A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem","volume":"107","author":"Wang","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.cie.2016.01.018","article-title":"Open vehicle routing problem with cross-docking","volume":"94","author":"Yu","year":"2016","journal-title":"Comput. Ind. Eng."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/2\/110\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:36:02Z","timestamp":1760027762000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/2\/110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,17]]},"references-count":54,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["a18020110"],"URL":"https:\/\/doi.org\/10.3390\/a18020110","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,17]]}}}