Vehicle routing with stochastic demands: Models & computational methods

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

In this paper we provide an overview and modeling details regarding vehiclerouting in situations in which customer demand is revealed only when the vehiclearrives at the customer’s location. Given a fixed capacity vehicle, this settinggives rise to the possibility that the vehicle on arrival does not have sufficientinventory to completely supply a given customer’s demand. Such an occurrenceis called a route failure and it requires additional vehicle trips to fully replenishsuch a customer. Given a set of customers, the objective is to design vehicleroutes and response policies which minimize the expected delivery cost by afleet of fixed capacity vehicles. We survey the different problem statements andformulations. In addition, we describe a number of the algorithmic developmentsfor constructing routing solutions. Primarily we focus on stochastic programmingmodels with different recourse options. We also present a Markov decisionapproach for this problem and conclude with a challenging conjecture regardingfinite sums of random variables.

Original languageEnglish (US)
Title of host publicationInternational Series in Operations Research and Management Science
PublisherSpringer New York LLC
Pages425-449
Number of pages25
Volume46
StatePublished - 2016

Publication series

NameInternational Series in Operations Research and Management Science
Volume46
ISSN (Print)08848289

Fingerprint

Stochastic Demand
Vehicle Routing
Vehicle routing
Computational methods
Computational Methods
Customers
Sums of Random Variables
Random variables
Model
Routing
Demand model
Stochastic demand
Minimise
Costs
Modeling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Strategy and Management
  • Applied Mathematics
  • Computer Science Applications
  • Software

Cite this

Dror, M. (2016). Vehicle routing with stochastic demands: Models & computational methods. In International Series in Operations Research and Management Science (Vol. 46, pp. 425-449). (International Series in Operations Research and Management Science; Vol. 46). Springer New York LLC.

Vehicle routing with stochastic demands : Models & computational methods. / Dror, Moshe.

International Series in Operations Research and Management Science. Vol. 46 Springer New York LLC, 2016. p. 425-449 (International Series in Operations Research and Management Science; Vol. 46).

Research output: Chapter in Book/Report/Conference proceedingChapter

Dror, M 2016, Vehicle routing with stochastic demands: Models & computational methods. in International Series in Operations Research and Management Science. vol. 46, International Series in Operations Research and Management Science, vol. 46, Springer New York LLC, pp. 425-449.
Dror M. Vehicle routing with stochastic demands: Models & computational methods. In International Series in Operations Research and Management Science. Vol. 46. Springer New York LLC. 2016. p. 425-449. (International Series in Operations Research and Management Science).
Dror, Moshe. / Vehicle routing with stochastic demands : Models & computational methods. International Series in Operations Research and Management Science. Vol. 46 Springer New York LLC, 2016. pp. 425-449 (International Series in Operations Research and Management Science).
@inbook{8c13bdc00bf84fcea95c0beb6d8fc578,
title = "Vehicle routing with stochastic demands: Models & computational methods",
abstract = "In this paper we provide an overview and modeling details regarding vehiclerouting in situations in which customer demand is revealed only when the vehiclearrives at the customer’s location. Given a fixed capacity vehicle, this settinggives rise to the possibility that the vehicle on arrival does not have sufficientinventory to completely supply a given customer’s demand. Such an occurrenceis called a route failure and it requires additional vehicle trips to fully replenishsuch a customer. Given a set of customers, the objective is to design vehicleroutes and response policies which minimize the expected delivery cost by afleet of fixed capacity vehicles. We survey the different problem statements andformulations. In addition, we describe a number of the algorithmic developmentsfor constructing routing solutions. Primarily we focus on stochastic programmingmodels with different recourse options. We also present a Markov decisionapproach for this problem and conclude with a challenging conjecture regardingfinite sums of random variables.",
author = "Moshe Dror",
year = "2016",
language = "English (US)",
volume = "46",
series = "International Series in Operations Research and Management Science",
publisher = "Springer New York LLC",
pages = "425--449",
booktitle = "International Series in Operations Research and Management Science",

}

TY - CHAP

T1 - Vehicle routing with stochastic demands

T2 - Models & computational methods

AU - Dror, Moshe

PY - 2016

Y1 - 2016

N2 - In this paper we provide an overview and modeling details regarding vehiclerouting in situations in which customer demand is revealed only when the vehiclearrives at the customer’s location. Given a fixed capacity vehicle, this settinggives rise to the possibility that the vehicle on arrival does not have sufficientinventory to completely supply a given customer’s demand. Such an occurrenceis called a route failure and it requires additional vehicle trips to fully replenishsuch a customer. Given a set of customers, the objective is to design vehicleroutes and response policies which minimize the expected delivery cost by afleet of fixed capacity vehicles. We survey the different problem statements andformulations. In addition, we describe a number of the algorithmic developmentsfor constructing routing solutions. Primarily we focus on stochastic programmingmodels with different recourse options. We also present a Markov decisionapproach for this problem and conclude with a challenging conjecture regardingfinite sums of random variables.

AB - In this paper we provide an overview and modeling details regarding vehiclerouting in situations in which customer demand is revealed only when the vehiclearrives at the customer’s location. Given a fixed capacity vehicle, this settinggives rise to the possibility that the vehicle on arrival does not have sufficientinventory to completely supply a given customer’s demand. Such an occurrenceis called a route failure and it requires additional vehicle trips to fully replenishsuch a customer. Given a set of customers, the objective is to design vehicleroutes and response policies which minimize the expected delivery cost by afleet of fixed capacity vehicles. We survey the different problem statements andformulations. In addition, we describe a number of the algorithmic developmentsfor constructing routing solutions. Primarily we focus on stochastic programmingmodels with different recourse options. We also present a Markov decisionapproach for this problem and conclude with a challenging conjecture regardingfinite sums of random variables.

UR - http://www.scopus.com/inward/record.url?scp=84954481852&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84954481852&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:84954481852

VL - 46

T3 - International Series in Operations Research and Management Science

SP - 425

EP - 449

BT - International Series in Operations Research and Management Science

PB - Springer New York LLC

ER -