Dynamic customer demands impose new challenges for vehicle routing optimization with time windows, in which appear dynamically within the working periods of depots. The delivery routes should be adjusted as soon possible when emerge. This study investigates a collaborative multidepot problem dynamic and windows (CMVRPDCDTW) by considering resource sharing demands. Resource across multiple servi...

The classical vehicle routing problem involves to design a set of routes for a fleet of vehicles based at one central depot that is required to service a number of geographically dispersed customers, while minimizing the total travel distance or the total distribution cost. Each route originates and terminates at the central depot and customers’ demand are known. In many practical distribution ...

In this paper we consider the vehicle routing problem with hard time windows and stochastic service times (VRPTW-ST); in this variant of the classic VRPTW the service times are random variables. In particular, given a set of vehicle routes, some of the actual service times might not lead to a feasible solution, given the customer time windows. We consider a chance-constrained program to model t...