A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
From MaRDI portal
Publication:337090
DOI10.1016/j.cor.2014.03.028zbMath1348.90086OpenAlexW2011300857MaRDI QIDQ337090
Michel Gendreau, Charles Gauvin, Guy Desaulniers
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.03.028
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Related Items
The capacitated vehicle routing problem with evidential demands, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, Exact Algorithms for the Chance-Constrained Vehicle Routing Problem, A branch-and-price approach for a multi-period vehicle routing problem, An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen, A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs, A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands, A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations, Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach, An exact solution approach for the inventory routing problem with time windows, Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand, The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands, On the exact solution of a large class of parallel machine scheduling problems, An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup, An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands, An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy, Exact algorithms for the chance-constrained vehicle routing problem, Research on the vehicle routing problem with interval demands, Robust optimization for the vehicle routing problem with multiple deliverymen
Uses Software
Cites Work
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- An exact solution framework for a broad class of vehicle routing problems
- Stochastic vehicle routing: A comprehensive approach
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Stochastic vehicle routing
- New optimality cuts for a single-vehicle stochastic routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Introduction to Stochastic Programming
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Column Generation
- Shortest Path Problems with Resource Constraints
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Benchmarking optimization software with performance profiles.
- A Vehicle Routing Problem with Stochastic Demand