A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities

DOI10.1016/j.endm.2016.10.024zbMath1366.90013OpenAlexW2549667728MaRDI QIDQ510949

Roberto Wolfler Calvo, Lucas Létocart, Paolo Gianessi, Alberto Ceselli

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.024

zbMATH Keywords

column generationvalid inequalitiesbranch\&price\&cutvehicle routing problem with intermediate replenishment facilities

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Uses Software

• VRP
• CVRPSEP

Cites Work

• Solving shortest path problems with a weight constraint and replenishment arcs
• New exact method for large asymmetric distance-constrained vehicle routing problem
• A unified exact method for solving different classes of vehicle routing problems
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Vehicle routing problems with multiple trips

This page was built for publication: A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities