A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities - Mines Saint-Étienne
Communication Dans Un Congrès Année : 2016

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

Résumé

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.

Domaines

Modélisation et simulation

Florent Breuil  : Connectez-vous pour contacter le contributeur

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

Soumis le : mercredi 7 décembre 2016-14:47:46

Dernière modification le : jeudi 28 novembre 2024-10:49:36

Fichier non déposé

Dates et versions

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

Identifiants

Citer

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⟩

Exporter

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
159 Consultations
2 Téléchargements

Altmetric

Partager

More