×

The probabilistic vehicle routing problem. (English) Zbl 0653.90032

Vehicle routing: Methods and studies, Stud. Manage. Sci. Syst. 16, 293-318 (1988).
[For the entire collection see Zbl 0638.00043.]
Probabilistic vehicle routing problems (PVRPs) and probabilistic traveling salesman problems (PTSPs) are important variations of their classical counterparts in which only a subset of potential customers need to be visited on any given instance of the problem. This subset is determined according to some given probability law. After describing a number of applications, several interesting properties of PTSPs and PVRPs are presented. The paper also includes brief discussions of heuristics for solving PTSPs, bounds and asymptotic results.
Reviewer: P.Jaillet

MSC:

90B35 Deterministic scheduling theory in operations research
90C35 Programming involving graphs or networks
90C15 Stochastic programming

Citations:

Zbl 0638.00043