An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
From MaRDI portal
Publication:2337401
DOI10.1016/j.cor.2019.104833zbMath1458.90118OpenAlexW2949867951WikidataQ126984278 ScholiaQ126984278MaRDI QIDQ2337401
Guillaume Marques, Jean-Christophe Deschamps, Ruslan Sadykov, 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items
A concise guide to existing and emerging vehicle routing problem variants, Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions, A generic exact solver for vehicle routing and related problems, 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
Uses Software
Cites Work
- A survey on two-echelon routing problems
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A large neighbourhood based heuristic for two-echelon routing problems
- A branch and bound algorithm for the capacitated vehicle routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- Limited memory rank-1 cuts for vehicle routing problems
- A computational comparison of flow formulations for the capacitated location-routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A generic exact solver for Vehicle Routing and related problems
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A unified exact method for solving different classes of vehicle routing problems
- Improved branch-cut-and-price for capacitated vehicle routing
- Projection results for vehicle routing
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
- JuMP: A Modeling Language for Mathematical Optimization
