A New Model for a Carpool Matching Service.
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...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2015-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC4488330?pdf=render |
id |
doaj-e827137e69b14be5a220b518ec9d67b1 |
---|---|
record_format |
Article |
spelling |
doaj-e827137e69b14be5a220b518ec9d67b12020-11-24T21:23:43ZengPublic Library of Science (PLoS)PLoS ONE1932-62032015-01-01106e012925710.1371/journal.pone.0129257A New Model for a Carpool Matching Service.Jizhe XiaKevin M CurtinWeihong LiYonglong ZhaoCarpooling 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.http://europepmc.org/articles/PMC4488330?pdf=render |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jizhe Xia Kevin M Curtin Weihong Li Yonglong Zhao |
spellingShingle |
Jizhe Xia Kevin M Curtin Weihong Li Yonglong Zhao A New Model for a Carpool Matching Service. PLoS ONE |
author_facet |
Jizhe Xia Kevin M Curtin Weihong Li Yonglong Zhao |
author_sort |
Jizhe Xia |
title |
A New Model for a Carpool Matching Service. |
title_short |
A New Model for a Carpool Matching Service. |
title_full |
A New Model for a Carpool Matching Service. |
title_fullStr |
A New Model for a Carpool Matching Service. |
title_full_unstemmed |
A New Model for a Carpool Matching Service. |
title_sort |
new model for a carpool matching service. |
publisher |
Public Library of Science (PLoS) |
series |
PLoS ONE |
issn |
1932-6203 |
publishDate |
2015-01-01 |
description |
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. |
url |
http://europepmc.org/articles/PMC4488330?pdf=render |
work_keys_str_mv |
AT jizhexia anewmodelforacarpoolmatchingservice AT kevinmcurtin anewmodelforacarpoolmatchingservice AT weihongli anewmodelforacarpoolmatchingservice AT yonglongzhao anewmodelforacarpoolmatchingservice AT jizhexia newmodelforacarpoolmatchingservice AT kevinmcurtin newmodelforacarpoolmatchingservice AT weihongli newmodelforacarpoolmatchingservice AT yonglongzhao newmodelforacarpoolmatchingservice |
_version_ |
1725991476556464128 |