New optimality cuts for a single-vehicle stochastic routing problem

DOI10.1023/A:1018995927636zbMATH Open0922.90058OpenAlexW164659486MaRDI QIDQ1290168FDOQ1290168

Authors: K. Appert 

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018995927636

Recommendations

• The stochastic vehicle routing problem revisited
• scientific article; zbMATH DE number 912373
• Stochastic optimization models for a single-sink transportation problem
• A new approach to partial constraint satisfaction problems
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• The Vehicle Routing Problem with Stochastic Travel Times
• AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS

zbMATH Keywords

optimality cutsroute failureinteger \(L\)-shaped methodsingle-vehicle problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cited In (25)

• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price
• An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Home service routing and appointment scheduling with stochastic service times
• 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
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
• The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
• A stochastic inventory routing problem for infectious medical waste collection
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method

This page was built for publication: New optimality cuts for a single-vehicle stochastic routing problem

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