Mason Archival Repository Service

A New Model for a Carpool Matching Service

Show simple item record

dc.contributor.author Xia, Jizhe
dc.contributor.author Curtin, Kevin M.
dc.contributor.author Li, Weihong
dc.contributor.author Zhao, Yonglong
dc.date.accessioned 2016-08-09T00:41:56Z
dc.date.available 2016-08-09T00:41:56Z
dc.date.issued 2015-06-30
dc.identifier.citation Xia J, Curtin KM, Li W, Zhao Y (2015) A New Model for a Carpool Matching Service. PLoS ONE 10(6): e0129257. doi:10.1371/journal.pone.0129257 en_US
dc.identifier.uri https://hdl.handle.net/1920/10339
dc.description.abstract Carpooling is an effective means of reducing traffic. A carpool team shares a vehicle for their commute, which reduces the number of vehicles on the road during rush hour periods. Carpooling is officially sanctioned by most governments, and is supported by the construction of high-occupancy vehicle lanes. A number of carpooling services have been designed in order to match commuters into carpool teams, but it known that the determination of optimal carpool teams is a combinatorially complex problem, and therefore technological solutions are difficult to achieve. In this paper, a model for carpool matching services is proposed, and both optimal and heuristic approaches are tested to find solutions for that model. The results show that different solution approaches are preferred over different ranges of problem instances. Most importantly, it is demonstrated that a new formulation and associated solution procedures can permit the determination of optimal carpool teams and routes. An instantiation of the model is presented (using the street network of Guangzhou city, China) to demonstrate how carpool teams can be determined.
dc.description.sponsorship Publication of this article was funded in part by the George Mason University Libraries Open Access Publishing Fund. en_US
dc.language.iso en_US en_US
dc.publisher Public Library of Science en_US
dc.subject Simulated annealing en_US
dc.subject Linear programming en_US
dc.subject Transportation en_US
dc.subject Roads en_US
dc.subject Computing methods en_US
dc.subject Computer networks en_US
dc.subject Fuels en_US
dc.subject Optimization en_US
dc.title A New Model for a Carpool Matching Service en_US
dc.type Article en_US
dc.identifier.doi http://dx.doi.org/10.1371/journal.pone.0129257


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


Browse

My Account

Statistics