Non-myopic path-finding for shared-ride vehicles : A bi-criterion best-path approach considering travel time and proximity to demand
| 项目名称： | Non-myopic path-finding for shared-ride vehicles : A bi-criterion best-path approach considering travel time and proximity to demand |
| 摘要： | Shared-ride mobility-on-demand (MOD) services offered by transit agencies (e.g. flexible, demand-adaptive, and demand-responsive transit) and private companies (e.g. Uber Pool, Lyft Line, microtransit) have the potential to provide high-quality, convenient, and affordable on-demand mobility service to individual travelers, while simultaneously obtaining the societal benefits of decreased vehicle miles traveled, congestion, and vehicle emissions through increased vehicle occupancies. However, for shared-ride MOD services to capture these societal and individual mobility benefits, they need to be operated efficiently. Hence, this research project focuses on the efficient operation of shared-ride MOD services. Although several research studies address shared-ride MOD operational problems, this research project addresses a severely overlooked shared-ride MOD operational subproblem, namely, the assignment of individual shared-ride vehicles to network paths as they move between user pickup and drop-off locations. In practice, and in the academic literature, fleet controllers assign shared-ride vehicles (like non-shared-ride vehicles) to the shortest network path, in terms of travel time, between pickup and drop-off locations in their schedules. While this strategy/policy is intuitive, it is also myopic given the nature of shared-ride on-demand service and the (high) likelihood new users will request service as vehicles traverse network paths between pickup and drop-off locations. A non-myopic approach would anticipate the possibility of new requests and consider the proximity of network paths to future user requests (i.e. demand) when assigning shared-ride vehicles to network paths. The objective of this research is to support the efficient operation of shared-ride MOD services as a means to enhance mobility via developing a non-myopic algorithm to assign individual shared-ride vehicles to network paths considering proximity to future demand in addition to travel time. The PI’s hypothesis is that the consideration of proximity of network paths to future demand in the controller’s objective function will increase shared-ride opportunities and prevent some shared-ride vehicle detours from low-demand, high-speed areas back to high-demand, lower speed areas to pick up new requests. This should subsequently improve service quality, decrease operational costs, and decrease required fleet sizes for shared-ride MOD services. |
| 状态： | Active |
| 资金： | $53,923.00 |
| 资助组织： | California Department of Transportation |
| 项目负责人： | Brinkerhoff, Cort |
| 执行机构： | University of California, Irvine |
| 开始时间： | 20200101 |
| 预计完成日期： | 20201231 |
| 主题领域： | Passenger Transportation；Research；Transportation (General) |
相关文献
- Using Multi-Modal Path-Specific Transit Trips in Transportation Social Sustainability Analysis: Case Study in Atlanta, GA
- Dynamic Traffic Assignment vs. Frank-Wolfe Route Assignment Impacts on Emissions and Energy Inventories
- Estimating Latent Bicyclist and Pedestrian Demand for Shared Use Path Design
- Integrating Transit Paths and Transit Occupancy Data into Activity-Based Travel Demand Model Outputs to Support Sustainability Analysis across Modes
- Route Planning for Enhanced Transportation Network Utilization: A System Optimization Approach for Route Planning in Advanced Traveler Information Systems
- Simulating Bike-Transit Trips Through BikewaySim and TransitSim
检索历史
应用推荐
