Multiperiod planning and routing on a rolling horizon for field force optimization logistics

Operations Research/ Computer Science Interfaces Series

Volumn 43, Issue , 2008, Pages 503-525

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

^a UNIVERSITÉ DE NANTES   (France)

^b ECOLE DES MINES DE NANTES   (France)

^c Veolia Eau Compagnie Generale des Eaux   (France)

^d UNIVERSITY OF VIENNA   (Austria)

Author keywords

Column generation; Memetic algorithm; Multiperiod routing; Rolling horizon; Service scheduling

Indexed keywords

EID: 84888602100     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-77778-8_23     Document Type: Article

References (28)

1. T. Bektas. The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega, 34: 209-219, 2006.
2. E. Beltrami and L. Bodin. Networks and vehicle routing for municipal waste collection. Networks, 4: 65-94, 1994.
3. S. Boussier, H. Hashimoto and M. Vasquez. A greedy randomized adaptative search procedure for technicians and interventions scheduling for telecommunications. MIC07 (Seventh Metaheuristics International Conference), Montreal, June 25-29, 2007; http://www. mic2007. ca.
4. O. Bräysy. Genetic Algorithms for the Vehicle Routing Problem with Time Windows. Technical report, Dept. of Mathematics and Statistics, University of Vaasa, 2001.
5. O. Bräysy and M. Gendreau. Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Science, 119-139, 2005.
6. A. M. Campbell, L. W. Clarke and M. W. P. Savelsbergh. Inventory routing in practice, Chapter 12 inThe vehicle routing problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, 2002.
7. I. M. Chao, B. L. Golden and E. Wasil. An improved heuristic for the period vehicle routing problem. Networks, 26: 25-44, 1995.
8. J-F. Cordeau, M. Gendreau and G. Laporte. A tabu search heuristic for periodic and multidepot vehicle routing problems. Networks, 30: 105-119, 1997.
9. J-F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon and F. Soumis. VRP with Time Windows, Chapter 7 inThe vehicle routing problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, 2002.
10. M. Desrochers, J. Desrosiers, and M. M. Solomon. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40: 342-354, 1992.
11. D. Feillet, P. Dejax, M. Gendreau and C. Gueguen. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks, 44: 216-229, 2004.
12. M. Gendreau, A. Hertz and G. Laporte. New insertion and postoptimization procedures for the travelling salesman problem. Operations Research, 40: 1086-1094, 1992.
13. J. Homberger and H. Gehring. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR, 37: 297-318, 1999.
14. J. K. Lenstra, A. H. G. Rinnooy Kan. Some simple applications of the traveling salesman problem. Operational Research Quarterly, 26: 717-733, 1975.
15. M. Mourgaya, F. Vanderbeck. Column generation based heuristic for tactical planning in multi-period vehicle routing. To appear in European Journal of Operational Research, 2006.
16. Y. Rochat and E. Taillard. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1: 147-167, 1995.
17. S. Ropke, J-F. Cordeau, G. Laporte and F. Pasin. An adaptative large neighborhood search heuristic for the scheduling of technicians and interventions in a telecommunications company. MIC07 (Seventh Metaheuristics International Conference), Montreal, June 25-29, 2007.
18. L.-M. Rousseau, M. Gendreau, G. Pesant and F. Focacci. Solving VRPTWS with constraint programming based column generation. Annals of Operations Research, 130: 199-216, 2004.
19. M. M. Solomon. Algorithms for the vehicle routing and scheduling problem with time windows constraints. Operations Research, 35: 254-265, 1987.
20. H. Tang, E. Miller-Hooks, R. Tomastik. Scheduling technicians for planned maintenance of geographically distributed equipment. To appear in Transportation Research Part E, 2006.
21. P. Toth, and D. Vigo eds. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 2002.
22. F. Tricoire. Optimization 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, 2006.
23. F. Tricoire, N. Bostel, P. Dejax and P. Guez. Heuristic methods for the multiperiod service routing problem with time windows. Technical report 05/1/AUTO, École des Mines de Nantes, France, 2005.
24. F. Tricoire, N. Bostel, P. Dejax and P. Guez. An evolutionary metaheuristic for the multiperiod service routing problem with time windows. Technical report 05/5/AUTO, École des Mines de Nantes, France, 2005.
25. F. Tricoire, N. Bostel, P. Dejax and P. Guez P. A column generation method for the multiperiod service routing problem with time windows. Technical report 07/5/AUTO, École des Mines de Nantes, France, 2007.
26. A. Van Breedam. An analysis of the behavior of the heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customerrelated, and time-related constraints. Doctoral thesis, Anvers University, 1994.
27. M. Witucki, P. Dejax and M. Haouari. Un modèle et un algorithme de résolution exacte pour un problème de tournée de véhicules multipériodique: une application à la distribution des gaz industriels. Proceedings of the Congrès Franco Québécois de Génie Industriel, 1997.
28. M. Zerdin. Local search for the field-service allocation problem. MIC07 (Seventh Metaheuristics International Conference), Montreal, June 25-29, 2007.