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.
Type de document :
Communication dans un congrès
14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16), Jun 2016, Gargnano, Italy. 55, pp.93 - 96, 〈10.1016/j.endm.2016.10.024〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01411429
Contributeur : Florent Breuil <>
Soumis le : mercredi 7 décembre 2016 - 14:47:46
Dernière modification le : lundi 4 décembre 2017 - 10:36:47

Identifiants

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. 55, pp.93 - 96, 〈10.1016/j.endm.2016.10.024〉. 〈emse-01411429〉

Partager

Métriques

Consultations de la notice

195