{"title":"设计共享乘车系统中的多选项取车时间方案","authors":"Jarmo Haferkamp","doi":"10.1016/j.ejtl.2024.100134","DOIUrl":null,"url":null,"abstract":"<div><p>Ride-sharing systems strive to provide affordable on-demand mobility in urban areas by effectively consolidating incoming transportation requests. To ensure that transportation offers meet travelers’ individual time requirements and constraints, service operators offer multiple pickup times from which travelers can choose. Designing such pickup time offers is challenging due to the uncertainty of both the requirements of the requesting traveler and the efficient fulfillment of future demand. We propose a parametric cost function approximation to balance between maximizing the probability that a traveler will choose an offered pickup time and minimizing the expected vehicle routing effort. We demonstrate the effectiveness of the proposed approach in a comprehensive computational study and provide managerial insights, particularly with respect to the value of information on traveler pickup time requirements.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000098/pdfft?md5=c22117fc6d0dde9006e4071384ba8cc9&pid=1-s2.0-S2192437624000098-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Design of multi-optional pickup time offers in ride-sharing systems\",\"authors\":\"Jarmo Haferkamp\",\"doi\":\"10.1016/j.ejtl.2024.100134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Ride-sharing systems strive to provide affordable on-demand mobility in urban areas by effectively consolidating incoming transportation requests. To ensure that transportation offers meet travelers’ individual time requirements and constraints, service operators offer multiple pickup times from which travelers can choose. Designing such pickup time offers is challenging due to the uncertainty of both the requirements of the requesting traveler and the efficient fulfillment of future demand. We propose a parametric cost function approximation to balance between maximizing the probability that a traveler will choose an offered pickup time and minimizing the expected vehicle routing effort. We demonstrate the effectiveness of the proposed approach in a comprehensive computational study and provide managerial insights, particularly with respect to the value of information on traveler pickup time requirements.</p></div>\",\"PeriodicalId\":45871,\"journal\":{\"name\":\"EURO Journal on Transportation and Logistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2192437624000098/pdfft?md5=c22117fc6d0dde9006e4071384ba8cc9&pid=1-s2.0-S2192437624000098-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192437624000098\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437624000098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Design of multi-optional pickup time offers in ride-sharing systems
Ride-sharing systems strive to provide affordable on-demand mobility in urban areas by effectively consolidating incoming transportation requests. To ensure that transportation offers meet travelers’ individual time requirements and constraints, service operators offer multiple pickup times from which travelers can choose. Designing such pickup time offers is challenging due to the uncertainty of both the requirements of the requesting traveler and the efficient fulfillment of future demand. We propose a parametric cost function approximation to balance between maximizing the probability that a traveler will choose an offered pickup time and minimizing the expected vehicle routing effort. We demonstrate the effectiveness of the proposed approach in a comprehensive computational study and provide managerial insights, particularly with respect to the value of information on traveler pickup time requirements.
期刊介绍：
The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
