Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6895267 | European Journal of Operational Research | 2018 | 35 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Elena Fernández, Mireia Roca-Riu, M. Grazia Speranza,