Non-myopic Relocation of Idle Mobility-on-Demand Vehicles as a Dynamic Location-Allocation-Queueing Problem
-
2017-10-01
Details:
-
Creators:
-
Corporate Creators:
-
Subject/TRT Terms:
-
DOI:
-
Resource Type:
-
Geographical Coverage:
-
Corporate Publisher:
-
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:
-
Collection(s):
-
Main Document Checksum:
-
Download URL:
-
File Type: