Abstract
It is known that most traditional carpooling approaches fail to satisfy all carpooling constraints and fail to provide the best carpooling sequence to users within a reasonable duration of computing time. In recent years, a vehicle has become able to exchange its real-time traffic information with nearby vehicles via the vehicular ad hoc network (VANET) to re-calculate its path to the destination so as to save time and fuel. Here, we propose a dynamic Carpooling System with real-time Vehicular Information (CSVI), including expounding its system architecture, message flows, and carpool-matching algorithms. CSVI not only integrates with the VANET-based A* (VBA*), which is a VANET-based route-planning algorithm that we have previously proposed, but also computes carpooling sequences to minimize fuel costs by speeding up with three algorithms to satisfy four carpooling constraints. Furthermore, using historic vehicle density statistics of Taipei City, Taiwan, we perform simulations on three performance metrics versus three carpooling parameters to evaluate carpooling efficiencies of six route-planning and carpool-matching mixtures. According to these simulation results, CSVI is the best system integrating these metrics and parameters. CSVI significantly outperforms traditional carpooling approaches and consumes much less computing time than the optimal carpooling approach.
| Original language | English |
|---|---|
| Pages (from-to) | 132-142 |
| Number of pages | 11 |
| Journal | Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an |
| Volume | 42 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2019 Feb 17 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Engineering(all)
Cite this
}
Designing a dynamic carpooling system integrated with the VANET-based route-planning algorithm. / Chang, Ing-Chau; Hung, Ssu Ni; Yen, Chin En.
In: Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an, Vol. 42, No. 2, 17.02.2019, p. 132-142.Research output: Contribution to journal › Article
TY - JOUR
T1 - Designing a dynamic carpooling system integrated with the VANET-based route-planning algorithm
AU - Chang, Ing-Chau
AU - Hung, Ssu Ni
AU - Yen, Chin En
PY - 2019/2/17
Y1 - 2019/2/17
N2 - It is known that most traditional carpooling approaches fail to satisfy all carpooling constraints and fail to provide the best carpooling sequence to users within a reasonable duration of computing time. In recent years, a vehicle has become able to exchange its real-time traffic information with nearby vehicles via the vehicular ad hoc network (VANET) to re-calculate its path to the destination so as to save time and fuel. Here, we propose a dynamic Carpooling System with real-time Vehicular Information (CSVI), including expounding its system architecture, message flows, and carpool-matching algorithms. CSVI not only integrates with the VANET-based A* (VBA*), which is a VANET-based route-planning algorithm that we have previously proposed, but also computes carpooling sequences to minimize fuel costs by speeding up with three algorithms to satisfy four carpooling constraints. Furthermore, using historic vehicle density statistics of Taipei City, Taiwan, we perform simulations on three performance metrics versus three carpooling parameters to evaluate carpooling efficiencies of six route-planning and carpool-matching mixtures. According to these simulation results, CSVI is the best system integrating these metrics and parameters. CSVI significantly outperforms traditional carpooling approaches and consumes much less computing time than the optimal carpooling approach.
AB - It is known that most traditional carpooling approaches fail to satisfy all carpooling constraints and fail to provide the best carpooling sequence to users within a reasonable duration of computing time. In recent years, a vehicle has become able to exchange its real-time traffic information with nearby vehicles via the vehicular ad hoc network (VANET) to re-calculate its path to the destination so as to save time and fuel. Here, we propose a dynamic Carpooling System with real-time Vehicular Information (CSVI), including expounding its system architecture, message flows, and carpool-matching algorithms. CSVI not only integrates with the VANET-based A* (VBA*), which is a VANET-based route-planning algorithm that we have previously proposed, but also computes carpooling sequences to minimize fuel costs by speeding up with three algorithms to satisfy four carpooling constraints. Furthermore, using historic vehicle density statistics of Taipei City, Taiwan, we perform simulations on three performance metrics versus three carpooling parameters to evaluate carpooling efficiencies of six route-planning and carpool-matching mixtures. According to these simulation results, CSVI is the best system integrating these metrics and parameters. CSVI significantly outperforms traditional carpooling approaches and consumes much less computing time than the optimal carpooling approach.
UR - http://www.scopus.com/inward/record.url?scp=85061090081&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85061090081&partnerID=8YFLogxK
U2 - 10.1080/02533839.2018.1552841
DO - 10.1080/02533839.2018.1552841
M3 - Article
AN - SCOPUS:85061090081
VL - 42
SP - 132
EP - 142
JO - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers
JF - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers
SN - 0253-3839
IS - 2
ER -