No abstract

This paper presents a model for the risk minimisation objective in the Stochastic Vehicle Routing Problem (SVRP). In the studied variant of SVRP, service times and travel times are subject to stochastic events, and a time window is constraining the start time for service task. Required skill levels and task priorities increase the complexity of this problem. Most previous research uses a chance-constrained approach to the problem and their objectives are related to traditional routing costs whilst a different approach was taken in this paper. The risk of missing a task is defined as the probability that the technician assigned to the task arrives at the customer site later than the time window. The problem studied in this paper is to generate a schedule that minimises the maximum of risks and sum of risks over all the tasks considering the effect of skill levels and task priorities. The stochastic duration of each task is supposed to follow a known normal distribution. However, the distribution of the start time of the service at a customer site will not be normally distributed due to time window constraints. A method is proposed and tested to approximate the start time distribution as normal. Moreover, a linear model can be obtained assuming identical variance of task durations. Additionally Simulated Annealing method was applied to solve the problem. Results of this work have been applied to an industrial case of SVRP where field engineering individuals drive to customer sites to provide time-constrained services. This original approach gives a robust schedule and allows organisations to pay more attention to increasing customer satisfaction and become more competitive in the market.

No abstract

No abstract

No abstract