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

DOI10.1016/J.ORL.2006.12.009MaRDI QIDQ2467454zbMATH OpenOpenAlexFDO

Authors Christian H. Christiansen, Jens Lysgaard

Publication date 21 January 2008

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.12.009

zbMATH Keywords

logisticsstochastic programmingrouting

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Recommendations

• The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

Cites work

• scientific article; zbMATH DE number 3770836 (Why is no real title available?)
• scientific article; zbMATH DE number 1452998 (Why is no real title available?)
• A Vehicle Routing Problem with Stochastic Demand
• A new branching strategy for time constrained routing problems with application to backhauling
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• 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
• Column Generation
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• New optimality cuts for a single-vehicle stochastic routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Routing with time windows by column generation
• Stochastic vehicle routing with modified savings algorithm
• 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
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks

Cited in

(35)

• A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• An approximation-based approach for chance-constrained vehicle routing and air traffic control problems
• Self-imposed time windows in vehicle routing problems
• A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
• Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
• Robust optimization for the vehicle routing problem with multiple deliverymen
• Solving stochastic ship fleet routing problems with inventory management using branch and price
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem
• Solving the petroleum replenishment and routing problem with variable demands and time windows
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
• A stochastic inventory routing problem for infectious medical waste collection
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• 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
• Vehicle routing with probabilistic capacity constraints
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
• A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows
• A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
• A branch-and-price approach for a multi-period vehicle routing problem
• The capacitated vehicle routing problem with evidential demands
• A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
• Two-phase variable neighborhood scatter search for the capacitated vehicle routing problem with stochastic demand

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A branch-and-price algorithm for the capacitated 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 Q2467454)