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 条
  • [21] Minimizing Latency in Online Pickup and Delivery Problem with Single Pickup Point
    Yu, Haiyan
    Luo, Xianwei
    PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019), 2019, : 488 - 493
  • [22] Efficient Neural Collaborative Search for Pickup and Delivery Problems
    Kong, Detian
    Ma, Yining
    Cao, Zhiguang
    Yu, Tianshu
    Xiao, Jianhua
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2024, 46 (12) : 11019 - 11034
  • [23] Allocating Cost to Shippers in Pickup and Delivery Service
    Liu, Ning
    Cheng, Yaorong
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019
  • [24] A hybrid tabu search for multi-depots collaborative vehicle routing problem with simultaneous pickup and delivery
    Li, Jin
    Zhang, Jianghua
    Journal of Convergence Information Technology, 2012, 7 (21) : 416 - 425
  • [25] Rolling horizon planning for a dynamic collaborative routing problem with full-truckload pickup and delivery requests
    Xin Wang
    Herbert Kopfer
    Flexible Services and Manufacturing Journal, 2015, 27 : 509 - 533
  • [26] Rolling horizon planning for a dynamic collaborative routing problem with full-truckload pickup and delivery requests
    Wang, Xin
    Kopfer, Herbert
    FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2015, 27 (04) : 509 - 533
  • [27] An Ant System for the Selective Pickup and Delivery Problem
    Chang, Yu-Wei
    Liao, Chien-Chih
    Ting, Chuan-Kang
    2016 INTERNATIONAL COMPUTER SYMPOSIUM (ICS), 2016, : 94 - 97
  • [28] Collaborative logistics pickup and delivery problem with eco-packages based on time-space network
    Wang, Yong
    Peng, Shouguo
    Guan, Xiangyang
    Fan, Jianxin
    Wang, Zheng
    Liu, Yong
    Wang, Haizhong
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 170
  • [29] Skip pickup and delivery problem with vehicles circulation
    Pelikan, Jan
    PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, : 681 - 685
  • [30] Heuristics for routes generation in pickup and delivery problem
    Pelikan, Jan
    Fabry, Jan
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2012, 20 (03) : 463 - 472