A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
From MaRDI portal
Publication:2467454
DOI10.1016/J.ORL.2006.12.009zbMATH Open1180.90050OpenAlexW2042967365MaRDI QIDQ2467454FDOQ2467454
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
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- An Exact Algorithm 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
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Stochastic vehicle routing with modified savings algorithm
- New optimality cuts for a single-vehicle stochastic routing problem
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Routing with time windows by column generation
- 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
Cited In (32)
- 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
- Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
- A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
- Vehicle routing with probabilistic capacity constraints
- A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
- 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
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- The capacitated vehicle routing problem with evidential 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
- Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price
- A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows
- 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
- 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
- Self-imposed time windows in vehicle routing problems
- A strategic oscillation simheuristic for the time capacitated arc 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
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
- 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
- Robust optimization for the vehicle routing problem with multiple deliverymen
- A stochastic inventory routing problem for infectious medical waste collection
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
Uses Software
Recommendations
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands 👍 👎
- 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 👍 👎
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands 👍 👎
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem 👍 👎
- 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 👍 👎
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands 👍 👎
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem 👍 👎
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)
