The Shared Customer Collaboration Vehicle Routing Problem

被引：72

作者：

Fernandez, Elena ^{[1
,2
]}

Roca-Riu, Mireia ^{[1
,3
]}

Speranza, M. Grazia ^{[4
]}

机构：

[1] Barcelona Tech UPC, Dept Stat & Operat Res, Carrer Jordi Girona,1,C5-208, Barcelona 08034, Spain

[2] Barcelona Grad Sch Math BGSMath, Edifici C, Bellaterra 08193, Spain

[3] Swiss Fed Inst Technol Zurich ETHZ, Inst Transport Planning & Syst, Stefano Franscini Pl 5,HIL F 34-2, Zurich, Switzerland

[4] Univ Brescia, Dipartimento Metodi Quantitat, Contrada Santa Chiara 50, I-25122 Brescia, Italy

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2018年 / 265卷 / 03期

关键词：

Vehicle routing problem; Carriers collaboration; Mixed integer programming; Branch-and-cut algorithm; Urban logistics; HORIZONTAL COOPERATION; CARRIER COLLABORATION; REQUEST ALLOCATION; FREIGHT CARRIERS; COST ALLOCATION; MECHANISMS; LOGISTICS; ALGORITHMS;

D O I：

10.1016/j.ejor.2017.08.051

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared Customer Collaboration Vehicle Routing Problem, aims at reducing the overall operational cost in a collaboration framework among the carriers for the service of the shared customers. Alternative mathematical programming formulations are proposed for the problem that are solved with a branch-and-cut algorithm. Computational experiments on different sets of benchmark instances are run to assess the effectiveness of the formulations. Moreover, in order to estimate the savings coming from the collaboration, the optimal solutions are compared with the solutions obtained when carriers work independently from each other. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：1078 / 1093

页数：16

共 50 条

[1] A GRASPxILS for the Shared Customer Collaboration Vehicle Routing Problem
Felipe Torres-Ramos, A.
Labadie, Nacima
Velasco, Nubia
Montoya-Torres, Jairo R.
IFAC PAPERSONLINE, 2019, 52 (13): : 2608 - 2613
[2] Dynamic Vehicle Routing Problem Considering Customer Satisfaction
Pan, Jing
Huang, Min
Zhang, Qihuan
Yu, Yang
PROCEEDINGS OF THE 39TH CHINESE CONTROL CONFERENCE, 2020, : 5602 - 5606
[3] On the complexity of the k-customer vehicle routing problem
Hassin, R
Rubinstein, S
OPERATIONS RESEARCH LETTERS, 2005, 33 (01) : 71 - 76
[4] Dynamic Vehicle Routing Problem with Fuzzy Customer Response
Kim, Gitae
SUSTAINABILITY, 2023, 15 (05)
[5] The electric vehicle routing problem with shared charging stations
Koc, Cagri
Jabali, Ola
Mendoza, Jorge E.
Laporte, Gilbert
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (04) : 1211 - 1243
[6] HEURISTIC METHODS FOR VEHICLE ROUTING PROBLEM IN CARRIER COLLABORATION
Liu Ran
Jiang Zhibin
Chen Feng
Liu Liming
PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 151 - 160
[7] Stochastic customer vehicle routing problem and its algorithm analysis
Lu, Lin
Cai, Shaohong
Nanjing Hangkong Hangtian Daxue Xuebao/Journal of Nanjing University of Aeronautics and Astronautics, 2010, 42 (04): : 521 - 525
[8] Customer satisfaction in dynamic vehicle routing problem with time windows
Barkaoui, M.
Berger, J.
Boukhtouta, A.
APPLIED SOFT COMPUTING, 2015, 35 : 423 - 432
[9] Collaboration and Resource Sharing for the Multi-Depot Electric Vehicle Routing Problem with Time Windows and Dynamic Customer Demands
Wang, Yong
Chen, Can
Wei, Yuanhan
Wei, Yuanfan
Wang, Haizhong
SUSTAINABILITY, 2025, 17 (06)
[10] The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction
Fan, Jing
CEIS 2011, 2011, 15

← 1 2 3 4 5 →