The Cost of Continuity in the Collaborative Pickup and Delivery Problem

被引:4
|
作者
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
相关论文
共 50 条
  • [1] Exact solutions for the collaborative pickup and delivery problem
    Margaretha Gansterer
    Richard F. Hartl
    Philipp E. H. Salzmann
    Central European Journal of Operations Research, 2018, 26 : 357 - 371
  • [2] Exact solutions for the collaborative pickup and delivery problem
    Gansterer, Margaretha
    Hartl, Richard F.
    Salzmann, Philipp E. H.
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2018, 26 (02) : 357 - 371
  • [3] Exact approaches for the pickup and delivery problem with loading cost
    Xue, Li
    Luo, Zhixing
    Lim, Andrew
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 59 : 131 - 145
  • [4] PICKUP AND DELIVERY PROBLEM
    Pelikan, Jan
    Fabry, Jan
    Korenar, Vaclav
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE QUANTITATIVE METHODS IN ECONOMICS (MULTIPLE CRITERIA DECISION MAKING XIV), 2008, : 220 - 224
  • [5] Pickup and Delivery Problem
    Pelikan, Jan
    Fabry, Jan
    Korenar, Vaclav
    PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2008, 2008, : 399 - 402
  • [6] PICKUP AND DELIVERY PROBLEM
    Pelikan, Jan
    Fabry, Jan
    Henzler, Jiri
    HRADECKE EKONOMICKE DNY 2009, DIL II: EKONOMICKY ROZVOJ A MANAGEMENT REGIONU. ECONOMIC DEVELOPMENT AND MANAGEMENT REGION, 2009, : 137 - 140
  • [7] Pickup and delivery problem
    University of Economics Prague, Czech Republic
    Komunikacie, 2009, 3 (36-38):
  • [8] A coalition structure algorithm for large-scale collaborative pickup and delivery problem
    Farvaresh, Hamid
    Shahmansouri, Samira
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
  • [9] THE GENERAL PICKUP AND DELIVERY PROBLEM
    SAVELSBERGH, MWP
    TRANSPORTATION SCIENCE, 1995, 29 (01) : 17 - 29
  • [10] On the reducibility of the pickup and delivery problem
    Pelikan, Jan
    PROCEEDINGS OF THE 29TH INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2011, PTS I AND II, 2011, : 540 - 544