Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times
From MaRDI portal
Publication:4994167
DOI10.1287/opre.2020.2037zbMath1466.90012OpenAlexW3132873744MaRDI QIDQ4994167
Guy Desaulniers, Borzou Rostami, Andrea Lodi, Fausto Errico
Publication date: 17 June 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.2037
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
A concise guide to existing and emerging vehicle routing problem variants, Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The Steiner travelling salesman problem with correlated costs
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Vehicle routing with stochastic time-dependent travel times
- Separating capacity constraints in the CVRP using tabu search
- Shortest paths in stochastic networks with correlated link costs
- Improved branch-cut-and-price for capacitated vehicle routing
- The symmetric quadratic traveling salesman problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Decomposition Principle for Linear Programs
- The Vehicle Routing Problem with Stochastic Travel Times
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints