Adaptive large neighborhood search for service technician routing and scheduling problems
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.
KeywordsLarge neighborhood search Service technician routing and scheduling Vehicle routing Metaheuristics
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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