Kotone Senju, Teruhiro Mizumoto, H. Suwa, Yutaka Arakawa, K. Yasumoto
{"title":"通过对潜在用户的主动出行请求解决单向汽车共享中车辆分配不均衡的设计策略","authors":"Kotone Senju, Teruhiro Mizumoto, H. Suwa, Yutaka Arakawa, K. Yasumoto","doi":"10.1109/PERCOMW.2018.8480256","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":190096,"journal":{"name":"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Designing Strategy for Resolving Maldistribution of Vehicles in One-Way Car-Sharing through Active Trip Request to Potential Users\",\"authors\":\"Kotone Senju, Teruhiro Mizumoto, H. Suwa, Yutaka Arakawa, K. Yasumoto\",\"doi\":\"10.1109/PERCOMW.2018.8480256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":190096,\"journal\":{\"name\":\"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PERCOMW.2018.8480256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2018.8480256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Designing Strategy for Resolving Maldistribution of Vehicles in One-Way Car-Sharing through Active Trip Request to Potential Users
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.