Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. Whereas neighborhood exploration procedures are well-developed for problems with indi…
We consider the vehicle routing problem with stochastic demands (VRPSD), a problem in which customer demands are known in distribution at the route planning stage and revealed during route executio…
Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependent routing followe…