{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T12:11:19Z","timestamp":1760443879936,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2020-06639"],"award-info":[{"award-number":["RGPIN-2020-06639"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,25]]},"DOI":"10.1145\/3748777.3748782","type":"proceedings-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:53:38Z","timestamp":1760442818000},"page":"90-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Batch Insertion Operator for Shared Mobility Route Planning on Time-Dependent Road Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6976-8565","authenticated-orcid":false,"given":"Aaditya","family":"Mukherjee","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Victoria, Victoria, BC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1065-605X","authenticated-orcid":false,"given":"Sean","family":"Chester","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Victoria, Victoria, BC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7609-1805","authenticated-orcid":false,"given":"Mario A.","family":"Nascimento","sequence":"additional","affiliation":[{"name":"Khoury College of Computer Sciences, Northeastern University, Vancouver, BC, Canada"}]}],"member":"320","published-online":{"date-parts":[[2025,10,14]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Rasim\u00a0M. Alguliyev Ramiz\u00a0M. Aliguliyev and Lyudmila\u00a0V. Sukhostat. 2021. Parallel batch k-means for Big data clustering. Computers & Industrial Engineering 152 (2021) 107023. 10.1016\/j.cie.2020.107023","DOI":"10.1016\/j.cie.2020.107023"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Tarique Anwar Chengfei Liu Hai Vu and Christopher Leckie. 2014. Spatial partitioning of large urban road networks. (1 2014). 10.25916\/sut.26224499.v1","DOI":"10.25916\/sut.26224499.v1"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29665-03"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00161"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Zengyang Gong Yuxiang Zeng and Lei Chen. 2024. Real-Time Insertion Operator for Shared Mobility on Time-Dependent Road Networks. Proc. VLDB Endow. 17 7 (5 2024) 1669\u20131682. 10.14778\/3654621.3654633","DOI":"10.14778\/3654621.3654633"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"Lars Gottesb\u00fcren Michael Hamann Tim\u00a0Niklas Uhl and Dorothea Wagner. 2019. Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. Algorithms 12 9 (2019). 10.3390\/a12090196","DOI":"10.3390\/a12090196"},{"key":"e_1_3_3_2_8_2","unstructured":"Daniel Huntley and Vadim Bulitko. 2013. Search-Space Characterization for Real-time Heuristic Search. arxiv:https:\/\/arXiv.org\/abs\/1308.3309\u00a0[cs.AI] https:\/\/arxiv.org\/abs\/1308.3309"},{"key":"e_1_3_3_2_9_2","unstructured":"Intel Corporation. 2024. Basic Hotspots Analysis \u2013 Intel VTune Profiler User Guide. https:\/\/www.intel.com\/content\/www\/us\/en\/docs\/vtune-profiler\/user-guide\/2024-0\/basic-hotspots-analysis.html Accessed: 2024-05-15."},{"key":"e_1_3_3_2_10_2","unstructured":"Intel Corporation. 2024. Intel VTune Profiler. https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/tools\/oneapi\/vtune-profiler.html Accessed: 2024-05-15."},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Jiajia Li Cancan Ni Dan He Lei Li Xiufeng Xia and Xiaofang Zhou. 2022. Efficient kNN query for moving objects on time-dependent road networks. The VLDB Journal 32 3 (July 2022) 575\u2013594. 10.1007\/s00778-022-00758-w","DOI":"10.1007\/s00778-022-00758-w"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","unstructured":"Xiaohui Lin and Jianmin Xu. 2020. Road network partitioning method based on Canopy-Kmeans clustering algorithm. Archives of Transport 54 2 (Jun. 2020) 95\u2013105. 10.5604\/01.3001.0014.2970","DOI":"10.5604\/01.3001.0014.2970"},{"key":"e_1_3_3_2_13_2","first-page":"281","volume-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Statistics","volume":"5","author":"MacQueen James","year":"1967","unstructured":"James MacQueen. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Statistics , Vol.\u00a05. University of California press, 281\u2013298."},{"key":"e_1_3_3_2_14_2","unstructured":"Aaditya Mukherjee. 2025. Fast trips: A scalable insertion operator approach for ridesharing over time-dependent road networks. https:\/\/hdl.handle.net\/1828\/22057"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Masayo Ota Huy Vo Cl\u00e1udio Silva and Juliana Freire. 2017. STaRS: Simulating Taxi Ride Sharing at Scale. IEEE Transactions on Big Data 3 3 (2017) 349\u2013361. 10.1109\/TBDATA.2016.2627223","DOI":"10.1109\/TBDATA.2016.2627223"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"crossref","unstructured":"Jinyoung Pung Raissa\u00a0M D\u2019Souza Dipak Ghosal and Michael Zhang. 2022. A road network simplification algorithm that preserves topological properties. Applied Network Science 7 1 (2022) 79.","DOI":"10.1007\/s41109-022-00521-8"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/SeFet48154.2021.9375817"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"O. Tange. 2011. GNU Parallel - The Command-Line Power Tool. ;login: The USENIX Magazine 36 1 (Feb 2011) 42\u201347. 10.5281\/zenodo.16303","DOI":"10.5281\/zenodo.16303"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0L. Thorndike. 1953. Who belongs in the family? Psychometrika 18 (1953) 267\u2013276. https:\/\/api.semanticscholar.org\/CorpusID:120467216","DOI":"10.1007\/BF02289263"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Yongxin Tong Yuxiang Zeng Zimu Zhou Lei Chen and Ke Xu. 2022. Unified Route Planning for Shared Mobility: An Insertion-based Framework. ACM Trans. Database Syst. 47 1 Article 2 (May 2022) 48\u00a0pages. 10.1145\/3488723","DOI":"10.1145\/3488723"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","unstructured":"Yongxin Tong Yuxiang Zeng Zimu Zhou Lei Chen Jieping Ye and Ke Xu. 2018. A unified approach to route planning for shared mobility. Proc. VLDB Endow. 11 11 (July 2018) 1633\u20131646. 10.14778\/3236187.3236211","DOI":"10.14778\/3236187.3236211"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Sicheng Wang and Robert\u00a0B. Noland. 2021. Variation in ride-hailing trips in Chengdu China. Transportation Research Part D: Transport and Environment 90 (2021) 102596. 10.1016\/j.trd.2020.102596","DOI":"10.1016\/j.trd.2020.102596"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","unstructured":"Yong Wang Guoliang Li and Nan Tang. 2019. Querying shortest paths on time dependent road networks. Proc. VLDB Endow. 12 11 (July 2019) 1249\u20131261. 10.14778\/3342263.3342265","DOI":"10.14778\/3342263.3342265"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00032"},{"key":"e_1_3_3_2_25_2","unstructured":"Yifan Zeng. 2024. Shanghai Dataset. https:\/\/yzengal.github.io\/datasets\/ Accessed: 2025-01-28."},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","unstructured":"Haojia Zuo Bo Cao Ying Zhao Bilong Shen Weimin Zheng and Yan Huang. 2021. High-capacity ride-sharing via shortest path clustering on large road networks. J. Supercomput. 77 4 (April 2021) 4081\u20134106. 10.1007\/s11227-020-03424-6","DOI":"10.1007\/s11227-020-03424-6"}],"event":{"name":"SSTD '25: 19th International Symposium on Spatial and Temporal Data","location":"Osaka Japan","acronym":"SSTD '25"},"container-title":["Proceedings of the 19th International Symposium on Spatial and Temporal Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748777.3748782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:56:24Z","timestamp":1760442984000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748777.3748782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,25]]},"references-count":25,"alternative-id":["10.1145\/3748777.3748782","10.1145\/3748777"],"URL":"https:\/\/doi.org\/10.1145\/3748777.3748782","relation":{},"subject":[],"published":{"date-parts":[[2025,8,25]]},"assertion":[{"value":"2025-10-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}