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 条
[1]   Optimization for dynamic ride-sharing: A review [J].
Agatz, Niels ;
Erera, Alan ;
Savelsbergh, Martin ;
Wang, Xing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :295-303
[2]   Dynamic Ride-Sharing: a Simulation Study in Metro Atlanta [J].
Agatz, Niels ;
Erera, Alan L. ;
Savelsbergh, Martin W. P. ;
Wang, Xing .
PAPERS SELECTED FOR THE 19TH INTERNATIONAL SYMPOSIUM ON TRANSPORTATION AND TRAFFIC THEORY, 2011, 17 :532-550
[3]   On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment [J].
Alonso-Mora, Javier ;
Samaranayake, Samitha ;
Wallar, Alex ;
Frazzoli, Emilio ;
Rus, Daniela .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2017, 114 (03) :462-467
[4]   A data distributed parallel algorithm for nonrigid image registration [J].
Ino, F ;
Ooyama, K ;
Hagihara, K .
PARALLEL COMPUTING, 2005, 31 (01) :19-43
[5]   An Exact Algorithm for the Pickup and Delivery Problem with Time Windows [J].
Baldacci, Roberto ;
Bartolini, Enrico ;
Mingozzi, Aristide .
OPERATIONS RESEARCH, 2011, 59 (02) :414-426
[6]   Branch-and-price: Column generation for solving huge integer programs [J].
Barnhart, C ;
Johnson, EL ;
Nemhauser, GL ;
Savelsbergh, MWP ;
Vance, PH .
OPERATIONS RESEARCH, 1998, 46 (03) :316-329
[7]   Static pickup and delivery problems: a classification scheme and survey [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Gribkovskaia, Irina ;
Laporte, Gilbert .
TOP, 2007, 15 (01) :1-31
[8]   A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
INFORMS JOURNAL ON COMPUTING, 2012, 24 (03) :343-355
[9]  
Campbell H., 2016, ARE UBER LYFT WORKIN
[10]  
Carson B., 2017, LYFT TRIPLED ITS RID