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 条
  • [31] A heuristic for the pickup and delivery traveling salesman problem
    Renaud, J
    Boctor, FF
    Ouenniche, J
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (09) : 905 - 916
  • [32] Heuristics for the traveling salesman problem with pickup and delivery
    Gendreau, M
    Laporte, G
    Vigo, D
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (07) : 699 - 714
  • [33] The Pickup and Delivery Problem with Cross-Docking
    Santos, Fernando Afonso
    Mateus, Geraldo Robson
    da Cunha, Alexandre Salles
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 1085 - 1093
  • [34] PICKUP AND DELIVERY PROBLEM WITH SPLIT DEMAND AND TRANSFERS
    Pelikan, Jan
    KYBERNETIKA, 2013, 49 (05) : 755 - 764
  • [35] A pickup and delivery problem for ridesharing considering congestion
    Wang, X.
    Dessouky, M.
    Ordonez, F.
    TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH, 2016, 8 (05): : 259 - 269
  • [36] Collaborative multi-depot pickup and delivery vehicle routing problem with split loads and time windows
    Wang, Yong
    Li, Qin
    Guan, Xiangyang
    Fan, Jianxin
    Xu, Maozeng
    Wang, Haizhong
    KNOWLEDGE-BASED SYSTEMS, 2021, 231
  • [37] The pickup and delivery problem with time windows and transshipment
    Mitrovic-Minic, Snezana
    Laporte, Gilbert
    INFOR, 2006, 44 (03) : 217 - 227
  • [38] A metaheuristic for the pickup and delivery problem with time windows
    Li, HB
    Lim, A
    ICTAI 2001: 13TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2001, : 160 - 167
  • [39] Multicriteria pickup and delivery problem with transfer opportunity
    Shang, JS
    Cuff, CK
    COMPUTERS & INDUSTRIAL ENGINEERING, 1996, 30 (04) : 631 - 645
  • [40] Heuristics for routes generation in pickup and delivery problem
    Jan Pelikán
    Jan Fábry
    Central European Journal of Operations Research, 2012, 20 : 463 - 472