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.

A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities / P. Gianessi, A. Ceselli, L. Létocart, R.W. Calvo. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - 55:(2016), pp. 93-96. ((Intervento presentato al 14. convegno CTW tenutosi a Gargnano nel 2016 [10.1016/j.endm.2016.10.024].

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

A. Ceselli
Secondo
;
2016

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.
Branch&Price&Cut; Column Generation; Valid Inequalities; Vehicle Routing Problem with Intermediate Replenishment Facilities
Settore INF/01 - Informatica
Settore MAT/09 - Ricerca Operativa
Article (author)
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S1571065316301809-main.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 161 kB
Formato Adobe PDF
161 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2434/472428
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact