Abstract
This paper introduces the vehicle routing problem with partial outsourcing (VRPPO) in which a customer can be served by a single private vehicle, by a common carrier, or by both a single private vehicle and a common carrier. As such, it is a variant of the vehicle routing problem with private fleet and common carrier (VRPPC). The objective of the VRPPO is to minimize fixed and variable costs of the private fleet plus the outsourcing cost. We propose two different path-based formulations for the VRPPO and solve these with a branch-and-price-and-cut solution method. For each path-based formulation, two different pricing procedures are designed and used when solving the linear relaxations by column generation. To assess the quality of the solution methods and gain insight in potential cost improvements compared with the VRPPC, we perform tests on two instance sets with up to 100 customers from the literature.
Original language | English |
---|---|
Pages (from-to) | 1034-1052 |
Number of pages | 19 |
Journal | Transportation Science |
Volume | 54 |
Issue number | 4 |
Early online date | 17 Jun 2020 |
DOIs | |
Publication status | Published - Aug 2020 |
Funding
Funding: This work was supported by Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Project Number 407-13-050]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/trsc.2019.0940.
Keywords
- Exact algorithms
- Outsourcing
- Private fleet and common carrier
- Split delivery
- Vehicle routing problem
Fingerprint
Dive into the research topics of 'The vehicle routing problem with partial outsourcing'. Together they form a unique fingerprint.Datasets
-
Replication data for: The Vehicle Routing Problem with Partial Outsourcing (VRPPO)
Dabia, S. (Creator), Baller, A. (Creator), Dullaert, W. (Creator) & Vigo, D. (Creator), DataverseNL, 1 Jan 2020
DOI: 10.34894/FYJJ9N
Dataset / Software: Dataset