New optimality cuts for a single-vehicle stochastic routing problem

DOI10.1023/A:1018995927636zbMath0922.90058OpenAlexW164659486MaRDI QIDQ1290168

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage, 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, Faster rollout search for the vehicle routing problem with stochastic demands and restocking, 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, Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, 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, A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration, A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands, An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy, An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, Home service routing and appointment scheduling with stochastic service times, A stochastic inventory routing problem for infectious medical waste collection, On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers