Stochastic vehicle routing problem with restocking

DOI10.1287/TRSC.34.1.99.12278MaRDI QIDQ2783878zbMATH OpenOpenAlexFDO

Authors Wen-Huei Yang, Kamlesh Mathur, Ronald H. Ballou

Publication date 17 July 2003

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.34.1.99.12278

zbMATH Keywords

heuristicstochastic vehicle routing problem

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Stochastic programming (90C15)

Review text

In this paper, a stochastic vehicle routing problem is considered. In particular, customer demand is assumed to be uncertain, and actual demand is revealed only upon the visit to the customer. Instead of adopting the simple recourse action of returning to the depot whenever the vehicle runs out of stock, the points along the route at which restocking is to occur are designed into the route. The restocking points may be before a stockout actually occurs. Two heuristic algorithms are developed to construct both single and multiple routes that minimize total travel cost. The computational results show that the heuristic procedures produce quality solutions and are efficient.

Recommendations

• Vehicle routing problem with stochastic demand
• The stochastic vehicle routing problem revisited
• A Vehicle Routing Problem with Stochastic Demand
• Stochastic vehicle routing with recourse
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• The Vehicle Routing Problem with Stochastic Travel Times
• A new approach to partial constraint satisfaction problems
• Stochastic vehicle routing

Cited in

(61)

• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
• A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
• A survey on metaheuristics for stochastic combinatorial optimization
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking
• Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• Exact algorithms for the chance-constrained vehicle routing problem
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
• A concise guide to existing and emerging vehicle routing problem variants
• A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
• Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses
• A solution method for a two-dispatch delivery problem with stochastic customers
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• Exact algorithms for the chance-constrained vehicle routing problem
• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
• An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands
• A branch-and-price approach for a multi-period vehicle routing problem
• Challenges and Advances in A Priori Routing
• AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
• 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
• Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming
• Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows
• SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS
• Technical note: Worst-case benefit of restocking for the vehicle routing problem with stochastic demands
• The distributionally robust chance-constrained vehicle routing problem
• The capacitated vehicle routing problem with stochastic demands and time windows
• A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
• Inventory Routing Problem with Non-stationary Stochastic Demands
• Routing Courier Delivery Services with Urgent 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
• Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
• Truck-drone routing problem with stochastic demand
• An evaluation of common modeling choices for the vehicle routing problem with stochastic demands
• A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse
• Stochastic vehicle routing with delivery choice
• Distributed or integrated stochastic ALNS? -- Two-stage stochastic team orienteering problem
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• Designing delivery districts for the vehicle routing problem with stochastic demands
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

This page was built for publication: Stochastic vehicle routing problem with restocking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783878)