A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities - Mines Saint-Étienne
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.

Domains

Modeling and Simulation

Florent Breuil  : Connect in order to contact the contributor

https://hal-emse.ccsd.cnrs.fr/emse-01411429

Submitted on : Wednesday, December 7, 2016-2:47:46 PM

Last modification on : Thursday, November 28, 2024-10:49:36 AM

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EMSE UNIV-PARIS13 PRES_CLERMONT CNRS OCA FAYOL-ENSMSE LIMOS DEMO-ENSMSE LIPN TDS-MACS USPC GALILE SORBONNE-PARIS-NORD CLERMONT-AUVERGNE-INP ACT-R INSTITUT-MINES-TELECOM
156 View
2 Download

Altmetric

Share

More