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.028zbMATH Open1348.90086OpenAlexW2011300857MaRDI QIDQ337090FDOQ337090
Authors: Charles Gauvin, Guy Desaulniers, Michel Gendreau 
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
Recommendations
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
- Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- A Vehicle Routing Problem with Stochastic Demand
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Benchmarking optimization software with performance profiles.
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Shortest Path Problems with Resource Constraints
- Stochastic vehicle routing: A comprehensive approach
- Introduction to Stochastic Programming
- 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
- A Vehicle Routing Problem with Stochastic Demand
- Column Generation
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Stochastic vehicle routing
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- 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
- New optimality cuts for a single-vehicle stochastic routing problem
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- An exact solution framework for a broad class of vehicle routing problems
Cited In (27)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
- A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
- On the exact solution of a large class of parallel machine scheduling problems
- An exact solution approach for the inventory routing problem with time windows
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- The capacitated vehicle routing problem with evidential demands
- Title not available (Why is that?)
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- A branch-and-price approach for a multi-period vehicle routing problem
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- Research on the vehicle routing problem with interval demands
- Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach
- 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
- Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
- Exact algorithms for the chance-constrained vehicle routing problem
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- Exact Algorithms for the Chance-Constrained Vehicle Routing Problem
- Robust optimization for the vehicle routing problem with multiple deliverymen
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
Uses Software
This page was built for publication: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337090)
