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 …

Research on dynamic and stochastic vehicle routing problems received increasing interest
in the last decade. It considers a novel problem class, aiming at an appropriate handling of …

In a more and more competitive and global world, freight transports have to overcome
increasingly long distances while at the same time becoming more reliable. In addition, a …

Abstract The Travelling Salesman Problem (TSP) is an NP-hard problem with high number
of possible solutions. The complexity increases with the factorial of n nodes in each specific …

Efficient and reliable home delivery is crucial for the economic success of online retailers.
This is especially challenging for attended home deliveries in metropolitan areas where …

In real-world environments, the variability is always present and influences the level and
cost service offered to customers. In this scenario, the present work develops a strategy to …

In this article, we investigate the vehicle routing problem with deadlines, whose goal is to
satisfy the requirements of a given number of customers with minimum travel distances while …

The vehicle routing problem with hard time windows and stochastic service times (VRPTW-
ST) introduced by Errico et al.(2013) in the form of a chance-constrained model mainly …

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 …

This paper studies a vehicle routing problem with time-dependent and stochastic travel
times. In our problem setting, customers have soft time windows. A mathematical model is …