Loading...
Loading...

Go to the content (press return)

The shared customer collaboration vehicle routing problem

Author
Fernandez, E.; Roca-Riu, M.; Speranza, M.
Type of activity
Journal article
Journal
European journal of operational research
Date of publication
2018-03-16
Volume
265
Number
3
First page
1078
Last page
1093
DOI
https://doi.org/10.1016/j.ejor.2017.08.051 Open in new window
Repository
http://hdl.handle.net/2117/114847 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0377221717307828?via%3Dihub Open in new window
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 ...
Citation
Fernandez, E., Roca-Riu, M., Speranza, M. The shared customer collaboration vehicle routing problem. "European journal of operational research", 16 Març 2018, vol. 265, núm. 3, p. 1078-1093.
Keywords
Branch-and-cut algorithm, Carriers collaboration, Mixed integer programming, Urban logistics, Vehicle routing problem
Group of research
GNOM - Mathematical Optimization Group

Participants