The Share-a-Ride Problem: People and parcels sharing taxis

被引:188
作者
Li, Baoxiang [1 ]
Krushinsky, Dmitry [1 ]
Reijers, Hajo A. [2 ,3 ]
Van Woensel, Tom [1 ]
机构
[1] Eindhoven Univ Technol, Dept Ind Engn & Innovat Sci, NL-5612 AZ Eindhoven, Netherlands
[2] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5612 AZ Eindhoven, Netherlands
[3] Percept Software, Apeldoorn, Netherlands
关键词
Transportation; Share-a-Ride Problem; Freight insertion problem; Multi-commodity; Taxi; TIME WINDOWS;
D O I
10.1016/j.ejor.2014.03.003
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
New city logistics approaches are needed to ensure efficient urban mobility for both people and goods. Usually, these are handled independently in dedicated networks. This paper considers conceptual and mathematical models in which people and parcels are handled in an integrated way by the same taxi network. From a city perspective, this system has a potential to alleviate urban congestion and environmental pollution. From the perspective of a taxi company, new benefits from the parcel delivery service can be obtained. We propose two multi-commodity sharing models. The Share-a-Ride Problem (SARP) is discussed and defined in detail. A reduced problem based on the SARP is proposed: the Freight Insertion Problem (FIP) starts from a given route for handling people requests and inserts parcel requests into this route. We present MILP formulations and perform a numerical study of both static and dynamic scenarios. The obtained numerical results provide valuable insights into successfully implementing a taxi sharing service. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:31 / 40
页数:10
相关论文
共 11 条
[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 A. H. ;
Erera, Alan L. ;
Savelsbergh, Martin W. P. ;
Wang, Xing .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (09) :1450-1464
[3]   Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing [J].
Baugh, JW ;
Kakivaya, GKR ;
Stone, JR .
ENGINEERING OPTIMIZATION, 1998, 30 (02) :91-123
[4]   The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms [J].
Cordeau, Jean-Francois ;
Laporte, Gilbert .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2003, 1 (02) :89-101
[5]   Ridesharing: The state-of-the-art and future directions [J].
Furuhata, Masabumi ;
Dessouky, Maged ;
Ordonez, Fernando ;
Brunet, Marc-Etienne ;
Wang, Xiaoqing ;
Koenig, Sven .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 57 :28-46
[6]   A HEURISTIC ALGORITHM FOR THE MULTIVEHICLE ADVANCE REQUEST DIAL-A-RIDE PROBLEM WITH TIME WINDOWS [J].
JAW, JJ ;
ODONI, AR ;
PSARAFTIS, HN ;
WILSON, NHM .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1986, 20 (03) :243-257
[7]  
Kamar E, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P187
[8]   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
[9]   Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints [J].
Quadrifoglio, Luca ;
Dessouky, Maged M. ;
Ordonez, Fernando .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 185 (02) :481-494
[10]   An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows [J].
Ropke, Stefan ;
Pisinger, David .
TRANSPORTATION SCIENCE, 2006, 40 (04) :455-472