Partial-route inequalities for the multi-vehicle routing problem with stochastic demands

DOI10.1016/j.dam.2014.05.040zbMath1302.90022OpenAlexW2091219277MaRDI QIDQ406333

Walter Rei, Michel Gendreau, Ola Jabali, Gilbert Laporte

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.040

zbMATH Keywords

stochastic programmingstochastic demandgeneral partial routesinteger \(L\)-shaped algorithmlower bounding functionalsstochastic vehicle routing problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Related Items

Ensuring service levels in routing problems with time windows and stochastic travel times, The probabilistic travelling salesman problem with crowdsourcing, An integer L-shaped method for the generalized vehicle routing problem with stochastic demands, A branch-and-price approach for a multi-period vehicle routing problem, A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands, Parcel delivery cost minimization with time window constraints using trucks and drones, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, 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 bi-criteria moving-target travelling salesman problem under uncertainty, An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy, Robust optimization for the vehicle routing problem with multiple deliverymen

Uses Software

• CVRPSP

Cites Work

• Unnamed Item
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• The capacitated vehicle routing problem with stochastic demands and time windows
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The vehicle routing problem. Latest advances and new challenges.
• Partitioning procedures for solving mixed-variables programming problems
• New optimality cuts for a single-vehicle stochastic routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• The Vehicle Routing Problem
• Stochastic Vehicle Routing Problem with Restocking
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• L-Shaped Linear Programs with Applications to Optimal Control and 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 Priori Optimization
• A Vehicle Routing Problem with Stochastic Demand