We study a vehicle routing problem with soft time windows and stochastic travel times.
In this problem, we consider stochastic travel times to obtain routes which are both efficient and reliable. In our problem setting, soft time windows allow early and late servicing at customers by incurring some penalty costs.
The objective is to minimize the sum of transportation costs and service costs.
Transportation costs result from three elements which are the total distance traveled, the number of vehicles used and the total expected overtime of the drivers.
Service costs are incurred for early and late arrivals; these correspond to time-window violations at the customers. We apply a column generation procedure to solve this prob- lem.
The master problem can be modeled as a classical set partitioning problem. The pricing subproblem, for each vehicle, corresponds to an elementary shortest path problem with resource constraints. To gen- erate an integer solution, we embed our column generation procedure within a branch-and-price method.
Computational results obtained by experimenting with well-known problem instances are reported.