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

DOI10.1007/s10852-006-9051-4zbMath1145.90323OpenAlexW2012030281MaRDI QIDQ2369965

Yongpei Guan, Raymond K. Cheung, Dongsheng Xu

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

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

Related Items (1)

A survey on metaheuristics for stochastic combinatorial optimization

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic vehicle routing: A comprehensive approach
• Models and exact solutions for a class of stochastic location-routing problems
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• The sample average approximation method applied to stochastic routing problems: a computational study
• Dynamic vehicle routing: Status and prospects
• The Vehicle Routing Problem
• Stochastic Vehicle Routing Problem with Restocking
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Quantifying the benefits of route reoptimisation under stochastic customer demands
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Vehicle-scheduling Problems with Uncertainty and Omitted Customers
• Introduction to Stochastic Programming
• Shape – A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
• Partially dynamic vehicle routing—models and algorithms
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

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