A solution method for a two-dispatch delivery problem with stochastic customers

DOI10.1007/S10852-006-9051-4MaRDI QIDQ2369965zbMATH OpenOpenAlexFDO

Authors Raymond K. Cheung, Dongsheng Xu, Yongpei Guan

Publication date 21 June 2007

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-006-9051-4

zbMATH Keywords

stochastic programmingvehicle routingstochastic customers

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
• scientific article; zbMATH DE number 1195627
• The dynamic multi-period vehicle routing problem
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy

Cites work

• scientific article; zbMATH DE number 4091201 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• Dynamic vehicle routing: Status and prospects
• Introduction to Stochastic Programming
• Models and exact solutions for a class of stochastic location-routing problems
• Partially dynamic vehicle routing—models and algorithms
• Quantifying the benefits of route reoptimisation under stochastic customer demands
• Shape – A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
• Stochastic vehicle routing problem with restocking
• Stochastic vehicle routing: A comprehensive approach
• The sample average approximation method applied to stochastic routing problems: a computational study
• The sample average approximation method for stochastic discrete optimization
• The vehicle routing problem
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Vehicle-scheduling Problems with Uncertainty and Omitted Customers

Cited in

(3)

• Routing Courier Delivery Services with Urgent Demand
• Technical note: Worst-case benefit of restocking for the vehicle routing problem with stochastic demands
• A survey on metaheuristics for stochastic combinatorial optimization

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A solution method for a two-dispatch delivery problem with stochastic customers

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