{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T02:23:07Z","timestamp":1778034187875,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031398469","type":"print"},{"value":"9783031398476","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39847-6_38","type":"book-chapter","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:02:46Z","timestamp":1692291766000},"page":"478-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Tour Route Generation Considering Spot Congestion"],"prefix":"10.1007","author":[{"given":"Takeyuki","family":"Maekawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidekazu","family":"Kasahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3430-9244","authenticated-orcid":false,"given":"Qiang","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Dezfouli, M.B., Shahraki, M.H.N., Zamani, H.: A novel tour planning model using big data. In: Proceedings of the IDAP 2018, pp. 1\u20136 (2018)","DOI":"10.1109\/IDAP.2018.8620933"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"105357","DOI":"10.1016\/j.cor.2021.105357","volume":"133","author":"R Gama","year":"2021","unstructured":"Gama, R., Fernandes, H.L.: A reinforcement learning approach to the orienteering problem with time windows. Comput. Oper. Res. 133, 105357 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"21","key":"38_CR3","doi-asserted-by":"publisher","first-page":"7303","DOI":"10.1016\/j.eswa.2015.05.046","volume":"42","author":"D Gavalas","year":"2015","unstructured":"Gavalas, D., Kasapakis, V., Konstantopoulos, C., Pantziou, G., Vathis, N., Zaroliagis, C.: The eCOMPASS multimodal tourist tour planner. Expert Syst. Appl. 42(21), 7303\u20137316 (2015)","journal-title":"Expert Syst. Appl."},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Geng, Y., et al.: Deep reinforcement learning based dynamic route planning for minimizing travel time. In: Proceedings of the ICC Workshops 2021, pp. 1\u20136 (2021)","DOI":"10.1109\/ICCWorkshops50388.2021.9473555"},{"key":"38_CR5","unstructured":"Google: https:\/\/developers.google.com\/maps\/documentation\/javascript\/places?hl=ja#place_details"},{"key":"38_CR6","unstructured":"Hirano, Y., Suwa, H., Yasumoto, K.: A method for generating multiple tour routes balancing user satisfaction and resource consumption. In: Proceedings of the Intelligent Environments 2019. Ambient Intelligence and Smart Environments, vol. 26, pp. 180\u2013189. IOS Press (2019)"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Hosu, V., Goldlucke, B., Saupe, D.: Effective aesthetics prediction with multi-level spatially pooled features. In: proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 9375\u20139383 (2019)","DOI":"10.1109\/CVPR.2019.00960"},{"issue":"4","key":"38_CR8","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.3390\/smartcities3040066","volume":"3","author":"S Isoda","year":"2020","unstructured":"Isoda, S., Hidaka, M., Matsuda, Y., Suwa, H., Yasumoto, K.: Timeliness-aware on-site planning method for tour navigation. Smart Cities 3(4), 1383\u20131404 (2020). https:\/\/doi.org\/10.3390\/smartcities3040066","journal-title":"Smart Cities"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-031-12426-6_20","volume-title":"Database and Expert Systems Applications, DEXA 2022","author":"WK Kong","year":"2022","unstructured":"Kong, W.K., Zheng, S., Nguyen, M.L., Ma, Q.: Diversity-oriented route planning for tourists. In: Strauss, C., Cuzzocrea, A., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) Database and Expert Systems Applications, DEXA 2022. Lecture Notes in Computer Science, vol. 13427, pp. 243\u2013255. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-12426-6_20"},{"key":"38_CR10","unstructured":"Kurata, Y., Shinagawa, Y., Hara, T.: CT-Planner5: a computer-aided tour planning service which profits both tourists and destinations. In: Workshop on Tourism Recommender Systems, RecSys, vol. 15, pp. 35\u201342 (2015)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Muccini, H., Rossi, F., Traini, L.: A smart city run-time planner for multi-site congestion management. In: 2017 International Conference on Smart Systems and Technologies (SST), pp. 175\u2013179 (2017)","DOI":"10.1109\/SST.2017.8188691"},{"key":"38_CR12","unstructured":"openrouteservice: Retrieved January 25th (2023). https:\/\/openrouteservice.org\/dev\/#\/api-docs\/v2\/matrix\/profile\/post"},{"issue":"10","key":"38_CR13","doi-asserted-by":"publisher","first-page":"5492","DOI":"10.3390\/su13105492","volume":"13","author":"CM P\u0103curar","year":"2021","unstructured":"P\u0103curar, C.M., Albu, R.G., P\u0103curar, V.D.: Tourist route optimization in the context of COVID-19 pandemic. Sustainability 13(10), 5492 (2021)","journal-title":"Sustainability"},{"key":"38_CR14","unstructured":"Qiang, M.: Tourism informatics - smart tourism toward tourism informatics - : Discovery and recommendation of tourism resources by using user generated content (in Japanese). IPSJ Magaz. 62(11), e12\u2013e17 (2021)"},{"key":"38_CR15","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 28. Curran Associates, Inc. (2015)"},{"issue":"10","key":"38_CR16","doi-asserted-by":"publisher","first-page":"168781401773230","DOI":"10.1177\/1687814017732309","volume":"9","author":"X Wu","year":"2017","unstructured":"Wu, X., Guan, H., Han, Y., Ma, J.: A tour route planning model for tourism experience utility maximization. Adv. Mech. Eng. 9(10), 1687814017732309 (2017)","journal-title":"Adv. Mech. Eng."},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Xu, J., Sun, J., Li, T., Ma, Q.: Kyoto sightseeing map 2.0 for user-experience oriented tourism. In: Proceedings of the MIPR 2021, pp. 239\u2013242 (2021)","DOI":"10.1109\/MIPR51284.2021.00045"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Xu, Y., Hu, T., Li, Y.: A travel route recommendation algorithm with personal preference. In: 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), pp. 390\u2013396 (2016)","DOI":"10.1109\/FSKD.2016.7603205"},{"key":"38_CR19","unstructured":"Yahoo Japan Corporation: Yahoo! JAPAN"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"39536","DOI":"10.1109\/ACCESS.2020.2967060","volume":"8","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Jiao, L., Yu, Z., Lin, Z., Gan, M.: A tourism route-planning approach based on comprehensive attractiveness. IEEE Access 8, 39536\u201339547 (2020)","journal-title":"IEEE Access"},{"key":"38_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.tourman.2017.05.006","volume":"62","author":"W Zheng","year":"2017","unstructured":"Zheng, W., Liao, Z., Qin, J.: Using a four-step heuristic algorithm to design personalized day tour route within a tourist attraction. Tour. Manage. 62, 335\u2013349 (2017)","journal-title":"Tour. Manage."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39847-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:31:17Z","timestamp":1710333077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39847-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398469","9783031398476"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39847-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"155","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full and 3 short papers have been accepted from 20 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}