Publisher Summary This chapter discusses some of the most important vehicle routing
problem types. The vehicle routing problem lies at the heart of distribution management. It is …

Building on the work of Gendreau et al.(Eur J Oper Res 88 (1): 3–12; 1996), we review the
past 20 years of scientific literature on stochastic vehicle routing problems. The numerous …

Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve
complex optimization problems, and they are a growing research area since a few decades …

This paper examines approximate dynamic programming algorithms for the single-vehicle
routing problem with stochastic demands from a dynamic or reoptimization perspective. The …

We survey some recent research directions within the field of approximate dynamic
programming, with a particular emphasis on rollout algorithms and model predictive control …

Building on the work of Gendreau et al.(Oper Res 44 (3): 469–477, 1996), and
complementing the first part of this survey, we review the solution methods used for the past …

In this paper, we study an inventory routing problem in which a supplier has to serve a set of
retailers. For each retailer, a maximum inventory level is defined and a stochastic demand …

We consider the vehicle-routing problem with stochastic demands (VRPSD) under
reoptimization. We develop and analyze a finite-horizon Markov decision process (MDP) …

This paper proposes a dynamic vehicle routing problem (DVRP) model with nonstationary
stochastic travel times under traffic congestion. Depending on the traffic conditions, the travel …

In this paper, we explore same-day delivery routing and particularly how same-day delivery
vehicles can better integrate dynamic requests into delivery routes by taking advantage of …