The Cost of Continuity in the Collaborative Pickup and Delivery Problem

被引:5
作者
Gansterer, Margaretha [1 ]
Hartl, Richard F. [1 ]
Wieser, Sarah [1 ]
机构
[1] Univ Vienna, Dept Business Adm, Oskar Morgenstern Pl 1, A-1090 Vienna, Austria
来源
COMPUTATIONAL LOGISTICS (ICCL 2018) | 2018年 / 11184卷
基金
奥地利科学基金会;
关键词
Logistics; Collaboration; Centralized planning; Adaptive large neighborhood search; LARGE NEIGHBORHOOD SEARCH; VEHICLE-ROUTING PROBLEM; ALLOCATION; LOGISTICS;
D O I
10.1007/978-3-030-00898-7_15
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We assess the potential total profit in collaborative pickup and delivery problems, where carriers are willing to exchange transportation requests. For this, we design an adaptive large neighborhood search method that is used to generate solutions of publicly available but yet unsolved test instances. Our computational study reveals that collaboration profits might go up to 40% of the initial total profit, but typically come with unevenly distributed workloads. Such solution are of course not acceptable in practice. Thus, the aim of this study is to elaborate on the cost of continuity, i.e. the possibility for carriers to not deviate too much from their initial situations. Carriers might, for instance, not be willing to give up on some of their customers or want to stay with minimum profits. The rational behind keeping customers is that carriers might have long-term or particular valuable customer relationships, which they do not want to abandon. We discuss different types of continuity constraints and assess their impact on the total collaboration profit. Our computational study shows that even in the presence of continuity constraints remarkable total collaboration profits can be achieved.
引用
收藏
页码:239 / 252
页数:14
相关论文
共 41 条
[1]  
Amous M., 2017, ELECT NOTES DISCRETE, V58, P231, DOI DOI 10.1016/J.ENDM.2017.03.030
[2]  
Archetti C, 2014, MOS-SIAM SER OPTIMIZ, P273
[3]   An adaptive large neighborhood search for a vehicle routing problem with multiple routes [J].
Azi, Nabila ;
Gendreau, Michel ;
Potvin, Jean-Yves .
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 :167-173
[4]   Reducing transportation CO2 emissions through pooling of supply networks: perspectives from a case study in French retail chains [J].
Ballot, E. ;
Fontane, F. .
PRODUCTION PLANNING & CONTROL, 2010, 21 (06) :640-650
[5]  
Bektas Tolga., 2016, Green Transportation Logistics, P243, DOI [DOI 10.1007/978-3-319-17175-3_7, 10.1007/978-3-319-17175-3_7]
[6]   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
[7]   Dynamic pickup and delivery problems [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) :8-15
[8]   Solutions to the request reassignment problem in collaborative carrier networks [J].
Berger, Susanne ;
Bierwirth, Christian .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (05) :627-638
[9]  
Bo Dai, 2012, International Journal of Advanced Operations Management, V4, P62, DOI 10.1504/IJAOM.2012.045891
[10]   Improved Collaborative Transport Planning at Dutch Logistics Service Provider Fritom Comment [J].
Buijs, Paul ;
Alvarez, Jose Alejandro Lopez ;
Veenstra, Marjolein ;
Roodbergen, Kees Jan .
INTERFACES, 2016, 46 (02) :132-132