Zusammenfassung
The problem addressed in this paper extends the vehicle routing problem with private fleet and common carriers by three aspects: two types of rental options, a cost function considering volumes and distances, and volume discounts offered by the common carriers. For its solution, we present a mixed integer program and three heuristics based on Variable Neighborhood Search. The computational ...
Zusammenfassung
The problem addressed in this paper extends the vehicle routing problem with private fleet and common carriers by three aspects: two types of rental options, a cost function considering volumes and distances, and volume discounts offered by the common carriers. For its solution, we present a mixed integer program and three heuristics based on Variable Neighborhood Search. The computational analysis demonstrates the suitability of these heuristics and the positive effects of two newly introduced mechanisms. Analyzing the interdependencies between available outsourcing options and economic benefits, it shows that a subset of options is sufficient to reduce costs remarkable. (C) 2016 Elsevier Ltd. All rights reserved.