Non-myopic Relocation of Idle Mobility-on-Demand Vehicles as a Dynamic Location-Allocation-Queueing Problem

Details

• Creators:
  Sayarshad, Hamid R ; Chow, Joseph Y J
• Corporate Creators:
  Connected Cities for Smart Mobility toward Accessible and Resilient Transportation Center (C2SMART)
• Subject/TRT Terms:
  • Algorithms
  • Demand responsive transportation
  • Mobility
  • Queuing
  • Ridesharing
  • p-median problem
  • preposition of idle vehicles
  • relocation costs
  • Lagrangian decomposition
• DOI:
  https://doi.org/10.1016/j.tre.2017.08.003
• Resource Type:
  Journal Article
• Geographical Coverage:
  United States
• Corporate Publisher:
  Connected Cities for Smart Mobility toward Accessible and Resilient Transportation Center (C2SMART)
• Abstract:
  Operation of on-demand services like taxis, dynamic ridesharing services, or vehicle sharing depends significantly on the positioning of idle vehicles to anticipate future demand and operational states. A new queueing-based formulation is proposed for the problem of relocating idle vehicles in an on-demand mobility service. The approach serves as a decision support tool for future studies in urban transport informatics and design of types of urban mobility like ridesharing, and smart taxis. A Lagrangian Decomposition heuristic is developed and compared with a relaxed lower bound solution. Using New York taxicab data, the non-myopic allocation problem reduces the cost in 27%, and 25%, as compared to the myopic case.
• Format:
  PDF
• Download URL:
  https://rosap.ntl.bts.gov/view/dot/42407/dot_42407_DS1.pdf
• File Type:
  [PDF - 1.20 MB]
• Collection(s):
  University Transportation Centers ; US Transportation Collection
• Main Document Checksum:
  urn:sha256:9d60e2c4056faa227632941671e04d48736105ff8d997913ca79aa13732d2f51