Abstract
In this paper, a greedy randomized heuristic is used to solve a service technician routing and scheduling problem with time windows. Time window constraints occur in many sectors such as telecommunications, maintenance, call centres, warehouses and healthcare, and is a way of service providers differentiating themselves to maintain customer satisfaction and ultimately retain market share. The greedy randomized heuristic is coupled with a simulated annealing with restart metaheuristic and tested on 36 problem instances. The greedy randomized heuristic is compared against a parallel adaptive large neighbourhood search heuristic, presenting new best known results in 18% of the datasets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fırat, M., Hurkens, C.A.J.: An improved MIP-based approach for a multi-skill workforce scheduling problem. J. Sched. 15(3), 363–380 (2012)
Pillac, V., Gueret, C., Medaglia, A.L.: A parallel matheuristic for the technician routing and scheduling problem. Optim. Lett. 7(7), 1525–1535 (2013)
Van den Bergh, J., Beliën, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367–385 (2013)
Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., Raidl, G.R.: Metaheuristics for solving a multimodal home-healthcare scheduling problem. Cent. Eur. J. Oper. Res. 23(1), 89–113 (2015)
Paraskevopoulos, D.C., Laporte, G., Repoussis, P.P., Tarantilis, C.D.: Resource constrained routing and scheduling: review and research prospects (2016)
Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F.: Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15(5), 579–600 (2012)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)
French Operational Research Society: What is the ROADEF 2007 challenge (2016). http://challenge.roadef.org/2007/en/
Pillac, V., Guéret, C., Medaglia, A.: On the dynamic technician routing and scheduling problem (2012)
Tricoire, F., Bostel, N., Dejax, P., Guez, P.: Exact and hybrid methods for the multiperiod field service routing problem. Cent. Eur. J. Oper. Res. 21(2), 359–377 (2013)
Chen, X., Thomas, B.W., Hewitt, M.: The technician routing problem with experience-based service times. Omega 61, 49–61 (2016)
Mathlouthi, I., Gendreau, M., Potvin, J.-Y.: Mixed integer programming for a multi-attribute technician routing and scheduling problem (2016)
Zamorano, E., Stolletz, R.: Branch-and-price approaches for the multiperiod technician routing and scheduling problem. Eur. J. Oper. Res. 257, 55–68 (2016)
Cordeau, J.-F., Laporte, G., Pasin, F., Ropke, S.: Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4), 393–409 (2010)
Kundu, S., Mahato, M., Mahanty, B., Acharyya, S.: Comparative performance of simulated annealing and genetic algorithm in solving nurse scheduling problem. In: Proceedings of the International MultiConference of Engineers and Computer Scientists vol. 1, pp. 96–100 (2008)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Khalfay, A., Crispin, A., Crockett, K. (2020). Solving the Service Technician Routing and Scheduling Problem with Time Windows. In: Bi, Y., Bhatia, R., Kapoor, S. (eds) Intelligent Systems and Applications. IntelliSys 2019. Advances in Intelligent Systems and Computing, vol 1037. Springer, Cham. https://doi.org/10.1007/978-3-030-29516-5_86
Download citation
DOI: https://doi.org/10.1007/978-3-030-29516-5_86
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29515-8
Online ISBN: 978-3-030-29516-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)