J. Cordeau, G. Laporte, and A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows, Journal of the Operational Research Society, vol.52, issue.8, pp.928-964, 2001.
DOI : 10.1057/palgrave.jors.2601163

T. Bektas, The multiple traveling salesman problem: an overview of formulations and solution procedures, Omega, vol.34, issue.3, pp.209-228, 2006.
DOI : 10.1016/j.omega.2004.10.004

A. Carter and C. Ragsdale, Scheduling pre-printed newspaper advertising inserts using genetic algorithms, Omega, vol.30, issue.6, pp.415-436, 2002.
DOI : 10.1016/S0305-0483(02)00059-2

M. Gendreau, A. Hertz, G. Laporte, and M. Stan, A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows, Operations Research, vol.46, issue.3, pp.330-335, 1998.
DOI : 10.1287/opre.46.3.330

M. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research, vol.1, issue.1, pp.285-305, 1985.
DOI : 10.1007/BF02022044

J. Cordeau, M. Gendreau, and G. Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems, Networks, vol.30, issue.2, pp.105-124, 1997.
DOI : 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G

S. Begur, D. Miller, and J. Weaver, An Integrated Spatial DSS for Scheduling and Routing Home-Health-Care Nurses, Interfaces, vol.27, issue.4, pp.35-48, 1997.
DOI : 10.1287/inte.27.4.35

E. Cheng and J. Rich, A Home Health Care Routing and Scheduling Problem, 1998.

S. Bertels and T. Fahle, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, Computers & Operations Research, vol.33, issue.10, pp.2866-90, 2006.
DOI : 10.1016/j.cor.2005.01.015

P. Eveborn, P. Flisberg, and M. Rönnqvist, Laps Care???an operational system for staff planning of home care, European Journal of Operational Research, vol.171, issue.3, pp.962-76, 2006.
DOI : 10.1016/j.ejor.2005.01.011

Y. Kergosien, C. Lenté, and J. Billaut, Home health care problem: An extended multiple traveling salesman problem, Multidisciplinary International Conference on Scheduling : Theory and Applications, pp.10-12
URL : https://hal.archives-ouvertes.fr/hal-01025660

A. Trautsamwieser, M. Gronalt, and P. Hirsch, Securing home health care in times of natural disasters, OR Spectrum, vol.36, issue.3, pp.787-813, 2011.
DOI : 10.1007/s00291-011-0253-4

S. Nickel, M. Schröder, and J. Steeg, Mid-term and short-term planning support for home health care services, European Journal of Operational Research, vol.219, issue.3, pp.574-87, 2012.
DOI : 10.1016/j.ejor.2011.10.042

E. Beltrami and L. Bodin, Networks and vehicle routing for municipal waste collection, Networks, vol.1, issue.1, pp.65-94, 1974.
DOI : 10.1002/net.3230040106

R. Russell and W. Igo, An assignment routing problem, Networks, vol.21, issue.1, pp.1-17, 1979.
DOI : 10.1002/net.3230090102

N. Christofides and J. Beasley, The period routing problem, Networks, vol.25, issue.2, pp.237-56, 1984.
DOI : 10.1002/net.3230140205

I. Chao, B. Golden, and E. Wasil, An improved heuristic for the period vehicle routing problem, Networks, vol.12, issue.1, pp.25-44, 1995.
DOI : 10.1002/net.3230260104

M. Mourgaya and F. Vanderbeck, Column generation based heuristic for tactical planning in multi-period vehicle routing, European Journal of Operational Research, vol.183, issue.3, pp.1028-1069, 2007.
DOI : 10.1016/j.ejor.2006.02.030
URL : https://hal.archives-ouvertes.fr/inria-00342598

V. Hemmelmayr, K. Doerner, and R. Hartl, A variable neighborhood search heuristic for periodic routing problems, European Journal of Operational Research, vol.195, issue.3, pp.791-802, 2009.
DOI : 10.1016/j.ejor.2007.08.048

S. Pirkwieser and G. Raidl, Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques, Proceedings of the 8th Metaheuristic International Conference, 2009.

S. Pirkwieser and G. Raidl, Multilevel Variable Neighborhood Search for Periodic Routing Problems, Evolutionary Computation in Combinatorial Optimization, pp.226-264
DOI : 10.1007/978-3-642-12139-5_20

S. Pirkwieser and G. Raidl, A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows, Proceedings of the International Network Optimization Conference, pp.26-29, 2009.

S. Pirkwieser and G. Raidl, Matheuristics for the periodic vehicle routing problem with time windows, Proceedings of Matheuristics. 2010: third international workshop on model-based metaheuristics, pp.28-30, 2010.

D. Gulczynski, B. Golden, and E. Wasil, The period vehicle routing problem: New heuristics and real-world variants, Transportation Research Part E: Logistics and Transportation Review, vol.47, issue.5, pp.648-68, 2011.
DOI : 10.1016/j.tre.2011.02.002

