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

被引：72

作者：

Sayarshad, Hamid R. ^{[1
]}

Chow, Joseph Y. J. ^{[2
]}

机构：

[1] Cornell Univ, Sch Civil & Environm Engn, Ithaca, NY 14853 USA

[2] NYU, Dept Civil & Urban Engn, New York, NY USA

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2017年 / 106卷

关键词：

p-median problem; Preposition of idle vehicles; Relocation costs; Lagrangian decomposition; FACILITY LOCATION; SERVER LOCATION; MODELS; ALGORITHM; NETWORK; SYSTEM; OPTIMIZATION; SELECTION; FLEET; RIDE;

D O I：

10.1016/j.tre.2017.08.003

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

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. (C) 2017 Elsevier Ltd. All rights reserved.

引用

页码：60 / 77

页数：18