In this paper, we present a simulation-based algorithm for
the capacitated vehicle routing problem with stochastic travel
times (CVRPSTT). One of the basic ideas of our methodology
is to consider a vehicle working time lower than the actual
maximum vehicle working time when designing CVRPSTT
solutions. In this way, the working time surplus can be used to
cope with unexpected congestions when necessary. Another
important idea is to transform the CVRPSTT instance to a
limited set of CVRPs, each of which is defined by a given
percentage of the maximum vehicle working time. Finally,
a number of numerical experiments are done in the paper
with the purpose of analyzing the efficiency of the described
methodology under different uncertainty scenarios.