Article ID Journal Published Year Pages File Type
5777217 Electronic Notes in Discrete Mathematics 2016 4 Pages PDF
Abstract
We present a Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities that relies on a new extended formulation. The aim of this latter is to tackle symmetry issues by dropping out the vehicle index. The linear relaxation is further strengthened by adding valid inequalities.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities
Authors
, , , ,