{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:30Z","timestamp":1740169290186,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3167033","type":"journal-article","created":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T19:32:42Z","timestamp":1649878362000},"page":"43799-43811","source":"Crossref","is-referenced-by-count":2,"title":["<i>E<\/i>-Ride: An Adaptive Event-Driven Windowed Matching Framework in Ridesharing"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8535-6337","authenticated-orcid":false,"given":"Han","family":"Wu","sequence":"first","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6933-9828","authenticated-orcid":false,"given":"Yu","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3049-9917","authenticated-orcid":false,"given":"Liping","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojie","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-3076-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.02.001"},{"volume-title":"Didi","year":"2022","key":"ref3"},{"volume-title":"Uber","year":"2022","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544843"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733106"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996974"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3139958.3139991"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820850"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2016.37"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(02)00045-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00095"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611675114"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424574"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204030"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11298"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236211"},{"key":"ref19","first-page":"359","article-title":"The KL-UCB algorithm for bounded stochastic bandits and beyond","volume-title":"Proc. 24th Annu. Conf. Learn. Theory","volume":"19","author":"Garivier"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384348"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488862"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2868366"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00083"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.2.262"},{"volume-title":"Geofabrik Download Server","year":"2022","key":"ref27"},{"volume-title":"Osmconvert","year":"2022","key":"ref28"},{"volume-title":"OpenStreetMap","year":"2022","key":"ref29"},{"volume-title":"Relation: Chengdu (2110264)","year":"2022","key":"ref30"},{"volume-title":"Relation: New york (61320)","year":"2022","key":"ref31"},{"volume-title":"DiDi GAIA","year":"2022","key":"ref32"},{"volume-title":"TLC Trip Record Data","year":"2022","key":"ref33"},{"key":"ref34","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","volume-title":"Proc. 4th Annu. ACM\/SIGACT-SIAM Symp. Discrete Algorithms","author":"Yianilos"},{"article-title":"Advanced dial-a-ride algorithms research project","year":"1976","author":"Wilson","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-002-0009-8"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2006.00544.x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0283"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00096"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(86)90020-2"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.1.63"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.021"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09756584.pdf?arnumber=9756584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T20:36:51Z","timestamp":1705955811000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9756584\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3167033","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}