The Shared Customer Collaboration Vehicle Routing Problem

被引：73

作者：

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 条

[21] New differential approximation algorithm for k-customer vehicle routing problem
Nagoya, Takayuki
INFORMATION PROCESSING LETTERS, 2009, 109 (08) : 405 - 408
[22] Solving a Bi-Objective Rich Vehicle Routing Problem with Customer Prioritization
van Benthem, Tim
Bergman, Mark
Mes, Martijn
COMPUTATIONAL LOGISTICS, ICCL 2020, 2020, 12433 : 183 - 199
[23] Solving the Single Vehicle Routing Problem with Variable Capacity
Louveaux, Francois V.
Salazar-Gonzalez, Juan-Jose
TRANSPORTATION SCIENCE, 2016, 50 (02) : 708 - 719
[24] An auction for collaborative vehicle routing: Models and algorithms
Karels, Vincentius C. G.
Veelenturf, Lucas P.
Van Woensel, Tom
EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2020, 9 (02)
[25] Collaboration and Resource Sharing in the Multidepot Multiperiod Vehicle Routing Problem with Pickups and Deliveries
Wang, Yong
Li, Qin
Guan, Xiangyang
Fan, Jianxin
Liu, Yong
Wang, Haizhong
SUSTAINABILITY, 2020, 12 (15)
[26] Rich Vehicle Routing Problem: Survey
Caceres-Cruz, Jose
Arias, Pol
Guimarans, Daniel
Riera, Daniel
Juan, Angel A.
ACM COMPUTING SURVEYS, 2015, 47 (02)
[27] The Vehicle Routing Problem with Availability Profiles
Voigt, Stefan
Frank, Markus
Fontaine, Pirmin
Kuhn, Heinrich
TRANSPORTATION SCIENCE, 2022, 57 (02) : 531 - 551
[28] Vehicle Routing Problem and Capacitated Vehicle Routing Problem Frameworks in Fund Allocation Problem
Mamat, Nur Jumaadzan Zaleha
Jaaman, Saiful Hafizah
Ahmad, Rokiah Rozita
2016 UKM FST POSTGRADUATE COLLOQUIUM, 2016, 1784
[29] ON THE VEHICLE ROUTING PROBLEM
Netusil, Zdenek
APLIMAT 2007 - 6TH INTERNATIONAL CONFERENCE, PT I, 2007, : 95 - 100
[30] Ontology Support for Vehicle Routing Problem
Agardi, Anita
Kovacs, Laszlo
Banyai, Tamas
APPLIED SCIENCES-BASEL, 2022, 12 (23):

← 1 2 3 4 5 →