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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ehmke, J.F., Campbell, A.M., Urban, T.L.: Ensuring service levels in routing problems with time windows and stochastic travel times. Eur. J. Oper. Res. 240(2), 539–550 (2015)
Herroelen, W., Leus, R.: Project scheduling under uncertainty: survey and research potentials. Eur. J. Oper. Res. 165(2), 289–306 (2005)
Jula, H., Dessouky, M., Ioannou, P.A.: Truck route planning in nonstationary stochastic networks with time windows at customer locations. IEEE Trans. Intell. Transp. Syst. 7(1), 51–61 (2006)
Lesaint, D., Voudouris, C., Azarmi, N.: Dynamic workforce scheduling for British Telecommunications plc. Interfaces. In: INFORMS (2000)
Miranda, D.M., Conceição, S.V.: The vehicle routing problem with hard time windows and stochastic travel and service time. Expert Syst. Appl. 64, 104–116 (2016)
Bouzaiene-Ayari, B., Dror, M., Laporte, G.: Vehicle routing with stochastic demands and split deliveries. Found. Comput. Decis. Sci. 18, 63–69 (1993)
Bertsimas, D.J.: Probabilistic combinatorial optimization problems. Ph.D. Thesis, Report No. 193 (1988)
Bastian, C., Rinnooy-Kan, A.H.G.: The stochastic vehicle routing problem revisited. Eur. J. Oper. Res. 56, 407–412 (1992)
Gendreau, M., Laporte, G., Seguin, R.: A tabu search algorithm for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3), 469–477 (1996)
Gendreau, M., Laporte, G., Potvin, J-Y.: Metaheuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds.), The Vehicle Routing Problem, pp. 129–154. Society for Industrial and Applied Mathematics, Philadelphia (2002)
Chang, M.: A vehicle routing problem with time windows and stochastic demands. J. Chin. Inst. Eng. 28(5), 783–794 (2005)
Lei, H., Laporte, G., Guo, B.: The capacitated vehicle routing problem with stochastic demands and time windows. Comput. Oper. Res. 38, 1775–1783 (2011)
Li, X., Tian, P., Leung, S.C.H.: Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int. J. Prod. Econ. 125(1), 137–145 (2010)
Ji, C., Liu, J., Liret, A., Dorne, R., Owusu, G., Rana, R.: Service scheduling to minimise the risk of missing appointments. In: Conference Proceedings on Proceedings, Computing Conference (2017)
Nadarajah, S., Kotz, S.: Exact distribution of the max/min of two Gaussian random variables. IEEE Trans. Very Large Scale Integr. Syst. 16(2), 210–212 (2008)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimisation by simulated annealing. Science 220(4598), 671–680 (1983)
Cerny, V.: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45(1), 41–51 (1985)
Burkard, R.E., Rendl, F.: A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur. J. Oper. Res. 17, 169–174 (1984)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Ji, C., Mandania, R., Liu, J., Liret, A., Kern, M. (2018). Incorporating Risk in Field Services Operational Planning Process. In: Bramer, M., Petridis, M. (eds) Artificial Intelligence XXXV. SGAI 2018. Lecture Notes in Computer Science(), vol 11311. Springer, Cham. https://doi.org/10.1007/978-3-030-04191-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-04191-5_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04190-8
Online ISBN: 978-3-030-04191-5
eBook Packages: Computer ScienceComputer Science (R0)