Exact and hybrid methods for the multiperiod field service routing problem

Central European Journal of Operations Research

Volumn 21, Issue 2, 2013, Pages 359-377

  Tricoire, Fabien ^a,e   Bostel, Nathalie ^b   Dejax, Pierre ^c   Guez, Pierre ^d  

^a UNIVERSITY OF VIENNA   (Austria)

^b UNIVERSITÉ DE NANTES   (France)

^c ECOLE DES MINES DE NANTES   (France)

^d Veolia Eau Compagnie Generale des Eaux   (France)

^e CSIRO   (Australia)

Author keywords

Branch and price; Column generation; Field service logistics; Hybrid methods; Technician routing; Vehicle routing

Indexed keywords

EID: 84874801350     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-011-0231-6     Document Type: Article

References (45)

1. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-Price: column generation for solving huge integer programs. Oper Res 46: 316-329.
2. Beltrami E, Bodin L (1974) Networks and vehicle routing for municipal waste collection. Networks 4: 65-94.
3. Bostel N, Dejax P, Guez P, Tricoire F (2008) Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem. Springer, Berlin.
4. Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 104-118.
5. Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 119-139.
6. Chao IM, Golden BL, Wasil E (1995) An improved heuristic for the period vehicle routing problem. Networks 26: 25-44.
7. Christofides N, Beasley JE (1984) The period routing problem. Networks 14(2): 237-256.
8. Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multidepot vehicle routing problems. Networks 30: 105-119.
9. Cordeau J-F, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52: 928-936.
10. Cordeau J-F, Laporte G, Pasin F, Ropke S (2009) Scheduling technicians and tasks in a telecommunications company. J Scheduling, available online.
11. Czech ZJ, Czarnas P (2002) A parallel simulated annealing for the vehicle routing problem with time windows. In: 10th Euromicro workshop on parallel, distributed and network-based processing, pp 376-383.
12. Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40: 342-354.
13. Drummond LMA, Ochi LS, Vianna DS (2001) An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Gener Comput Syst 17(4): 379-386.
14. Eglese R, McCabe C (2005) Algorithms for the vehicle routing problem with time windows and a limited number of vehicles. In: Metaheuristics international conference, Vienna.
15. Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44: 216-229.
16. Feillet D, Gendreau M, Rousseau L-M (2005) New refinements for the solution of vehicle routing problems with branch and price. Technical Report C7PQMR PO2005-08-X, Centre de Recherche sur les Transports.
17. Francis PM, Smilowitz KR, Tzur M (2006) The period vehicle routing problem with service choice. Transp Sci 40(4): 439-454.
18. Francis PM, Smilowitz KR, Tzur M (2008) The period vehicle routing problem and its extensions. In: Golde B, Raghavan S, Wasil E (eds) The vehicle routing problem. Springer, Berlin.
19. Gambardella LM, Taillard E, Agazzi G (1999) New ideas in Optimization, chapter MACS-VRPTW/a multiple ant colony system for vehicle routing problems with time windows, McGraw-Hill, pp 63-76.
20. Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting stock problem. Oper Res 9: 849-859.
21. Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem-part 2. Oper Res 11: 863-888.
22. Gilmore PC, Gomory RE (1965) Multistage cutting stock problems in two or more dimensions. Oper Res 13: 94-120.
23. Glover F, Laguna M (1997) Tabu search. Kluwer, Norwell, MA.
24. Grötschel M, Krumke SO, Rambau J, Torres LM (2002) Online-dispatching of automobile service units. In: Leopold-Wildburger U, Rendl F, Wäscher G (eds) Operations research proceedings 2002 (SOR 2002). Springer, Berlinpp, pp 166-173.
25. Hadjiconstantinou E, Baldacci R (1998) A multi-depot period vehicle routing problem arising in the utilities sector. J Oper Res Soc 49: 1239-1248.
26. Hadjiconstantinou E, Roberts D (2002) Routing under uncertainty: an application in the scheduling of field service engineers. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 331-352.
27. Hemmelmayr VC, Doerner KF, Hartl RF (2009) A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195(3): 791-802.
28. Homberger J, Gehring H (2005) A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur J Oper Res 162: 220-238.
29. Lau HC, Sim M, Teo KM (2003) Vehicle routing problem with time windows and a limited number of vehicles. Eur J Oper Res 148: 559-569.
30. Lim A, Zhang X (2005) A two-stage heuristic for the vehicle routing problem with time windows and a limited number of vehicles. In: Proceedings of the 38th Hawaii international conference on system sciences, IEEE.
31. Lim A, Wang F (2004) A smoothed dynamic tabu search embedded grasp for m-vrptw. In: Proceedings of the 16th IEEE international conference on tools with artificial intelligence (ICTAI 2004), IEEE, pp 704-708.
32. Lin S (1965) Computer solutions of the travelling salesman problem. Bell Syst Tech J 44: 2245-2269.
33. Lourenco HR, Martin OC, Stützle T (1999) Handbook of Metaheuristics, chapter Iterated Local Search, Springer, pp 321-353.
34. Minoux M (1983) Programmation Mathématique, volume 2, chapitre Programmation Linéaire généralisée et techniques de décomposition, pp 55-105.
35. Mourgaya M, Vanderbeck F (2007) Column generation based heuristic for tactical planning in multiperiod vehicle routing. Eur J Oper Res 183: 1028-1041.
36. Or I (1976) Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
37. Rochat Y, Semet F (1994) A tabu search approach for delivering pet food and flour in Switzerland. J Oper Res Soc 45: 1233-1246.
38. Rochat Y, Taillard E (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
39. Rousseau LM, Gendreau M, Pesant G, Focacci F (2004) Solving VRPTW with constraint programming based column generation. Ann Oper Res 130: 199-216.
40. Russel RA, Igo W (1979) An assignment routing problem. Networks 9(1): 1-17.
41. Savelsbergh MWP, Sol M (1998) Drive: dynamic routing of independent vehicles. Oper Res 46: 474-490.
42. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper Res 35: 254-265.
43. 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, Université de Nantes, France.
44. van Breedam A (1994) An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints. PhD Thesis, Anvers University.
45. Weintraub A, Aboud J, Fernandez C, Laporte G, Ramirez E (1999) An emergency vehicle dispatching system for an electric utility in Chile. J Oper Res Soc 50: 690-696.