An integer L-shaped method for the generalized vehicle routing problem with stochastic demands

DOI10.1016/j.endm.2016.03.033zbMath1351.90024OpenAlexW2397092633MaRDI QIDQ325450

Benjamin Biesinger, Bin Hu, Günther R. Raidl

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.033

zbMATH Keywords

stochastic optimizationinteger programmingvehicle routing problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (2)

A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment

Cites Work

• Unnamed Item
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• New optimality cuts for a single-vehicle stochastic routing problem
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands
• Stochastic Vehicle Routing Problem with Restocking
• The symmetric generalized traveling salesman polytope
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

This page was built for publication: An integer L-shaped method for the generalized vehicle routing problem with stochastic demands