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 条
  • [41] Pickup and delivery planning for the crowdsourced freight delivery routing problem
    Zhang, Jingxian
    PLOS ONE, 2025, 20 (02):
  • [42] The Airline Container Loading Problem with pickup and delivery
    Lurkin, Virginie
    Schyns, Michael
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (03) : 955 - 965
  • [43] Pickup and delivery problem using metaheuristics techniques
    D'Souza, Craig
    Omkar, S. N.
    Senthilnath, J.
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (01) : 328 - 334
  • [44] An Evolutionary Approach for the Selective Pickup and Delivery Problem
    Liao, Xin-Lan
    Ting, Chuan-Kang
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [45] The pickup and delivery problem with time windows and transshipment
    Department of Mathematics, Simon Fraser University, 13450-102 Avenue, Surrey, BC V3T 5X3, Canada
    不详
    INFOR, 2006, 3 (217-227)
  • [46] The Pickup and Delivery Problem with Crossdock for Perishable Goods
    Gkiotsalitis, Konstantinos
    Nikolopoulou, Amalia
    2023 IEEE 26TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, ITSC, 2023, : 5113 - 5119
  • [47] Dynamic pickup-and-delivery for collaborative platforms with time travel and
    Stoia, Sara
    Lagana, Demetrio
    Ohlmann, Jeffrey W.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 322 (01) : 70 - 84
  • [48] The ground handler dock capacitated pickup and delivery problem with time windows: A collaborative framework for air cargo operations
    Bombelli, Alessandro
    Fazi, Stefano
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2022, 159
  • [49] Dynamic pickup and delivery problem for autonomous delivery robots in an airport terminal
    Jeong, Joonhwa
    Moon, Ilkyeong
    COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 196
  • [50] A Robust Pickup and Delivery Problem with Uncertain Travel Time
    Al Chami, Zaher
    Bechara, Bechara
    Manier, Herve
    Manier, Marie-Ange
    2018 IEEE 30TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2018, : 940 - 946