A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands

DOI10.1016/J.COR.2014.03.028MaRDI QIDQ337090zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

logisticsstochastic programmingvehicle routingbranch-cut-and-price algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

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

Cites work

• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Vehicle Routing Problem with Stochastic Demand
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• 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
• An exact solution framework for a broad class of vehicle routing problems
• Benchmarking optimization software with performance profiles.
• Column Generation
• Introduction to Stochastic Programming
• New optimality cuts for a single-vehicle stochastic routing problem
• New route relaxation and pricing strategies for the vehicle routing problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Shortest Path Problems with Resource Constraints
• Stochastic vehicle routing
• Stochastic vehicle routing: A comprehensive approach
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience

Cited in

(30)

• 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
• On the exact solution of a large class of parallel machine scheduling problems
• A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
• 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
• scientific article; zbMATH DE number 5630987 (Why is no real title available?)
• 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
• Exact algorithms for the chance-constrained vehicle routing problem
• Partial-route inequalities for the multi-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
• A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
• Research on the vehicle routing problem with interval demands
• Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach
• Exact algorithms for the chance-constrained vehicle routing problem
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
• 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
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
• Robust optimization for the vehicle routing problem with multiple deliverymen
• Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut
• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
• Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling

Describes a project that uses

Uses Software

• CVRPSP
• CVRPSEP

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)