Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problem

Hamid R. Sayarshad, Joseph Y.J. Chow

Research output: Contribution to journalArticle

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 new types of urban mobility systems like carsharing, ridesharing, and smart taxis. A Lagrangian Decomposition heuristic is developed and compared with a relaxed lower bound solution. Using New York taxicab data, the proposed algorithm reduces the cost by up to 27% compared to the myopic case.

Original languageEnglish (US)
Pages (from-to)60-77
Number of pages18
JournalTransportation Research Part E: Logistics and Transportation Review
Volume106
DOIs
StatePublished - Oct 2017

Keywords

  • Lagrangian decomposition
  • Preposition of idle vehicles
  • Relocation costs
  • p-median problem

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Fingerprint Dive into the research topics of 'Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problem'. Together they form a unique fingerprint.

  • Cite this