乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T07:51:51Z","timestamp":1726300311829},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602411"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10707-020-00411-0","type":"journal-article","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T22:02:51Z","timestamp":1591135371000},"page":"881-913","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["SHAREK*: A Scalable Matching Method for Dynamic Ride Sharing"],"prefix":"10.1007","volume":"24","author":[{"given":"Bin","family":"Cao","sequence":"first","affiliation":[]},{"given":"Chenyu","family":"Hou","sequence":"additional","affiliation":[]},{"given":"Liwei","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Louai","family":"Alarabi","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Mohamed F.","family":"Mokbel","sequence":"additional","affiliation":[]},{"given":"Anas","family":"Basalamah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"key":"411_CR1","doi-asserted-by":"crossref","unstructured":"Agatz N, Erera A, Savelsbergh M, Wang X (2012) Optimization for dynamic ride-sharing: A review European Journal of Operational Research","DOI":"10.1016\/j.ejor.2012.05.028"},{"key":"411_CR2","doi-asserted-by":"crossref","unstructured":"Asghari M., Deng D., Shahabi C., Demiryurek U., Li Y. (2016) Price-aware real-time ride-sharing at scale: an auction-based approach. In: SIGSPATIAL GIS, p 3","DOI":"10.1145\/2996913.2996974"},{"issue":"3","key":"411_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30 (3):377\u2013387","journal-title":"Parallel Comput"},{"key":"411_CR4","doi-asserted-by":"crossref","unstructured":"Beaudry A, Laporte G, Melo T, Nickel S (2009) Dynamic transportation of patients in hospitals OR Spectrum","DOI":"10.1007\/s00291-008-0135-6"},{"key":"411_CR5","unstructured":"B\u00f6rzs\u00f6nyi S., Kossmann D (2001) Stocker, k.: The Skyline Operator. In: ICDE. Heidelberg, Germany, pp 421\u2013430"},{"key":"411_CR6","doi-asserted-by":"crossref","unstructured":"Cao B, Alarabi L, Mokbel MF, Basalamah A (2015) Sharek: a scalable dynamic ride sharing system. In: MDM","DOI":"10.1109\/MDM.2015.12"},{"issue":"3","key":"411_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00778-005-0177-1","volume":"16","author":"EP Chan","year":"2007","unstructured":"Chan EP, Lim H (2007) Optimization and evaluation of shortest path queries. VLDB J. 16(3):343\u2013369","journal-title":"VLDB J."},{"key":"411_CR8","doi-asserted-by":"crossref","unstructured":"Cici B, Markopoulou A, Laoutaris N (2015) Designing an on-line ride-sharing system. In: SIGSPATIAL. ACM, p 60","DOI":"10.1145\/2820783.2820850"},{"issue":"2","key":"411_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1111\/1475-3995.00256","volume":"8","author":"A Colorni","year":"2001","unstructured":"Colorni A, Righini G (2001) Modeling and optimizing dynamic dial-a-ride problems. Int Trans Oper Res 8(2):155\u2013166","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"411_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau JF, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153(1):29\u201346","journal-title":"Ann Oper Res"},{"key":"411_CR11","unstructured":"What do we mean by dynamic ridesharing. http:\/\/dynamicridesharing.org\/index.php"},{"key":"411_CR12","unstructured":"Carpooling-the flinc carpooling service: flinc. https:\/\/flinc.org\/"},{"key":"411_CR13","unstructured":"Geisberger R, Luxen D, Neubauer S, Volker SP, Sanders P, Volker L (2010) Fast detour computation for ride sharing. In: ATMOS. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, vol 14, pp 88\u201399"},{"key":"411_CR14","doi-asserted-by":"crossref","unstructured":"Gidofalvi G, Aps G, Risch T, Pedersen TB, Zeitler E (2008) Highly scalable trip grouping for large scale collective transportation systems. In: EDBT, pp 678\u2013689","DOI":"10.1145\/1353343.1353425"},{"key":"411_CR15","doi-asserted-by":"crossref","unstructured":"Hu Q, Ming L, Tong C, Zheng B (2019) An effective partitioning approach for competitive spatial-temporal searching (gis cup). In: SIGSPATIAL GIS, pp 620\u2013623","DOI":"10.1145\/3347146.3363349"},{"key":"411_CR16","doi-asserted-by":"crossref","unstructured":"Huang Y, Jin R, Bastani F, Wang XS (2015) Large scale real-time ridesharing with service guarantee on road networks. In: PVLDB, pp 2017\u20132028","DOI":"10.14778\/2733085.2733106"},{"issue":"3","key":"411_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0377-2217(85)90257-7","volume":"22","author":"B Kalantari","year":"1985","unstructured":"Kalantari B, Hill AV, Arora SR (1985) An algorithm for the traveling salesman problem with pickup and delivery customers. Eur J Oper Res 22(3):377\u2013386","journal-title":"Eur J Oper Res"},{"issue":"4","key":"411_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung HT, Luccio F (1975) On finding the maxima of a set of vectors. J. ACM 22(4):469\u2013476","journal-title":"J. ACM"},{"issue":"3","key":"411_CR19","first-page":"770","volume":"28","author":"RH Li","year":"2016","unstructured":"Li RH, Qin L, Yu JX, Mao R (2016) Optimal multi-meeting-point route search. TKDE 28(3):770\u2013784","journal-title":"TKDE"},{"key":"411_CR20","unstructured":"Lyft On-demand ridesharing. http:\/\/www.lyft.me"},{"key":"411_CR21","doi-asserted-by":"crossref","unstructured":"Ma S, Wolfson O (2013) Analysis and evaluation of the slugging form of ridesharing. In: SIGSPATIAL, pp 64\u201373","DOI":"10.1145\/2525314.2525365"},{"key":"411_CR22","unstructured":"Ma S, Zheng Y, Wolfson O (2013) T-share: a large-scale dynamic taxi ridesharing service. In: ICDE, pp 410\u2013421"},{"issue":"7","key":"411_CR23","first-page":"1782","volume":"27","author":"S Ma","year":"2015","unstructured":"Ma S, Zheng Y, Wolfson O (2015) Real-time city-scale taxi ridesharing. TKDE 27(7):1782\u20131795","journal-title":"TKDE"},{"issue":"1","key":"411_CR24","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"Nievergelt J, Hinterberger H, Sevcik K (1984) The grid file: an adaptable, symmetric multikey file structure. TODS 9(1):38\u201371","journal-title":"TODS"},{"key":"411_CR25","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: VLDB, pp 802\u2013813","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"411_CR26","unstructured":"Slugging. http:\/\/en.wikipedia.org\/wiki\/Slugging"},{"key":"411_CR27","unstructured":"Thomas Brinkhoff. Network-based generator of moving objects. http:\/\/iapg.jade-hs.de\/personen\/brinkhoff\/generator\/"},{"key":"411_CR28","doi-asserted-by":"crossref","unstructured":"Tian C, Huang Y, Liu Z, Bastani F, Jin R (2013) Noah: a dynamic ridesharing system. In: SIGMOD, pp 985\u2013988","DOI":"10.1145\/2463676.2463695"},{"key":"411_CR29","doi-asserted-by":"crossref","unstructured":"Yeung S, Miller E, Madria S (2016) A flexible real-time ridesharing system considering current road conditions. In: MDM, vol 1. IEEE, pp 186\u2013191","DOI":"10.1109\/MDM.2016.37"},{"key":"411_CR30","unstructured":"Zhang LG, Fang JY, Shen PW (2007) An improved dijkstra algorithm based on pairing heap [j]. J. Image Graphics 5"},{"issue":"10","key":"411_CR31","first-page":"2681","volume":"28","author":"X Zhang","year":"2016","unstructured":"Zhang X, Asano Y, Yoshikawa M (2016) Mutually beneficial confluent routing. TKDE 28(10):2681\u20132696","journal-title":"TKDE"},{"key":"411_CR32","doi-asserted-by":"crossref","unstructured":"Zheng B, Huang C, Jensen CS, Chen L, Hung NQV, Liu G, Li G, Zheng K (2020) Online trichromatic pickup and delivery scheduling in spatial crowdsourcing ICDE","DOI":"10.1109\/ICDE48307.2020.00089"},{"issue":"9","key":"411_CR33","first-page":"1846","volume":"29","author":"B Zheng","year":"2017","unstructured":"Zheng B, Su H, Hua W, Zheng K, Zhou X, Li G (2017) Efficient clue-based route search on road networks. TKDE 29(9):1846\u20131859","journal-title":"TKDE"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00411-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-020-00411-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00411-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:48:39Z","timestamp":1622594919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-020-00411-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,2]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["411"],"URL":"https:\/\/doi.org\/10.1007\/s10707-020-00411-0","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,2]]},"assertion":[{"value":"27 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}