A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem

DOI10.1016/j.cor.2015.04.023zbMath1349.90067OpenAlexW1756646734MaRDI QIDQ342059

Mohammad Hasan, M. Dambrine

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2434/609731

zbMATH Keywords

vehicle routing problemsbranch-price-and-cut algorithmmultiple commodities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (7)

The commodity-split multi-compartment capacitated arc routing problem ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles ⋮ Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem ⋮ Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Adaptive large neighborhood search for the commodity constrained split delivery VRP

Uses Software

• VRP

Cites Work

• Vehicle routing with compartments: applications, modelling and heuristics
• On the capacitated vehicle routing problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Vehicle Routing
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Shortest path algorithms for knapsack type problems
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Column Generation
• Shortest Path Problems with Resource Constraints
• A column generation approach for the split delivery vehicle routing problem

This page was built for publication: A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem