TY - GEN
T1 - Designing Strategy for Resolving Maldistribution of Vehicles in One-Way Car-Sharing through Active Trip Request to Potential Users
AU - Senju, Kotone
AU - Mizumoto, Teruhiro
AU - Suwa, Hirohiko
AU - Arakawa, Yutaka
AU - Yasumoto, Keiichi
N1 - Funding Information:
ACKNOWLEDGMENT This research was partly supported by JSPS KAKENHI Grant Number 15H05708 and JST PRESTO Grant number JP16817861, Japan and the Cooperative Research Project of the Research Institute of Electrical Communication, Tohoku University. We are very thankful to Park24 for providing us data for our research.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/10/2
Y1 - 2018/10/2
N2 - Recently, one-way car-sharing service that allows a user to drop the vehicle off at the destination has been started. However, it has not been as popular as expected mainly because it cannot assure the existence of an available vehicle at the start station or a vacant parking slot at the destination station. At this moment, the company staff are responsible for moving the vehicles to certain stations manually. Therefore, it is very costly. In order to reduce costs and make more efficient use of vehicles in one-way car-sharing service, we propose to involve a future potential user to move vehicles. We assume that there exist some requested one-way trips. Our method inserts a new trip among the existing trips for maximizing the number of successful trips. This trip is called 'a system request trip.' We assume that the system request trip can be realized by changing a future schedule or asking future potential users who want to get some rewards. In this paper, we analyzed how each user uses vehicles in one-way car-sharing service by using the past data of demonstration experiment conducted by a car-sharing company in Tokyo, Japan. Based on the analysis result, we examined how to request each user.
AB - Recently, one-way car-sharing service that allows a user to drop the vehicle off at the destination has been started. However, it has not been as popular as expected mainly because it cannot assure the existence of an available vehicle at the start station or a vacant parking slot at the destination station. At this moment, the company staff are responsible for moving the vehicles to certain stations manually. Therefore, it is very costly. In order to reduce costs and make more efficient use of vehicles in one-way car-sharing service, we propose to involve a future potential user to move vehicles. We assume that there exist some requested one-way trips. Our method inserts a new trip among the existing trips for maximizing the number of successful trips. This trip is called 'a system request trip.' We assume that the system request trip can be realized by changing a future schedule or asking future potential users who want to get some rewards. In this paper, we analyzed how each user uses vehicles in one-way car-sharing service by using the past data of demonstration experiment conducted by a car-sharing company in Tokyo, Japan. Based on the analysis result, we examined how to request each user.
UR - http://www.scopus.com/inward/record.url?scp=85056471956&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85056471956&partnerID=8YFLogxK
U2 - 10.1109/PERCOMW.2018.8480256
DO - 10.1109/PERCOMW.2018.8480256
M3 - Conference contribution
AN - SCOPUS:85056471956
T3 - 2018 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2018
SP - 83
EP - 88
BT - 2018 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2018
Y2 - 19 March 2018 through 23 March 2018
ER -