Adaptive large neighborhood search for service technician routing and scheduling problems

Journal of Scheduling

Volumn 15, Issue 5, 2012, Pages 579-600

  Kovacs, Attila A ^a   Parragh, Sophie N ^a   Doerner, Karl F ^b,c   Hartl, Richard F ^a  

^a UNIVERSITY OF VIENNA   (Austria)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^c UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Large neighborhood search; Metaheuristics; Service technician routing and scheduling; Vehicle routing

Indexed keywords

COMPUTATION TIME; DIFFERENT SERVICES; HIGH-QUALITY SOLUTIONS; INFRASTRUCTURE SERVICES; LARGE NEIGHBORHOOD SEARCH; META HEURISTICS; NUMBER OF SERVICES; ROUTING AND SCHEDULING; TASK DEMAND; TEAM BUILDING; TIME WINDOWS;

OUTSOURCING; SCHEDULING; VEHICLE ROUTING;

PROBLEM SOLVING;

EID: 84864682854     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-011-0246-9     Document Type: Article

References (28)

1. Archetti, C., Hertz, A., & Speranza, M. G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13, 49-76. (Pubitemid 46067452)
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.
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.
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. (Pubitemid 32827214)
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.
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.
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.
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.
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.
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.
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.
12. Kirkpatrick, S., Gelatt, C. D., Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
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. (Pubitemid 129723026)
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).
15. Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34, 2403-2435. (Pubitemid 46073431)
16. Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (2nd ed., pp. 399-419).
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.
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. (Pubitemid 44746135)
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. (Pubitemid 43132944)
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.
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.
22. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254-265.
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.
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.
25. Vansteenwegen, P., Souffriau, W., & Van Oudheusden, D. (2011). The orienteering problem: a survey. European Journal of Operational Research, 209, 1-10.
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.
27. Xu, J., & Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7, 495-509. (Pubitemid 32886781)
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.