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

DOI10.1016/j.orl.2006.12.009zbMath1180.90050OpenAlexW2042967365MaRDI QIDQ2467454

Jens Lysgaard, Christian H. Christiansen

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

stochastic programmingroutinglogistics

Mathematics Subject Classification ID

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

Related Items (30)

Solving the petroleum replenishment and routing problem with variable demands and time windows ⋮ The capacitated vehicle routing problem with evidential demands ⋮ A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows ⋮ Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ 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 ⋮ Vehicle routing with probabilistic capacity constraints ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ A multi-space sampling heuristic 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 ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Partial-route inequalities for the multi-vehicle routing problem with stochastic demands ⋮ The Vehicle Routing Problem with Stochastic Demands and Split Deliveries ⋮ Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price ⋮ The complexity of branch-and-price algorithms for the capacitated 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 ⋮ 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 ⋮ An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems ⋮ An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy ⋮ A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands ⋮ Self-imposed time windows in vehicle routing problems ⋮ Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach ⋮ A stochastic inventory routing problem for infectious medical waste collection ⋮ Robust optimization for the vehicle routing problem with multiple deliverymen ⋮ A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Stochastic vehicle routing with modified savings algorithm
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• New optimality cuts for a single-vehicle stochastic routing problem
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• A new branching strategy for time constrained routing problems with application to backhauling
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Routing with time windows by column generation
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Column Generation
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Vehicle Routing Problem with Stochastic Demand

This page was built for publication: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands