This paper introduces the risk minimisation objective in the Stochastic Vehicle Routing Problem (SVRP). In the studied variant of SVRP, technicians drive to customer sites to provide service. The service times and travel times are stochastic, and a time window is required for the start of the service for each customer. Most previous research uses a chance-constrained approach to the problem. Some consider the probability of journey duration exceeding the threshold of the driver's workload while others set restrictions on the probability of individual time window constraints being violated. 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 risk and sum of risks of the tasks. The duration of each task may be considered as following 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. Therefore a multiple integral expression of the risk was derived, and this expression works whether task distribution is normal or not. Additionally a deterministic heuristic searching method was applied to solve the problem. Experiments are carried out to test the method. 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 allows organisations to pay more attention to increasing customer satisfaction and become more competitive in the market.
[1]
Mei-Shiang Chang.
A vehicle routing problem with time windows and stochastic demands
,
2005
.
[2]
Michel Gendreau,et al.
Metaheuristics for the Capacitated VRP
,
2002,
The Vehicle Routing Problem.
[3]
Moshe Dror,et al.
Vehicle routing with split deliveries
,
1994,
Discret. Appl. Math..
[4]
Xing Liu,et al.
A Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands
,
2008
.
[5]
Bo Guo,et al.
The capacitated vehicle routing problem with stochastic demands and time windows
,
2011,
Comput. Oper. Res..
[6]
Michel Gendreau,et al.
A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
,
1996,
Oper. Res..
[7]
Douglas Moura Miranda,et al.
The vehicle routing problem with hard time windows and stochastic travel and service time
,
2016,
Expert Syst. Appl..
[8]
Jan Fabian Ehmke,et al.
Ensuring service levels in routing problems with time windows and stochastic travel times
,
2015,
Eur. J. Oper. Res..
[9]
Stephen C. H. Leung,et al.
Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm
,
2010
.
[10]
David Lesaint,et al.
Dynamic Workforce Scheduling for British Telecommunications plc
,
2000,
Interfaces.
[11]
Jan Van Damme,et al.
Project scheduling under uncertainty survey and research potentials
,
2002
.
[12]
D. Bertsimas.
Probabilistic combinatorial optimization problems
,
1988
.
[13]
A. Kan,et al.
The stochastic vehicle routing problem revisited
,
1992
.