Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
From MaRDI portal
Publication:375997
DOI10.1007/S11590-012-0568-3zbMATH Open1274.90238OpenAlexW1991582041MaRDI QIDQ375997FDOQ375997
Authors: Fernando Afonso Santos, Alexandre Salles da Cunha, Geraldo Robson Mateus 
Publication date: 1 November 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0568-3
Recommendations
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Lower and upper bounds for the two-echelon capacitated location-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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- 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
- Branch-and-price: Column generation for solving huge integer programs
- Variable neighborhood search
- On the capacitated vehicle routing problem
- Greedy randomized adaptive search procedures
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A novel column generation algorithm for the vehicle routing problem with cross-docking
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New families of valid inequalities for the two-echelon vehicle routing problem
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- A Brunn-Minkowski inequality for the Monge-Ampère eigenvalue
Cited In (18)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
- New valid inequalities for the two-echelon capacitated vehicle routing problem
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach
- Two-echelon vehicle routing problem with satellite bi-synchronization
- Two-echelon vehicle routing problems: a literature review
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A large neighbourhood based heuristic for two-echelon routing problems
- An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization
- Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions
- An exact algorithm for the two-echelon capacitated vehicle routing problem
Uses Software
This page was built for publication: Branch-and-price algorithms 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 Q375997)
