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.
Document type :
Conference papers
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-01411429
Contributor : Florent Breuil <>
Submitted on : Wednesday, December 7, 2016 - 2:47:46 PM
Last modification on : Thursday, October 17, 2019 - 12:34:31 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

353