{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:07:45Z","timestamp":1761808065301,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T00:00:00Z","timestamp":1472428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NRF"},{"DOI":"10.13039\/100000001","name":"US NSF","doi-asserted-by":"crossref","award":["CNS-1544887 and CNS-1446640"],"award-info":[{"award-number":["CNS-1544887 and CNS-1446640"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"name":"China 973 Program","award":["2015CB352400"],"award-info":[{"award-number":["2015CB352400"]}]},{"name":"Global Research Laboratory Program","award":["2013K1A1A2A02078326"],"award-info":[{"award-number":["2013K1A1A2A02078326"]}]},{"name":"Research Program of Shenzhen","award":["JSGG20150512145714248, KQCX2015040111035011 and CYZZ20150403111012661"],"award-info":[{"award-number":["JSGG20150512145714248, KQCX2015040111035011 and CYZZ20150403111012661"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2016,8,29]]},"abstract":"<jats:p>\n            Carpooling has long held the promise of reducing gas consumption by decreasing mileage to deliver coriders. Although ad hoc carpools already exist in the real world through private arrangements, little research on the topic has been done. In this article, we present the first systematic work to design, implement, and evaluate a carpool service, called\n            <jats:italic>coRide<\/jats:italic>\n            , in a large-scale taxicab network intended to reduce total mileage for less gas consumption. Our\n            <jats:italic>coRide<\/jats:italic>\n            system consists of three components, a dispatching cloud server, passenger clients, and an onboard customized device, called\n            <jats:italic>TaxiBox<\/jats:italic>\n            . In the\n            <jats:italic>coRide<\/jats:italic>\n            design, in response to the delivery requests of passengers, dispatching cloud servers calculate cost-efficient carpool routes for taxicab drivers and thus lower fares for the individual passengers.\n          <\/jats:p>\n          <jats:p>\n            To improve\n            <jats:italic>coRide<\/jats:italic>\n            \u2019s efficiency in mileage reduction, we formulate an NP-hard route calculation problem under different practical constraints. We then provide (1) an optimal algorithm using Linear Programming, (2) a 2-approximation algorithm with a polynomial complexity, and (3) its corresponding online version with a linear complexity. To encourage\n            <jats:italic>coRide<\/jats:italic>\n            \u2019s adoption, we present a win-win fare model as the incentive mechanism for passengers and drivers to participate. We test the performance of\n            <jats:italic>coRide<\/jats:italic>\n            by a comprehensive evaluation with a real-world trial implementation and a data-driven simulation with 14,000 taxi data from the Chinese city Shenzhen. The results show that compared with the ground truth, our service can reduce 33% of total mileage; with our win-win fare model, we can lower passenger fares by 49% and simultaneously increase driver profit by 76%.\n          <\/jats:p>","DOI":"10.1145\/2897517","type":"journal-article","created":{"date-parts":[[2016,8,31]],"date-time":"2016-08-31T15:17:55Z","timestamp":1472656675000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Carpooling Service for Large-Scale Taxicab Networks"],"prefix":"10.1145","volume":"12","author":[{"given":"Desheng","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"He","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shenzhen Institutes of Advanced Technology, P.R.China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingming","family":"Lu","sequence":"additional","affiliation":[{"name":"Shenzhen Institutes of Advanced Technology, P.R.China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunhuai","family":"Liu","sequence":"additional","affiliation":[{"name":"Third Research Institute of Ministry of Public Security, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haengju","family":"Lee","sequence":"additional","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science and Technology, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang H.","family":"Son","sequence":"additional","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science and Technology, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,29]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Ravindra Ahuja Thomas Magnanti and James Orlin. 2014. Network flows: Theory algorithms and applications. Pearson New International Edition.  Ravindra Ahuja Thomas Magnanti and James Orlin. 2014. Network flows: Theory algorithms and applications. Pearson New International Edition."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555816.1555838"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2426656.2426671"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999995.2000006"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424333"},{"key":"e_1_2_1_6_1","unstructured":"Data100 Company. 2012. Taixcab Carpooling Survey. Data100 Company. http:\/\/wenku.baidu.com\/view\/2f0fea1f964bcf84b9d57b4c.html.  Data100 Company. 2012. Taixcab Carpooling Survey. Data100 Company. http:\/\/wenku.baidu.com\/view\/2f0fea1f964bcf84b9d57b4c.html."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.2.342"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.272.0133"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020523"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835918"},{"key":"e_1_2_1_11_1","unstructured":"The Guardian. 2014. Taxi Drivers in European Capitals Strike over Uber. http:\/\/www.theguardian.com\/politics\/2014\/jun\/11\/taxi-drivers-strike-uber-london-live-updates.  The Guardian. 2014. Taxi Drivers in European Capitals Strike over Uber. http:\/\/www.theguardian.com\/politics\/2014\/jun\/11\/taxi-drivers-strike-uber-london-live-updates."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.01.004"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9684-y"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424340"},{"key":"e_1_2_1_15_1","unstructured":"SuperShuttle International. 2015. SuperShuttle service. http:\/\/www.supershuttle.com\/.  SuperShuttle International. 2015. SuperShuttle service. http:\/\/www.supershuttle.com\/."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020571"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339637"},{"key":"e_1_2_1_18_1","unstructured":"Lyft. 2015. Announcing Lyft Line. Lyft. https:\/\/www.lyft.com\/line.  Lyft. 2015. Announcing Lyft Line. Lyft. https:\/\/www.lyft.com\/line."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525365"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544843"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556288.2557300"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.001"},{"key":"e_1_2_1_23_1","unstructured":"Nationmaster. 2011. Energy statistics. http:\/\/www.nationmaster.com\/graph\/ene_oil_con-energy-oil-consumption.  Nationmaster. 2011. Energy statistics. http:\/\/www.nationmaster.com\/graph\/ene_oil_con-energy-oil-consumption."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1702315.1702528"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.05.017"},{"key":"e_1_2_1_26_1","unstructured":"Matt Richtel. 2014. Distracted driving and the risks of ride-hailing services like Uber. The New York Times. http:\/\/bits.blogs.nytimes.com\/2014\/12\/21\/distracted-driving-and-the-risks-of-ride-hailing-services-like-uber\/?_r&equals;1.  Matt Richtel. 2014. Distracted driving and the risks of ride-hailing services like Uber. The New York Times. http:\/\/bits.blogs.nytimes.com\/2014\/12\/21\/distracted-driving-and-the-risks-of-ride-hailing-services-like-uber\/?_r&equals;1."},{"key":"e_1_2_1_27_1","unstructured":"Schaller Consulting. 2006. The new York city taxicab fact book. http:\/\/www.schallerconsult.com\/taxi\/taxifb.pdf.  Schaller Consulting. 2006. The new York city taxicab fact book. http:\/\/www.schallerconsult.com\/taxi\/taxifb.pdf."},{"key":"e_1_2_1_28_1","unstructured":"NYC Taxi and Limousine Commission. 2011. Taxi of tomorrow survey results. http:\/\/www.nyc.gov\/html\/tlc\/downloads\/pdf\/tot_survey_results_02_10_11.pdf.  NYC Taxi and Limousine Commission. 2011. Taxi of tomorrow survey results. http:\/\/www.nyc.gov\/html\/tlc\/downloads\/pdf\/tot_survey_results_02_10_11.pdf."},{"key":"e_1_2_1_29_1","unstructured":"\u201cNew York Times\u201d. 2010. Limited share-a-cab test to begin soon. www.nytimes.com\/2010\/02\/22\/nyregion\/22ataxis.  \u201cNew York Times\u201d. 2010. Limited share-a-cab test to begin soon. www.nytimes.com\/2010\/02\/22\/nyregion\/22ataxis."},{"volume-title":"The vehicle routing problem","author":"Toth Paolo","key":"e_1_2_1_30_1","unstructured":"Paolo Toth and Daniele Vigo . 2001. The vehicle routing problem . In Society for Industrial and Applied Mathematics (SIAM '01). Paolo Toth and Daniele Vigo. 2001. The vehicle routing problem. In Society for Industrial and Applied Mathematics (SIAM'01)."},{"key":"e_1_2_1_31_1","unstructured":"Uber 2015. Announcing UberPool. Uber. http:\/\/newsroom.uber.com\/announcing-uberpool\/.  Uber 2015. Announcing UberPool. Uber. http:\/\/newsroom.uber.com\/announcing-uberpool\/."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339562"},{"key":"e_1_2_1_33_1","unstructured":"Wikipedia. 2016. Emissions trading or cap and trade. http:\/\/en.wikipedia.org\/wiki\/Emissionstrading.  Wikipedia. 2016. Emissions trading or cap and trade. http:\/\/en.wikipedia.org\/wiki\/Emissionstrading."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2012.55"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339561"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020462"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869807"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030112.2030128"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030112.2030127"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517351.2517361"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370216.2370425"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030112.2030126"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:02Z","timestamp":1750221542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,29]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,8,29]]}},"alternative-id":["10.1145\/2897517"],"URL":"https:\/\/doi.org\/10.1145\/2897517","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2016,8,29]]},"assertion":[{"value":"2015-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}