A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities - Mines Saint-Étienne Access content directly
Conference Papers Year : 2016

A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities

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.
No file

Dates and versions

emse-01411429 , version 1 (07-12-2016)

Identifiers

Cite

Paolo Gianessi, Alberto Ceselli, Lucas Létocart, Roberto Wolfler Calvo. A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16), Jun 2016, Gargnano, Italy. pp.93 - 96, ⟨10.1016/j.endm.2016.10.024⟩. ⟨emse-01411429⟩
137 View
2 Download

Altmetric

Share

Gmail Facebook X LinkedIn More