An Exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier
Said Dabia  1, *@  , David Lai  2, *@  , Daniele Vigo  3@  
1 : VU University Amsterdam  -  Website
VU University Amsterdam De Boelelaan 1105 1081 HV Amsterdam The Netherlands -  Netherlands
2 : VU Amsterdam
3 : University of Bologna
* : Corresponding author

The Vehicle Routing Problem with Private Fleet and Common Carrier (VRPPC) is a generalization of the classical Vehicle Routing Problem in which the owner of a private fleet can either visit a customer with one of his vehicles or assign the customer to a common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economically convenient to do so. The owner's objective is to minimize the variable and fixed costs for operating his fleet plus the total cost charged by the common carrier. This family of problems has many practical applications, particularly in the design of last mile distribution services, and has received some attention in the literature, where some heuristics were proposed. We extend here the VRPPC by considering more realistic cost structures that account for quantity discounts on outsourcing costs and by considering time windows resulting in a Rich VRPPC (RVRPPC). We present an exact approach based on a branch-and-cut-and-price algorithm for the RVRPPC, and test the algorithm on instances from the literature.

Online user: 1 RSS Feed