Modeling Framework and Decomposition Scheme for On-Demand Mobility Services with Ridesharing and Transfer

被引:11
作者
Lotfi, Sepide [1 ]
Abdelghany, Khaled [1 ]
Hashemi, Hossein [2 ]
机构
[1] Southern Methodist Univ, Dept Civil & Environm Engn, Dallas, TX 75275 USA
[2] Tiger Analyt Consulting Management, Dallas, TX USA
关键词
A-RIDE PROBLEM; VEHICLE-ROUTING PROBLEM; DESIRED DELIVERY TIMES; TO-MANY OPERATIONS; TABU SEARCH; NEIGHBORHOOD SEARCH; EXACT ALGORITHM; PICKUP; WINDOWS; OPTIMIZATION;
D O I
10.1111/mice.12366
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This article presents a modeling framework for the operations of on-demand mobility services (ODMS) in urban areas. The framework provides the capabilities to analyze ODMS operations while representing emerging services such as ridesharing and transfer. The problem is formulated as a mixed integer program and an efficient decomposition-based methodology is developed for its solution. The methodology adopts a modified version of the column generation algorithm, which implements iterative decomposition and network augmentation techniques to allow studying networks of moderate size. The results of a set of experiments considering grid and real-world networks are presented. The results show that increasing the number of passengers willing to rideshare and/or transfer improves the overall performance of ODMS as it increases number of served passengers and associated profit and reduces the number of used vehicles. Although presented as an offline planning tool, the methodology could be adopted for real-time applications as adequate computational resources become available.
引用
收藏
页码:21 / 37
页数:17
相关论文
共 50 条
[41]   A DYNAMIC-PROGRAMMING SOLUTION TO THE SINGLE VEHICLE MANY-TO-MANY IMMEDIATE REQUEST DIAL-A-RIDE PROBLEM [J].
PSARAFTIS, HN .
TRANSPORTATION SCIENCE, 1980, 14 (02) :130-154
[42]   AN EXACT ALGORITHM FOR THE SINGLE VEHICLE MANY-TO-MANY DIAL-A-RIDE PROBLEM WITH TIME WINDOWS [J].
PSARAFTIS, HN .
TRANSPORTATION SCIENCE, 1983, 17 (03) :351-357
[43]   A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment [J].
Qu, Yuan ;
Bard, Jonathan F. .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (10) :2439-2456
[44]   Models and branch-and-cut algorithms for pickup and delivery problems with time windows [J].
Ropke, Stefan ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
NETWORKS, 2007, 49 (04) :258-272
[45]   Quantifying the benefits of vehicle pooling with shareability networks [J].
Santi, Paolo ;
Resta, Giovanni ;
Szell, Michael ;
Sobolevsky, Stanislav ;
Strogatz, Steven H. ;
Ratti, Carlo .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2014, 111 (37) :13290-13294
[46]   Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports [J].
Schilde, M. ;
Doerner, K. F. ;
Hartl, R. F. .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (12) :1719-1730
[47]   OPTIMIZING SINGLE VEHICLE MANY-TO-MANY OPERATIONS WITH DESIRED DELIVERY TIMES .2. ROUTING [J].
SEXTON, TR ;
BODIN, LD .
TRANSPORTATION SCIENCE, 1985, 19 (04) :411-435
[48]   OPTIMIZING SINGLE VEHICLE MANY-TO-MANY OPERATIONS WITH DESIRED DELIVERY TIMES .1. SCHEDULING [J].
SEXTON, TR ;
BODIN, LD .
TRANSPORTATION SCIENCE, 1985, 19 (04) :378-410
[49]   Enhancing urban mobility: Integrating ride-sharing and public transit [J].
Stiglic, Mitja ;
Agatz, Niels ;
Savelsbergh, Martin ;
Gradisar, Mirko .
COMPUTERS & OPERATIONS RESEARCH, 2018, 90 :12-21
[50]  
Ziyi Ma, 2017, International Journal of Transportation Science and Technology, V6, P301, DOI 10.1016/j.ijtst.2017.07.001