T. Vidal, T. Crainic, M. Gendreau, N. Lahrichi, and W. Rei, A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems, Operations Research, vol.60, issue.3, pp.611-635, 2012.
DOI : 10.1287/opre.1120.1048

T. Vidal, T. Crainic, M. Gendreau, and C. Prins, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Computers & Operations Research, vol.40, issue.1, pp.475-89, 2013.
DOI : 10.1016/j.cor.2012.07.018

V. Cacchiani, V. Hemmelmayr, and F. Tricoire, A set-covering based heuristic algorithm for the periodic vehicle routing problem, Discrete Applied Mathematics, vol.163, issue.1, pp.53-64, 2014.
DOI : 10.1016/j.dam.2012.08.032

R. Baldacci, E. Bartolini, A. Mingozzi, and A. Valletta, An Exact Algorithm for the Period Routing Problem, Operations Research, vol.59, issue.1, pp.228-269, 2011.
DOI : 10.1287/opre.1100.0875

P. Lacomme, C. Prins, and W. Ramdane-chérif, Evolutionary algorithms for periodic arc routing problems, European Journal of Operational Research, vol.165, issue.2, pp.535-53, 2005.
DOI : 10.1016/j.ejor.2004.04.021
URL : https://hal.archives-ouvertes.fr/inria-00104119

F. Cornillier, F. Boctor, G. Laporte, and R. J. , A heuristic for the multi-period petrol station replenishment problem, European Journal of Operational Research, vol.191, issue.2, pp.295-305, 2008.
DOI : 10.1016/j.ejor.2007.08.016

E. Angelelli, N. Bianchessi, R. Mansini, and M. Speranza, Short Term Strategies for a Dynamic Multi-Period Routing Problem, Transportation Research Part C: Emerging Technologies, vol.17, issue.2, pp.106-125, 2009.
DOI : 10.1016/j.trc.2008.02.001

M. Wen, J. Cordeau, G. Laporte, and J. Larsen, The dynamic multi-period vehicle routing problem, Computers & Operations Research, vol.37, issue.9, pp.1615-1638, 2010.
DOI : 10.1016/j.cor.2009.12.002

E. Angelelli, G. Speranza, and M. , The periodic vehicle routing problem with intermediate facilities, European Journal of Operational Research, vol.137, issue.2, pp.233-280, 2002.
DOI : 10.1016/S0377-2217(01)00206-5

P. Francis, K. Smilowitz, and M. Tzur, The Period Vehicle Routing Problem with Service Choice, Transportation Science, vol.40, issue.4, pp.439-54, 2006.
DOI : 10.1287/trsc.1050.0140

B. Yu and Z. Yang, An ant colony optimization model: The period vehicle routing problem with time windows, Transportation Research Part E: Logistics and Transportation Review, vol.47, issue.2, pp.166-81, 2011.
DOI : 10.1016/j.tre.2010.09.010

P. França, M. Gendreau, G. Laporte, and F. Müller, -Traveling Salesman Problem with Minmax Objective, Transportation Science, vol.29, issue.3, pp.267-75, 1995.
DOI : 10.1287/trsc.29.3.267

S. Somhom, A. Modares, and T. Enkawa, Competition-based neural network for the multiple travelling salesmen problem with minmax objective, Computers & Operations Research, vol.26, issue.4, pp.395-407, 1999.
DOI : 10.1016/S0305-0548(98)00069-0

A. Modares, S. Somhom, and T. Enkawa, A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems, International Transactions in Operational Research, vol.5, issue.4, pp.591-606, 1999.
DOI : 10.1016/0305-0548(92)90047-9

E. Arkin, R. Hassin, and A. Levin, Approximations for minimum and min-max vehicle routing problems, Journal of Algorithms, vol.59, issue.1, pp.1-18, 2006.
DOI : 10.1016/j.jalgor.2005.01.007

B. Golden, G. Laporte, and É. Taillard, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, Computers & Operations Research, vol.24, issue.5, pp.445-52, 1997.
DOI : 10.1016/S0305-0548(96)00065-2

C. Valle, L. Martinez, A. Da-cunha, and G. Mateus, Heuristic and exact algorithms for a min???max selective vehicle routing problem, Computers & Operations Research, vol.38, issue.7, pp.1054-65, 2011.
DOI : 10.1016/j.cor.2010.10.010

Y. Dumas, J. Desrosiers, and F. Soumis, The pickup and delivery problem with time windows, European Journal of Operational Research, vol.54, issue.1, pp.7-22, 1991.
DOI : 10.1016/0377-2217(91)90319-Q

M. Savelsbergh and M. Sol, Drive: Dynamic Routing of Independent Vehicles, Operations Research, vol.46, issue.4, pp.474-90, 1998.
DOI : 10.1287/opre.46.4.474

