Non-myopic Pathfinding for Shared-Ride Vehicles: A Bi-Criteria Best-Path Approach Considering Travel Time and Proximity to Demand [Research Brief]

Details

• Creators:
  Hyland, Michael ; Yang, Dingtong ; Sarma, Navjyoth
• Corporate Creators:
  METRANS Transportation Center (Calif.) ; Pacific Southwest Region 9 UTC, University of Southern California ; University of California, Irvine
• Corporate Contributors:
  United States. Department of Transportation. Office of the Assistant Secretary for Research and Technology ; United States. Department of Transportation. University Transportation Centers (UTC) Program
• Subject/TRT Terms:
  • Mobility
  • Shared mobility
  • Travel behavior
  • Ridesharing
  • Optimization Bi-criteria routing
  • Pooling
  • Vehicle routing
• Resource Type:
  Brief
• Geographical Coverage:
  United States;California
• Edition:
  Research Brief
• Corporate Publisher:
  METRANS Transportation Center (Calif.)
• Abstract:
  The overarching goal of this research project is to improve the operational efficiency of shared-ride mobility-on-demand services (SRMoDS) like UberPool and Lyft Line, in order to increase vehicle occupancies and decrease vehicle mileage. To meet this goal, the objective of this study is to develop a network pathfinding algorithm that considers both a network path’s travel time and its proximity to potential future demand (i.e., travel requests), as opposed to a conventional shortest path algorithm that solely considers travel time.
• Format:
  PDF
• Funding:
  69A3551747109;Caltrans contract 65A06
• Download URL:
  https://rosap.ntl.bts.gov/view/dot/67965/dot_67965_DS1.pdf
• File Type:
  [PDF - 293.95 KB]
• Collection(s):
  University Transportation Centers
• Main Document Checksum:
  urn:sha-512:6414cf6849c85a3ced68419b568d12edd3842a4ae10ddc59f2ef16b30cf0b8c021dca6b61cc9e370e3a75e009bee778118746cb49f198c1afa000c1470527e5b