Journal of Scheduling

, Volume 15, Issue 5, pp 579–600 | Cite as

Adaptive large neighborhood search for service technician routing and scheduling problems

  • Attila A. Kovacs
  • Sophie N. Parragh
  • Karl F. Doerner
  • Richard F. Hartl
Article

Abstract

Motivated by the problem situation faced by infrastructure service and maintenance providers, we define the service technician routing and scheduling problem with and without team building: a given number of technicians have to complete a given number of service tasks. Each technician disposes of a number of skills at different levels and each task demands technicians that provide the appropriate skills of at least the demanded levels. Time windows at the different service sites have to be respected. In the case where a given task cannot be serviced by any of the technicians, outsourcing costs occur. In addition, in some companies technicians have to be grouped into teams at the beginning of the day since most of the tasks cannot be completed by a single technician. The objective is to minimize the sum of the total routing and outsourcing costs. We solve both problem versions by means of an adaptive large neighborhood search algorithm. It is tested on both artificial and real-world instances; high quality solutions are obtained within short computation times.

Keywords

Large neighborhood search Service technician routing and scheduling Vehicle routing Metaheuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Archetti, C., Hertz, A., & Speranza, M. G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13, 49–76. CrossRefGoogle Scholar
  2. Bostel, N., Dejax, P., Guez, P., & Tricoire, F. (2008). Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In B. Golden, S. Raghavan, & E. A. Wasil (Eds.), Operations research/computer science interfaces: Vol. 43. The vehicle routing problem: latest advances and new challenges (pp. 503–525). New York: Springer. CrossRefGoogle Scholar
  3. Cook, W., & Rich, J. L. (1999). A parallel cutting plane algorithm for the vehicle routing problem with time windows. Technical Report, Computational and Applied Mathematics, Rice University, Houston, TX. Google Scholar
  4. Cordeau, J.-F., & Laporte, G. (2001). A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR. Information Systems and Operational Research, 39, 292–298. Google Scholar
  5. Cordeau, J.-F., Laporte, G., & Mercier, A. (2004). Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. Journal of the Operational Research Society, 55, 542–546. CrossRefGoogle Scholar
  6. Cordeau, J.-F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13, 393–409. CrossRefGoogle Scholar
  7. Côté, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). Large neighborhood search for the single vehicle pickup and delivery problem with multiple loading stacks. Technical Report CIRRELT-2009-47. Google Scholar
  8. Grötschel, M., Krumke, S. O., Rambau, J., & Torres, L. M. (2002). Online-dispatching of automobile service units. In U. Leopold-Wildburger, F. Rendl, & G. Wäscher (Eds.), Operations research proceedings 2002 (SOR 2002) (pp. 166–173). Berlin: Springer. Google Scholar
  9. Hadjiconstantinou, E., & Roberts, D. (2002). Routing under uncertainty: An application in the scheduling of field service engineers. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications. The vehicle routing problem (pp. 331–352). Philadelphia: SIAM. CrossRefGoogle Scholar
  10. Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008). Subset-row inequalities applied to the vehicle routing problem with time windows. Operations Research, 56, 497–511. CrossRefGoogle Scholar
  11. Kallehauge, B., Larsen, J., & Madsen, O. B. G. (2000). Lagrangean duality and non-differentiable optimization applied on routing with time windows—experimental results. Technical Report Internal report IMM-REP-2000-8, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark. Google Scholar
  12. Kirkpatrick, S., Gelatt, C. D., Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680. CrossRefGoogle Scholar
  13. Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., & Soumis, F. (1999). 2-path cuts for the vehicle routing problem with time windows. Transportation Science, 33, 101–116. CrossRefGoogle Scholar
  14. Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American mathematical society (vol. 7, pp. 48–50). Google Scholar
  15. Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34, 2403–2435. CrossRefGoogle Scholar
  16. Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (2nd ed., pp. 399–419). CrossRefGoogle Scholar
  17. Potvin, J. Y., & Rousseau, J. M. (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 66, 331–340. CrossRefGoogle Scholar
  18. Ropke, S., & Pisinger, D. (2006a). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40, 455–472. CrossRefGoogle Scholar
  19. Ropke, S., & Pisinger, D. (2006b). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171, 750–775. CrossRefGoogle Scholar
  20. Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159, 139–171. CrossRefGoogle Scholar
  21. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings CP-98, fourth international conference on principles and practice of constraint programming. Google Scholar
  22. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254–265. CrossRefGoogle Scholar
  23. Tricoire, F. (2006). Optimisation des tournées de véhicules et de personnels de maintenance: application á la distribution et au traitement des eaux. PhD thesis, École Nationale Supérieure des Techniques Industrielles et des Mines de Nantes. Google Scholar
  24. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2009). Iterated local search for the team orienteering problem with time windows. Computers & Operations Research, 36, 3281–3290. CrossRefGoogle Scholar
  25. Vansteenwegen, P., Souffriau, W., & Van Oudheusden, D. (2011). The orienteering problem: a survey. European Journal of Operational Research, 209, 1–10. CrossRefGoogle Scholar
  26. Weintraub, A., Aboud, J., Fernandez, C., Laporte, G., & Ramirez, E. (1999). An emergency vehicle dispatching system for an electric utility in Chile. Journal of the Operational Research Society, 50, 690–696. Google Scholar
  27. Xu, J., & Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7, 495–509. CrossRefGoogle Scholar
  28. Zäpfel, G., & Bögl, M. (2008). Multi-period vehicle routing and crew scheduling with outsourcing options. International Journal of Production Economics, 113, 980–996. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Attila A. Kovacs
    • 1
  • Sophie N. Parragh
    • 1
  • Karl F. Doerner
    • 2
    • 3
  • Richard F. Hartl
    • 1
  1. 1.Department of Business AdministrationUniversity of ViennaViennaAustria
  2. 2.Production and Logistics ManagementJohannes Kepler University LinzLinzAustria
  3. 3.Institute for Logistics and TransportationUniversity of HamburgHamburgGermany

Personalised recommendations