An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem

DOI10.1016/J.COR.2019.104833MaRDI QIDQ2337401zbMATH OpenOpenAlexWikidataFDO

Authors Guillaume Marques, Ruslan Sadykov, Jean-Christophe Deschamps, Remy Dupas

Publication date 19 November 2019

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

Full work available at URL https://doi.org/10.1016/j.cor.2019.104833

zbMATH Keywords

branch-cut-and-pricetwo-echelon vehicle routingvalid inequalities

Mathematics Subject Classification ID

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

Recommendations

• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• New valid inequalities for the two-echelon capacitated vehicle routing problem
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• Lower and upper bounds for the two-echelon capacitated location-routing problem

Cites work

• A branch and bound algorithm for the capacitated vehicle routing problem
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A computational comparison of flow formulations for the capacitated location-routing problem
• A generic exact solver for Vehicle Routing and related problems
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
• A large neighbourhood based heuristic for two-echelon routing problems
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• A survey on two-echelon routing problems
• A unified exact method for solving different classes of vehicle routing problems
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• An evolutionary algorithm for polishing mixed integer programming solutions
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• Improved branch-cut-and-price for capacitated vehicle routing
• JuMP: a modeling language for mathematical optimization
• Limited memory rank-1 cuts for vehicle routing problems
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• New route relaxation and pricing strategies for the vehicle routing problem
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• Projection results for vehicle routing
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Cited in

(18)

• New valid inequalities for the two-echelon capacitated vehicle routing problem
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
• Two-echelon vehicle routing problems: a literature review
• A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
• A concise guide to existing and emerging vehicle routing problem variants
• A generic exact solver for vehicle routing and related problems
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• The workforce scheduling and routing problem with park-and-loop
• The two-echelon vehicle routing problem with pickups, deliveries, and deadlines
• A two-echelon multi-trip vehicle routing problem with synchronization for an integrated water- and land-based transportation system
• An exact method for the two-echelon split-delivery vehicle routing problem for liquefied natural gas delivery with the boil-off phenomenon
• A two-echelon vehicle routing problem with multi-trips, synchronisation constraints and direct deliveries, in the context of city logistics
• A multi-commodity two-echelon vehicle routing problem with commodity-wise split delivery and supply-demand mismatch

Describes a project that uses

Uses Software

• CVRPSP
• JuMP
• VRPSolver
• BaPCod
• CVRPSEP

This page was built for publication: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337401)