{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:39:45Z","timestamp":1740141585556,"version":"3.37.3"},"reference-count":22,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/100000144","name":"NSF","doi-asserted-by":"publisher","award":["CNS 1629746, CNS 1564128, CNS 1449860, CNS 1461932, CNS 1460971, CNS 1439672, CNS 1301774"],"award-info":[{"award-number":["CNS 1629746, CNS 1564128, CNS 1449860, CNS 1461932, CNS 1460971, CNS 1439672, CNS 1301774"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["ECCS"],"award-info":[{"award-number":["ECCS"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"published-print":{"date-parts":[[2020,9,2]]},"DOI":"10.1080\/17445760.2018.1539718","type":"journal-article","created":{"date-parts":[[2018,11,3]],"date-time":"2018-11-03T18:21:10Z","timestamp":1541269270000},"page":"535-549","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":6,"title":["A greedy approach for carpool scheduling optimisation in smart cities"],"prefix":"10.1080","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0568-7262","authenticated-orcid":false,"given":"Yubin","family":"Duan","sequence":"first","affiliation":[{"name":"Center for Networked Computing, Temple University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wu","sequence":"additional","affiliation":[{"name":"Center for Networked Computing, Temple University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanyang","family":"Zheng","sequence":"additional","affiliation":[{"name":"Center for Networked Computing, Temple University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2018,11,3]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/j.enpol.2011.01.043"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1108\/9780080481449"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/s11116-015-9661-7"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2017.07.031"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Wu C, Shankari K, Kamar E, et\u00a0al. Optimizing the diamond lane: a more tractable carpool problem and algorithms. Proceedings of the 19th IEEE ITSC; Rio de Janeiro, Brazil. 2016. p. 1389\u20131396.","DOI":"10.1109\/ITSC.2016.7795739"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"Silva E, Kokkinogenis Z, C\u00e2mara \u00c1, et\u00a0al. An exploratory study of taxi sharing schemas. Proceedings of the 19th IEEE ITSC; Rio de Janeiro, Brazil. 2016. p. 247\u2013252.","DOI":"10.1109\/ITSC.2016.7795562"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2014.05.433"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2011.04.530"},{"key":"CIT0009","unstructured":"Amey A. A proposed methodology for estimating rideshare viability within an organization, applied to the MIT community. TRB Annual Meeting Proceedings; Washington, DC. 2011. p. 1\u201316."},{"volume-title":"Real-time rideshare matching problem","year":"2011","author":"Ghoseiri K","key":"CIT0010"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Xing X, Warden T, Nicolai T, et\u00a0al. Smize: a spontaneous ride-sharing system for individual urban transit. German Conference on Multiagent System Technologies; Hamburg: Springer; 2009. p. 165\u2013176.","DOI":"10.1007\/978-3-642-04143-3_15"},{"volume-title":"The carpool problem","year":"1997","author":"Buchholz F.","key":"CIT0012"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0106"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1403657111"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Zhang S, Ma Q, Zhang Y, et\u00a0al. QA-share: towards efficient qos-aware dispatching approach for urban taxi-sharing. Proceedings of the 12th IEEE SECON 2015; Seattle, WA. 2015. p. 533\u2013541.","DOI":"10.1109\/SAHCN.2015.7338355"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"Chang W, Zheng H, Wu J. On the RSU-based secure distinguishability among vehicular flows. Proceedings of the IEEE\/ACM IWQoS 2017; Vilanova i la Geltr\u00fa, Spain. 2017. p. 1\u20136.","DOI":"10.1109\/IWQoS.2017.7969157"},{"key":"CIT0017","doi-asserted-by":"crossref","unstructured":"Wang N, Wu J, Ostovari P. Coverage and workload cost balancing in spatial crowdsourcing. Proceedings of the 14th IEEE UIC; San Francisco. 2017. p. 1\u20138.","DOI":"10.1109\/UIC-ATC.2017.8397518"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110211"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1145\/6462.6502"},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"Bernstein A, Stein C. Faster fully dynamic matchings with small approximation ratios. Proceedings of the 27th ACM-SIAM SODA; Arlington, Virginia. 2016. p. 692\u2013711.","DOI":"10.1137\/1.9781611974331.ch50"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"Micali S, Vazirani VV. An O(VE) algorithm for finding maximum matching in general graphs. 21st IEEE FOCS; Syracuse, NY. 1980. p. 17\u201327.","DOI":"10.1109\/SFCS.1980.12"},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"Duan Y, Mosharraf T, Wu J, et\u00a0al. Optimizing carpool scheduling algorithm through partition merging. IEEE ICC; Kansas City, MO. May; 2018. p. 1\u20136.","DOI":"10.1109\/ICC.2018.8422976"}],"container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/17445760.2018.1539718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T08:20:21Z","timestamp":1620289221000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/17445760.2018.1539718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,3]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9,2]]}},"alternative-id":["10.1080\/17445760.2018.1539718"],"URL":"https:\/\/doi.org\/10.1080\/17445760.2018.1539718","relation":{},"ISSN":["1744-5760","1744-5779"],"issn-type":[{"type":"print","value":"1744-5760"},{"type":"electronic","value":"1744-5779"}],"subject":[],"published":{"date-parts":[[2018,11,3]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-09-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}