Benefits of horizontal cooperation in dial-a-ride services

被引:35
作者
Molenbruch, Yves [1 ,2 ]
Braekers, Kris [1 ,2 ]
Caris, An [1 ]
机构
[1] Hasselt Univ, Fac Business Econ, Res Grp Logist Agoralaan Gebouw D, B-3590 Diepenbeek, Belgium
[2] Res Fdn Flanders, Egmontstr 5, B-1000 Brussels, Belgium
关键词
Dial-a-ride services; Demand-responsive transportation; Horizontal cooperation; Joint route planning; LARGE NEIGHBORHOOD SEARCH; VEHICLE-ROUTING PROBLEMS; TIME WINDOWS; LOCAL SEARCH; TRANSPORTATION; ALLOCATION; ALGORITHM; LOGISTICS; PICKUP; MODELS;
D O I
10.1016/j.tre.2017.09.001
中图分类号
F [经济];
学科分类号
02 ;
摘要
Dial-a-ride services provide collective on-demand transportation, usually tailored to the needs of people with reduced mobility. This paper investigates the operational effects of horizontal cooperation among dial-a-ride providers. The current practice is that users choose a particular provider to submit their requests. Providers operating in the same area create their routing solutions independently of each other, given their own set of customers. In contrast, horizontal cooperation through joint route planning implies that customer requests can be exchanged among providers in order to minimize the overall routing cost. In addition to quantifying the operational benefits generated by such a horizontal cooperation, this paper identifies operational characteristics that influence the magnitude of the savings. A real-life case study reveals the reasons why providers benefit from certain request exchanges, as well as the extent to which these exchanges are predictable in advance. The solutions are obtained using a large neighborhood search algorithm that performs well on benchmark data. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:97 / 119
页数:23
相关论文
共 37 条
[1]  
ANDERSON DAVIDRAY., 2010, STAT BUSINESS EC
[2]  
[Anonymous], 2008, J BETRIEBSWIRTSCHAFT, DOI DOI 10.1007/S11301-008-0036-4
[3]   Dynamic pickup and delivery problems [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) :8-15
[4]   Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots [J].
Braekers, Kris ;
Caris, An ;
Janssens, Gerrit K. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 :166-186
[5]   An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem [J].
Chassaing, M. ;
Duhamel, C. ;
Lacomme, P. .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2016, 48 :119-133
[6]   A branch-and-cut algorithm for the dial-a-ride problem [J].
Cordeau, Jean-Francois .
OPERATIONS RESEARCH, 2006, 54 (03) :573-586
[7]   A tabu search heuristic for the static multi-vehicle dial-a-ride problem [J].
Cordeau, JF ;
Laporte, G .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (06) :579-594
[8]  
Cordeau JF, 1997, NETWORKS, V30, P105, DOI 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO
[9]  
2-G
[10]  
Cruijssen F., 2007, International Journal of Physical Distribution & Logistics Management, V37, P287, DOI 10.1108/09600030710752514