J. Bard and A. Jarrah, Integrating commercial and residential pickup and delivery networks: A case study, Omega, vol.41, issue.4, pp.706-726, 2013.
DOI : 10.1016/j.omega.2012.09.001

R. Bent and P. Hentenryck, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Computers & Operations Research, vol.33, issue.4, pp.875-93, 2006.
DOI : 10.1016/j.cor.2004.08.001

S. Ropke, J. Cordeau, and G. Laporte, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, vol.46, issue.4, pp.258-72, 2007.
DOI : 10.1002/net.20177

S. Ropke and J. Cordeau, Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.43, issue.3, pp.267-86, 2009.
DOI : 10.1287/trsc.1090.0272

I. Gribkovskaia, G. Laporte, and A. Shlopak, A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms, Journal of the Operational Research Society, vol.6, issue.11, pp.1449-59, 2008.
DOI : 10.1137/0206041

F. Qian, I. Gribkovskaia, and G. Laporte, Passenger and pilot risk minimization in offshore helicopter transportation, Omega, vol.40, issue.5, pp.584-93, 2012.
DOI : 10.1016/j.omega.2011.11.003

H. Ma, B. Cheang, A. Lim, L. Zhang, and Y. Zhu, An investigation into the vehicle routing problem with time windows and link capacity constraints, Omega, vol.40, issue.3, pp.336-383, 2012.
DOI : 10.1016/j.omega.2011.08.003

B. Yu, Z. Yang, and B. Yao, An improved ant colony optimization for vehicle routing problem, European Journal of Operational Research, vol.196, issue.1, pp.171-177, 2009.
DOI : 10.1016/j.ejor.2008.02.028

N. Jozefowiez, F. Semet, and E. Talbi, An evolutionary algorithm for the vehicle routing problem with route balancing, European Journal of Operational Research, vol.195, issue.3, pp.761-770, 2009.
DOI : 10.1016/j.ejor.2007.06.065
URL : https://hal.archives-ouvertes.fr/hal-00831914

M. Reimann, K. Doerner, and R. Hartl, D-Ants: Savings Based Ants divide and conquer the vehicle routing problem, Computers & Operations Research, vol.31, issue.4, pp.563-91, 2004.
DOI : 10.1016/S0305-0548(03)00014-5

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.
DOI : 10.1016/S0305-0548(03)00158-8

Y. Gajpal and P. Abad, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup, Computers & Operations Research, vol.36, issue.12, pp.3215-3238, 2009.
DOI : 10.1016/j.cor.2009.02.017

D. Croce, F. Garaix, T. Grosso, and A. , Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem, Computers & Operations Research, vol.39, issue.6, pp.1213-1220, 2012.
DOI : 10.1016/j.cor.2010.10.017

J. Brandão, A tabu search algorithm for the open vehicle routing problem, European Journal of Operational Research, vol.157, issue.3, pp.552-64, 2004.
DOI : 10.1016/S0377-2217(03)00238-8

M. Gendreau, A. Hertz, and G. Laporte, New Insertion and Postoptimization Procedures for the Traveling Salesman Problem, Operations Research, vol.40, issue.6, pp.1086-94, 1992.
DOI : 10.1287/opre.40.6.1086

O. Braysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol.39, issue.1, pp.104-122, 2005.
DOI : 10.1287/trsc.1030.0056

C. Pedamallu and L. Ozdamar, Investigating a hybrid simulated annealing and local search algorithm for constrained optimization, European Journal of Operational Research, vol.185, issue.3, pp.1230-1275, 2008.
DOI : 10.1016/j.ejor.2006.06.050

L. Tseng and Y. Lin, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, vol.198, issue.1, pp.84-92, 2009.
DOI : 10.1016/j.ejor.2008.08.023

M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-65, 1987.
DOI : 10.1287/opre.35.2.254

H. Gehring and J. Homberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, 1999.

G. Paletta, A multiperiod traveling salesman problem: Heuristic algorithms, Computers & Operations Research, vol.19, issue.8, pp.789-95, 1992.
DOI : 10.1016/0305-0548(92)90018-Z

I. Chao, B. Golden, and E. Wasil, A new heuristic for the period traveling salesman problem, Computers & Operations Research, vol.22, issue.5, pp.553-65, 1995.
DOI : 10.1016/0305-0548(94)00031-3

P. Giuseppe, The period traveling salesman problem: a new heuristic algorithm, Computers & Operations Research, vol.29, pp.1343-52, 2002.

L. Bertazzi, G. Paletta, and M. Speranza, An improved heuristic for the period traveling salesman problem, Computers & Operations Research, vol.31, issue.8, pp.1215-1237, 2004.
DOI : 10.1016/S0305-0548(03)00075-3