{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T04:11:41Z","timestamp":1748059901544,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398209"},{"type":"electronic","value":"9783031398216"}],"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-39821-6_27","type":"book-chapter","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T21:01:25Z","timestamp":1692133285000},"page":"331-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Dual Congestion-Aware Route Planning for\u00a0Tourists by\u00a0Multi-agent Reinforcement Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2089-2363","authenticated-orcid":false,"given":"Kong","family":"Yuntao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7684-5745","authenticated-orcid":false,"given":"Peng","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2265-1010","authenticated-orcid":false,"given":"Nguyen Minh","family":"Le","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3430-9244","authenticated-orcid":false,"given":"Ma","family":"Qiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"113070","DOI":"10.1016\/j.eswa.2019.113070","volume":"144","author":"L Chen","year":"2020","unstructured":"Chen, L., Zhang, L., Cao, S., Wu, Z., Cao, J.: Personalized itinerary recommendation: deep and collaborative learning with textual information. Expert Syst. Appl. 144, 113070 (2020)","journal-title":"Expert Syst. Appl."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Padia, P., Lim, K., Cha, J., Harwood, A.: Sentiment-aware and personalized tour recommendation. In: IEEE Big Data, pp. 900\u2013909 (2019)","DOI":"10.1109\/BigData47090.2019.9006442"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Lim, K., Chan, J., Karunasekera, S., Leckie, C.: Personalized itinerary recommendation with queuing time awareness. In: ACM SIGIR, pp. 325\u2013334 (2017)","DOI":"10.1145\/3077136.3080778"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-031-12426-6_20","volume-title":"Database and Expert Systems Applications","author":"W Kong","year":"2022","unstructured":"Kong, W., Zheng, S., Nguyen, M., Ma, Q.: Diversity-oriented route planning for tourists. In: Strauss, C., Cuzzocrea, A., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2022. LNCS, pp. 243\u2013255. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-12426-6_20"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Hsieh, H., Li, C., Lin, S.: TripRec: recommending trip routes from large scale check-in data. In: WWW, pp. 529\u2013530 (2012)","DOI":"10.1145\/2187980.2188111"},{"key":"27_CR6","unstructured":"Gunawan, A., Yuan, Z., Lau, H.: A mathematical model and metaheuristics for time dependent orienteering problem. In: PATAT, pp. 202\u2013217 (2014)"},{"key":"27_CR7","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.: A RL approach to the orienteering problem with time windows. Comput. Oper. Res. 133, 105357 (2021)","journal-title":"Comput. Oper. Res."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Gionis, A., Lappas, T., Pelechrinis, K., Terzi, E.: Customized tour recommendations in urban areas. In: ACM WSDM, pp. 313\u2013322 (2014)","DOI":"10.1145\/2556195.2559893"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Taylor, K., Lim, K., Chan, J.: Travel itinerary recommendations with must-see points-of-interest. In: WWW, pp. 1198\u20131205 (2018)","DOI":"10.1145\/3184558.3191558"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/MIS.2016.4","volume":"31","author":"G Xu","year":"2016","unstructured":"Xu, G., Fu, B., Gu, Y.: Point-of-interest recommendations via a supervised random walk algorithm. IEEE Intell. Syst. 31, 15\u201323 (2016)","journal-title":"IEEE Intell. Syst."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s40558-017-0080-9","volume":"17","author":"K Sylejmani","year":"2017","unstructured":"Sylejmani, K., Dorn, J., Musliu, N.: Planning the trip itinerary for tourist groups. Inf. Technol. Tourism. 17, 275\u2013314 (2017)","journal-title":"Inf. Technol. Tourism."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.eswa.2021.116190","volume":"191","author":"J Sarkar","year":"2022","unstructured":"Sarkar, J., Majumder, A.: gtour: multiple itinerary recommendation engine for group of tourists. Expert Syst. Appl. 191, 116\u2013190 (2022)","journal-title":"Expert Syst. Appl."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10888-011-9188-x","volume":"10","author":"L Ceriani","year":"2012","unstructured":"Ceriani, L., Verme, P.: The origins of the gini index: extracts from Variabilit\u00e0 e Mutabilit\u00e0 (1912) by Corrado Gini. J. Econ. Inequal. 10, 421\u2013443 (2012)","journal-title":"J. Econ. Inequal."},{"key":"27_CR14","unstructured":"Pappalardo, L., Simini, F., Barlacchi, G., Pellungrini, R.: scikit-mobility: a python library for the analysis, generation and risk assessment of mobility data. ArXiv Preprint ArXiv:1907.07062 (2019)"},{"key":"27_CR15","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. ArXiv Preprint ArXiv:1707.06347 (2017)"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"105400","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021)","journal-title":"Comput. Oper. Res."},{"key":"27_CR17","unstructured":"Vaswani, A., et al.: Attention is all you need. In: NIPS, vol. 30 (2017)"}],"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-39821-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:52Z","timestamp":1710269332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39821-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398209","9783031398216"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39821-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 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)"}}]}}