{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T14:45:09Z","timestamp":1780843509039,"version":"3.54.1"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["91746109"],"award-info":[{"award-number":["91746109"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012456","name":"National Social Science Foundation of China","doi-asserted-by":"crossref","award":["18BFX096"],"award-info":[{"award-number":["18BFX096"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2020,10,31]]},"abstract":"<jats:p>We enhance the mobile sequential recommendation (MSR) model and address some critical issues in existing formulations by proposing three new forms of the MSR from a multi-user perspective. The multi-user MSR (MMSR) model searches optimal routes for multiple drivers at different locations while disallowing overlapping routes to be recommended. To enrich the properties of pick-up points in the problem formulation, we additionally consider the pick-up capacity as an important feature, leading to the following two modified forms of the MMSR: MMSR-m and MMSR-d. The MMSR-m sets a maximum pick-up capacity for all urban areas, while the MMSR-d allows the pick-up capacity to vary at different locations. We develop a parallel framework based on the simulated annealing to numerically solve the MMSR problem series. Also, a push-point method is introduced to improve our algorithms further for the MMSR-m and the MMSR-d, which can handle the route optimization in more practical ways. Our results on both real-world and synthetic data confirmed the superiority of our problem formulation and solutions under more demanding practical scenarios over several published benchmarks.<\/jats:p>","DOI":"10.1145\/3360048","type":"journal-article","created":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T21:19:53Z","timestamp":1594070393000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Multi-User Mobile Sequential Recommendation for Route Optimization"],"prefix":"10.1145","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6494-1174","authenticated-orcid":false,"given":"Keli","family":"Xiao","sequence":"first","affiliation":[{"name":"State University of New York at Stony Brook, Stony Brook, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zeyang","family":"Ye","sequence":"additional","affiliation":[{"name":"State University of New York at Stony Brook, Stony Brook, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lihao","family":"Zhang","sequence":"additional","affiliation":[{"name":"State University of New York at Stony Brook, Stony Brook, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjun","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Tennessee Knoxville, Knoxville, TN"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Ge","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, AZ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuefan","family":"Deng","sequence":"additional","affiliation":[{"name":"State University of New York at Stony Brook, Stony Brook, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611675114"},{"key":"e_1_2_1_2_1","volume-title":"Cook","author":"Applegate David L.","year":"2011","unstructured":"David L. Applegate , Robert E. Bixby , Vasek Chvatal , and William J . Cook . 2011 . The Traveling Salesman Problem: A Computational Study. Princeton University Press . David L. Applegate, Robert E. Bixby, Vasek Chvatal, and William J. Cook. 2011. The Traveling Salesman Problem: A Computational Study. Princeton University Press."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.09.012"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.12.009"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1998.6134"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.313.0391"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.qref.2017.07.006"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/1540-6229.12246"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020523"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835918"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2298012"},{"key":"e_1_2_1_13_1","volume-title":"Vecchi","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick , C. Daniel Gelatt , and Mario P . Vecchi . 1983 . Optimization by simulated annealing. Science 220, 4598 (1983), 671--680. https:\/\/science.sciencemag.org\/content\/220\/4598\/671. Scott Kirkpatrick, C. Daniel Gelatt, and Mario P. Vecchi. 1983. Optimization by simulated annealing. Science 220, 4598 (1983), 671--680. https:\/\/science.sciencemag.org\/content\/220\/4598\/671."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2011.10.011"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2362525"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623363"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2631537"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.233"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.02.001"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE\u201913)","author":"Ma Shuo","year":"2013","unstructured":"Shuo Ma , Yu Zheng , and Ouri Wolfson . 2013 . T-share: A large-scale dynamic taxi ridesharing service . In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE\u201913) . 410--421. Shuo Ma, Yu Zheng, and Ouri Wolfson. 2013. T-share: A large-scale dynamic taxi ridesharing service. In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE\u201913). 410--421."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2334313"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(94)00071-H"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/31\/41\/011"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22922-0_15"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623668"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02601638"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Paolo Toth and Daniele Vigo. 2002. The Vehicle Routing Problem. SIAM.  Paolo Toth and Daniele Vigo. 2002. The Vehicle Routing Problem. SIAM.","DOI":"10.1137\/1.9780898718515"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.03.035"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2772907"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131781"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2915228"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2919331.2919518"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00189"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2827047"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220111"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030112.2030128"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.153"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.117"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.31"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3360048","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3360048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:32Z","timestamp":1750203872000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3360048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10,31]]}},"alternative-id":["10.1145\/3360048"],"URL":"https:\/\/doi.org\/10.1145\/3360048","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2019-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}