Vehicle routing with stochastic demands and restricted failures

Moshe Dror, Gilbert Laporte, Francois V. Louveaux

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

This paper considers a class of stochastic vehicle routing problems (SVRPs) with random demands, in which the number of potential failures per route is restricted either by the data or the problem constraints. These are realistic cases as it makes little sense to plan vehicle routes that systematically fail a large number of times. First, a chance constrained version of the problem is considered which can be solved to optimality by algorithms similar to those developed for the deterministic vehicle routing problem (VRP). Three classes of SVRP with recourse are then analyzed. In all cases, route failures can only occur at one of the last k customers of the planned route. Since in general, SVRPs are considerably more intractable than the deterministic VRPs, it is interesting to note that these realistic stochastic problems can be solved as a sequence of deterministic traveling salesman problems (TSPs). In particular, when k=1 the SVRP with recourse reduces to a single TSP.

Original languageEnglish (US)
Pages (from-to)273-283
Number of pages11
JournalZOR Zeitschrift für Operations Research Methods and Models of Operations Research
Volume37
Issue number3
DOIs
StatePublished - Oct 1993

Fingerprint

Stochastic Demand
Vehicle Routing
Vehicle routing
Vehicle Routing Problem
Traveling salesman problem
Travelling salesman problems
Optimality
Customers
Stochastic demand
Vehicle routing problem

ASJC Scopus subject areas

  • Applied Mathematics
  • Management Science and Operations Research

Cite this

Vehicle routing with stochastic demands and restricted failures. / Dror, Moshe; Laporte, Gilbert; Louveaux, Francois V.

In: ZOR Zeitschrift für Operations Research Methods and Models of Operations Research, Vol. 37, No. 3, 10.1993, p. 273-283.

Research output: Contribution to journalArticle

@article{1afd480e4bb74d22b3a619f7834f4d53,
title = "Vehicle routing with stochastic demands and restricted failures",
abstract = "This paper considers a class of stochastic vehicle routing problems (SVRPs) with random demands, in which the number of potential failures per route is restricted either by the data or the problem constraints. These are realistic cases as it makes little sense to plan vehicle routes that systematically fail a large number of times. First, a chance constrained version of the problem is considered which can be solved to optimality by algorithms similar to those developed for the deterministic vehicle routing problem (VRP). Three classes of SVRP with recourse are then analyzed. In all cases, route failures can only occur at one of the last k customers of the planned route. Since in general, SVRPs are considerably more intractable than the deterministic VRPs, it is interesting to note that these realistic stochastic problems can be solved as a sequence of deterministic traveling salesman problems (TSPs). In particular, when k=1 the SVRP with recourse reduces to a single TSP.",
author = "Moshe Dror and Gilbert Laporte and Louveaux, {Francois V.}",
year = "1993",
month = "10",
doi = "10.1007/BF01415995",
language = "English (US)",
volume = "37",
pages = "273--283",
journal = "Mathematical Methods of Operations Research",
issn = "1432-2994",
publisher = "Physica-Verlag",
number = "3",

}

TY - JOUR

T1 - Vehicle routing with stochastic demands and restricted failures

AU - Dror, Moshe

AU - Laporte, Gilbert

AU - Louveaux, Francois V.

PY - 1993/10

Y1 - 1993/10

N2 - This paper considers a class of stochastic vehicle routing problems (SVRPs) with random demands, in which the number of potential failures per route is restricted either by the data or the problem constraints. These are realistic cases as it makes little sense to plan vehicle routes that systematically fail a large number of times. First, a chance constrained version of the problem is considered which can be solved to optimality by algorithms similar to those developed for the deterministic vehicle routing problem (VRP). Three classes of SVRP with recourse are then analyzed. In all cases, route failures can only occur at one of the last k customers of the planned route. Since in general, SVRPs are considerably more intractable than the deterministic VRPs, it is interesting to note that these realistic stochastic problems can be solved as a sequence of deterministic traveling salesman problems (TSPs). In particular, when k=1 the SVRP with recourse reduces to a single TSP.

AB - This paper considers a class of stochastic vehicle routing problems (SVRPs) with random demands, in which the number of potential failures per route is restricted either by the data or the problem constraints. These are realistic cases as it makes little sense to plan vehicle routes that systematically fail a large number of times. First, a chance constrained version of the problem is considered which can be solved to optimality by algorithms similar to those developed for the deterministic vehicle routing problem (VRP). Three classes of SVRP with recourse are then analyzed. In all cases, route failures can only occur at one of the last k customers of the planned route. Since in general, SVRPs are considerably more intractable than the deterministic VRPs, it is interesting to note that these realistic stochastic problems can be solved as a sequence of deterministic traveling salesman problems (TSPs). In particular, when k=1 the SVRP with recourse reduces to a single TSP.

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

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

U2 - 10.1007/BF01415995

DO - 10.1007/BF01415995

M3 - Article

AN - SCOPUS:0000019618

VL - 37

SP - 273

EP - 283

JO - Mathematical Methods of Operations Research

JF - Mathematical Methods of Operations Research

SN - 1432-2994

IS - 3

ER -