R. K. Ahuja, ¨. O. Ergun, J. B. Orlin, and A. P. Punnen, A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1-3, pp.75-102, 2002.
DOI : 10.1016/S0166-218X(01)00338-9

D. Aksen, O. Kaya, and F. S. Salman, An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem, European Journal of Operational Research, vol.239, issue.2, pp.413-426, 2014.
DOI : 10.1016/j.ejor.2014.05.043

M. Allahyari, D. Salari, and . Vigo, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, European Journal of Operational Research, vol.242, issue.3, pp.756-768, 2015.
DOI : 10.1016/j.ejor.2014.10.048

D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, 2007.

C. Archetti and M. G. Speranza, A survey on matheuristics for routing problems, EURO Journal on Computational Optimization, vol.189, issue.3, pp.223-246, 2014.
DOI : 10.1007/s13675-014-0030-7

C. Archetti, D. Feillet, A. Hertz, and M. G. Speranza, The capacitated team orienteering and profitable tour problems, Journal of the Operational Research Society, vol.32, issue.6, pp.831-842, 2009.
DOI : 10.1016/j.cor.2003.11.008

URL : https://hal.archives-ouvertes.fr/hal-01299943

C. Archetti, M. G. Speranza, and D. Vigo, Vehicle Routing: Problems, Methods and Applications, chapter Vehicle routing problems with profits, pp.273-298, 2014.
DOI : 10.1137/1.9781611973594.ch10

B. Awerbuch, Y. Azar, A. Blum, and S. Vempala, New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen, SIAM Journal on Computing, vol.28, issue.1, pp.254-262, 1998.
DOI : 10.1137/S009753979528826X

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4687

M. Azi, J. Gendreau, and . Potvin, An adaptive large neighborhood search for a vehicle routing problem with multiple routes, Computers & Operations Research, vol.41, pp.167-173, 2014.
DOI : 10.1016/j.cor.2013.08.016

E. Balas, The prize collecting traveling salesman problem, Networks, vol.8, issue.6, pp.621-636, 1989.
DOI : 10.1007/BFb0120888

URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA189418

E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, pp.37-60, 1980.
DOI : 10.1007/BFb0120886

R. Baldacci, M. A. Boschetti, V. Maniezzo, and M. Zamboni, Metaheuristic Optimization Via Memory and Evolution, chapter Scatter search methods for the covering tour problem, pp.59-91, 2005.
DOI : 10.1007/0-387-23667-8_3

J. Beasley, Route first?Cluster second methods for vehicle routing, Omega, vol.11, issue.4, pp.403-408, 1983.
DOI : 10.1016/0305-0483(83)90033-6

J. Beasley and E. M. Nascimento, The Vehicle Routing-Allocation Problem: A unifying framework, Top, vol.5, issue.1, pp.65-86, 1996.
DOI : 10.1007/BF02568604

R. Bellman, Dynamic programming, 1957.

C. Blum and A. Roli, Metaheuristics in combinatorial optimization, ACM Computing Surveys, vol.35, issue.3, pp.268-308, 2003.
DOI : 10.1145/937503.937505

URL : https://hal.archives-ouvertes.fr/hal-01224683

C. Blum, M. J. Aguilera, A. Roli, and M. Samples, Hybrid Metaheuristics An Emerging Approach to Optimization, 2008.

C. Blum, J. Puchinger, G. R. Raidl, and A. Roli, Hybrid metaheuristics in combinatorial optimization: A survey, Applied Soft Computing, vol.11, issue.6, pp.4135-4151, 2011.
DOI : 10.1016/j.asoc.2011.02.032

URL : https://hal.archives-ouvertes.fr/hal-01224683

B. Boffey, F. R. Fernández-garcía, G. Laporte, J. A. Mesa, and B. Pelegrín-pelegrín, Multiobjective routing problems, Top, vol.17, issue.2, pp.167-220, 1995.
DOI : 10.1007/BFb0120690

N. Boland, J. Dethridge, and I. Dumitrescu, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, Operations Research Letters, vol.34, issue.1, pp.58-68, 2006.
DOI : 10.1016/j.orl.2004.11.011

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.3879

M. Bolduc, J. Renaud, F. Boctor, and G. Laporte, A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers, Journal of the Operational Research Society, vol.21, issue.6, pp.776-787, 2008.
DOI : 10.1057/jors.1970.52

H. Bouly, D. Dang, and A. Moukrim, A memetic algorithm for the team orienteering problem, 4OR, vol.22, issue.12, pp.49-70, 2010.
DOI : 10.1007/s10288-008-0094-4

URL : https://hal.archives-ouvertes.fr/hal-00453380

M. L. Brown and L. Fintor, U.S. screening mammography services with mobile units: results from the National Survey of Mammography Facilities., Radiology, vol.195, issue.2, pp.529-532, 1995.
DOI : 10.1148/radiology.195.2.7724778

URL : https://hal.archives-ouvertes.fr/in2p3-00119229

S. E. Butt and T. M. Cavalier, A heuristic for the multiple tour maximum collection problem, Computers & Operations Research, vol.21, issue.1, pp.101-111, 1994.
DOI : 10.1016/0305-0548(94)90065-5

V. Campos, R. Martí, J. Sánchez-oro, and A. Duarte, GRASP with path relinking for the orienteering problem, Journal of the Operational Research Society, vol.196, issue.1, pp.1800-1813, 2014.
DOI : 10.1016/j.ejor.2008.02.037

I. Chao, B. L. Golden, and E. A. , The team orienteering problem, European Journal of Operational Research, vol.88, issue.3, pp.464-474, 1996.
DOI : 10.1016/0377-2217(94)00289-4

I. Chao, B. L. Golden, and E. A. , A fast and effective heuristic for the orienteering problem, European Journal of Operational Research, vol.88, issue.3, pp.475-489, 1996.
DOI : 10.1016/0377-2217(95)00035-6

I. Chiarandini, T. Dumitrescu, and . Stützle, Hybrid Metaheuristics An Emerging Approach to Optimization, chapter Very large-scale neighborhood search: overview and case studies on coloring problems, pp.117-150, 2008.
DOI : 10.1007/978-3-540-78295-7_5

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.9246

C. Chu, A heuristic algorithm for the truckload and less-than-truckload problem, European Journal of Operational Research, vol.165, issue.3, pp.657-667, 2005.
DOI : 10.1016/j.ejor.2003.08.067

G. Clarke and J. W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, vol.12, issue.4, pp.568-581, 1964.
DOI : 10.1287/opre.12.4.568

J. R. Current and D. A. Schilling, The Covering Salesman Problem, Transportation Science, vol.23, issue.3, pp.208-213, 1989.
DOI : 10.1287/trsc.23.3.208

J. R. Current and D. A. Schilling, The median tour and maximal covering tour problems: Formulations and heuristics, European Journal of Operational Research, vol.73, issue.1, pp.114-126, 1994.
DOI : 10.1016/0377-2217(94)90149-X

G. Dantzig, R. Fulkerson, and S. Johnson, Solution of a Large-Scale Traveling-Salesman Problem, Journal of the Operations Research Society of America, vol.2, issue.4, pp.393-410, 1954.
DOI : 10.1287/opre.2.4.393

G. B. Dantzig, Discrete-Variable Extremum Problems, Operations Research, vol.5, issue.2, pp.266-288, 1957.
DOI : 10.1287/opre.5.2.266

G. B. Dantzig and J. H. Ramser, The Truck Dispatching Problem, Management Science, vol.6, issue.1, pp.80-91, 1959.
DOI : 10.1287/mnsc.6.1.80

B. De-backer, V. Furnon, P. Shaw, P. Kilby, and P. Prosser, Solving vehicle routing problems using constraint programming and metaheuristics, Journal of Heuristics, vol.6, issue.4, pp.501-523, 2000.
DOI : 10.1023/A:1009621410177

W. A. Dees-jr and P. G. Karger, Automated rip-up and reroute techniques, Proceedings of the 19th Design Automation Conference, pp.432-439, 1982.

M. Dell-'amico, F. Maffioli, and P. Värbrand, On Prize-collecting Tours and the Asymmetric Travelling Salesman Problem, International Transactions in Operational Research, vol.53, issue.3, pp.297-308, 1995.
DOI : 10.2307/2582232

E. Demir, T. Bekta¸sbekta¸s, and G. Laporte, An adaptive large neighborhood search heuristic for the Pollution-Routing Problem, European Journal of Operational Research, vol.223, issue.2, pp.346-359, 2012.
DOI : 10.1016/j.ejor.2012.06.044

M. Desrochers, An algorithm for the shortest path problem with resource constraints, 1988.

A. Divsalar, P. Vansteenwegen, K. Sörensen, and D. Cattrysse, A memetic algorithm for the orienteering problem with hotel selection, European Journal of Operational Research, vol.237, issue.1, pp.29-49, 2014.
DOI : 10.1016/j.ejor.2014.01.001

K. Doerner, A. Focke, and W. J. Gutjahr, Multicriteria tour planning for mobile healthcare facilities in a developing country, European Journal of Operational Research, vol.179, issue.3, pp.1078-1096, 2007.
DOI : 10.1016/j.ejor.2005.10.067

K. F. Doerner and R. F. Hartl, The Vehicle Routing Problem: Latest Advances and New Challenges, chapter Health care logistics, emergency, preparedness and disaster relief: New challenges for routing problems with a focus on the Austrian situation, pp.527-550, 2008.

M. Dror, Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW, Operations Research, vol.42, issue.5, pp.977-978, 1994.
DOI : 10.1287/opre.42.5.977

G. Dueck, New Optimization Heuristics, Journal of Computational Physics, vol.104, issue.1, pp.86-92, 1993.
DOI : 10.1006/jcph.1993.1010

G. F. Duff, Differences, derivatives, and decreasing rearrangements, Journal canadien de math??matiques, vol.19, issue.0, pp.1153-1178, 1967.
DOI : 10.4153/CJM-1967-105-0

B. Eksioglu, A. V. Vural, and A. Reisman, The vehicle routing problem: A taxonomic review, Computers & Industrial Engineering, vol.57, issue.4, pp.1472-1483, 2009.
DOI : 10.1016/j.cie.2009.05.009

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, vol.35, issue.3, pp.216-229, 2004.
DOI : 10.1002/net.20033

D. Feillet, P. Dejax, and M. Gendreau, Traveling Salesman Problems with Profits, Transportation Science, vol.39, issue.2, pp.188-205, 2005.
DOI : 10.1287/trsc.1030.0079

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.5086

T. A. Feo and M. G. Resende, Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, vol.68, issue.2, pp.109-133, 1995.
DOI : 10.1002/j.1538-7305.1989.tb00322.x

M. Fischetti, J. J. Salazar, and P. Toth, A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem, Operations Research, vol.45, issue.3, pp.378-394, 1997.
DOI : 10.1287/opre.45.3.378

M. Fischetti, J. J. Salazar, and P. Toth, Solving the Orienteering Problem through Branch-and-Cut, INFORMS Journal on Computing, vol.10, issue.2, pp.133-148, 1998.
DOI : 10.1287/ijoc.10.2.133

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2933

M. L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing. Networks, pp.109-124, 1981.
DOI : 10.1002/net.3230110205

URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA100992

D. A. Flores-garza, M. A. Salazar-aguilar, S. U. Ngueveu, and G. Laporte, The multivehicle cumulative covering tour problem, Annals of Operations Research, pp.1-20, 2015.
DOI : 10.1007/s10479-015-2062-7

B. Funke, T. Grünert, and S. Irnich, Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration, Journal of Heuristics, vol.50, issue.(5), pp.267-306, 2005.
DOI : 10.1007/978-1-4613-1361-8_41

G. Galindo and R. Batta, Review of recent developments in OR/MS research in disaster operations management, European Journal of Operational Research, vol.230, issue.2, pp.201-211, 2013.
DOI : 10.1016/j.ejor.2013.01.039

D. Gavalas, C. Konstantopoulos, K. Mastakas, and G. Pantziou, A survey on algorithmic approaches for solving tourist trip design problems, Journal of Heuristics, vol.210, issue.2, pp.291-328, 2014.
DOI : 10.1007/s10732-014-9242-5

M. Gendreau and J. Potvin, Metaheuristics in Combinatorial Optimization, Annals of Operations Research, vol.1, issue.1, pp.189-213, 2005.
DOI : 10.1007/978-3-7091-6492-1_54

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-1094, 1992.
DOI : 10.1287/opre.40.6.1086

M. Gendreau, G. Laporte, and F. Semet, The Covering Tour Problem, Operations Research, vol.45, issue.4, pp.568-576, 1997.
DOI : 10.1287/opre.45.4.568

M. Gendreau, G. Laporte, and F. Semet, A branch-and-cut algorithm for the undirected selective traveling salesman problem, Networks, vol.32, issue.4, pp.263-273, 1998.
DOI : 10.1002/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q

M. Gendreau, G. Laporte, and F. Semet, A tabu search heuristic for the undirected selective travelling salesman problem, European Journal of Operational Research, vol.106, issue.2-3, pp.539-545, 1998.
DOI : 10.1016/S0377-2217(97)00289-0

B. E. Gillett and L. R. Miller, A Heuristic Algorithm for the Vehicle-Dispatch Problem, Operations Research, vol.22, issue.2, pp.340-349, 1974.
DOI : 10.1287/opre.22.2.340

B. Golden, L. Levy, and R. Vohra, The orienteering problem, Naval Research Logistics, vol.23, issue.3, pp.307-318, 1987.
DOI : 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D

B. Golden, Q. Wang, and L. Liu, A multifaceted heuristic for the orienteering problem, Naval Research Logistics, vol.35, issue.3, pp.359-366, 1988.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

B. Golden, Z. Naji-azimi, S. Raghavan, M. Salari, and P. Toth, The Generalized Covering Salesman Problem, INFORMS Journal on Computing, vol.24, issue.4, pp.534-553, 2012.
DOI : 10.1287/ijoc.1110.0480

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.4129

H. Minhhò-ang, N. Bostel, A. Langevin, and L. Rousseau, An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices, European Journal of Operational Research, vol.226, pp.211-220, 2013.

M. Hachicha, M. J. Hodgson, G. Laporte, and F. Semet, Heuristics for the multi-vehicle covering tour problem, Computers & Operations Research, vol.27, issue.1, pp.29-42, 2000.
DOI : 10.1016/S0305-0548(99)00006-4

R. Hall and J. Partyka, Vehicle routing software survey: Higher expectations drive transformation, 2016.

P. Hansen, N. Mladenovi´cmladenovi´c, and J. A. Pérez-moreno, Variable neighbourhood search: methods and??applications, Annals of Operations Research, vol.60, issue.2, pp.367-407, 2010.
DOI : 10.1057/palgrave.jors.2602534

P. E. Hart, N. J. Nilsson, and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

V. Hemmelmayr, K. F. Doerner, R. F. Hartl, and M. W. Savelsbergh, Delivery strategies for blood products supplies, OR Spectrum, vol.29, issue.4, pp.707-725, 2009.
DOI : 10.1007/s00291-008-0134-7

J. Hodgson, G. Laporte, and F. Semet, A Covering Tour Model for Planning Mobile Health Care Facilities in SuhumDistrict, Ghama, Journal of Regional Science, vol.38, issue.4, pp.621-638, 1998.
DOI : 10.1111/0022-4146.00113

T. C. Hu, A. B. Kahng, and C. A. Tsao, Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods, ORSA Journal on Computing, vol.7, issue.4, pp.417-425, 1995.
DOI : 10.1287/ijoc.7.4.417

T. Ilhan, S. M. Iravani, and M. S. Daskin, The orienteering problem with stochastic profits, IIE Transactions, vol.35, issue.4, pp.406-421, 2008.
DOI : 10.1162/106365600568158

S. Irnich and G. Desaulniers, Shortest path problems with resource constraints. Les Cahiers du GERAD, pp.1-27, 2004.
DOI : 10.1007/0-387-25486-2_2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.1376

L. Jourdan, M. Basseur, and E. Talbi, Hybridizing exact methods and metaheuristics: A taxonomy, European Journal of Operational Research, vol.199, issue.3, pp.620-629, 2009.
DOI : 10.1016/j.ejor.2007.07.035

URL : https://hal.archives-ouvertes.fr/inria-00484922

N. Jozefowiez, A branch-and-price algorithm for the multivehicle covering tour problem, Networks, vol.39, issue.3, pp.160-168, 2014.
DOI : 10.1002/net.21564

N. Jozefowiez, F. Semet, and E. G. Talbi, The bi-objective covering tour problem, Computers & Operations Research, vol.34, issue.7, pp.1929-1942, 2007.
DOI : 10.1016/j.cor.2005.07.022

M. Kammoun, H. Derbel, M. Ratli, and B. Jarboui, A variable neighborhood search for solving the multi-vehicle covering tour problem, Electronic Notes in Discrete Mathematics, vol.47, pp.285-292, 2015.
DOI : 10.1016/j.endm.2014.11.037

D. Karapetyan and M. Reihaneh, An efficient hybrid ant colony system for the generalized traveling salesman problem, Algorithmic Operations Research, vol.7, pp.21-28

S. Kataoka and S. Morito, Single constraint maximum collection problem, Journal of the Operations Research Society of Japan, vol.31, pp.515-530, 1988.

S. Kedad-sidhoum and V. H. Nguyen, An exact algorithm for solving the ring star problem, Optimization, vol.7, issue.1, pp.125-140, 2010.
DOI : 10.1287/moor.7.1.67

URL : https://hal.archives-ouvertes.fr/hal-01170329

. Keller, Algorithms to solve the orienteering problem: A comparison, European Journal of Operational Research, vol.41, issue.2, pp.224-231, 1989.
DOI : 10.1016/0377-2217(89)90388-3

G. A. Kindervater and M. W. Savelsbergh, Local Search in Combinatorial Optimization , chapter Vehicle routing: Handling edge exchanges, pp.337-360, 1997.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7607

A. A. Kovacs, S. N. Parragh, K. F. Doerner, and R. F. Hartl, Adaptive large neighborhood search for service technician routing and scheduling problems, Journal of Scheduling, vol.113, issue.5, pp.579-600, 2012.
DOI : 10.1007/s10951-011-0246-9

N. Labadie, C. Prins, and C. Prodhon, Metaheuristics for Vehicle Routing Problems, 2016.
DOI : 10.1002/9781119136767

M. Labbé and G. Laporte, Maximizing user convenience and postal service efficiency in post box location, Belgian J. Opns. Res. Statist. and Computer Sci, vol.26, pp.21-35, 1986.

M. Labbé, G. Laporte, I. R. Martín, and J. J. Salazar-gonzález, The Ring Star Problem: Polyhedral analysis and exact algorithm, Networks, vol.45, issue.3, pp.177-189, 2004.
DOI : 10.1016/S0966-8349(98)00042-4

M. Labbé, G. Laporte, I. R. Martín, and J. J. Salazar-gonzález, Locating median cycles in networks, European Journal of Operational Research, vol.160, issue.2, pp.457-470, 2005.
DOI : 10.1016/j.ejor.2003.07.010

M. Laguna and R. Marti, GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization, INFORMS Journal on Computing, vol.11, issue.1, pp.44-52, 1999.
DOI : 10.1287/ijoc.11.1.44

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.7608

G. Laporte, Vehicle Routing: Methods and Studies, chapter Location-routing problems, pp.193-207, 1988.

G. Laporte, Tour location problems, Studies in Locational Analysis, vol.11, pp.13-26, 1997.

G. Laporte and S. Martello, The selective travelling salesman problem, Discrete Applied Mathematics, vol.26, issue.2-3, pp.193-207, 1990.
DOI : 10.1016/0166-218X(90)90100-Q

URL : http://doi.org/10.1016/0166-218x(90)90100-q

G. Laporte and F. Semet, The Vehicle Routing Problem, chapter Classical and new heuristics for the vehicle routing problem, SIAM, pp.109-128, 2002.

G. Laporte, S. Chapleau, P. Landry, and H. Mercure, An algorithm for the design of mailbox collection routes in urban areas, Transportation Research Part B: Methodological, vol.23, issue.4, pp.271-280, 1989.
DOI : 10.1016/0191-2615(89)90029-5

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization., The Journal of the Operational Research Society, vol.37, issue.5, 1985.
DOI : 10.2307/2582681

K. Li and H. Tian, A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem, Applied Soft Computing, vol.43, 2016.
DOI : 10.1016/j.asoc.2016.02.040

S. Lin and B. W. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research, vol.21, issue.2, pp.498-516, 1973.
DOI : 10.1287/opre.21.2.498

R. Lopes, V. A. Souza, and A. S. Da-cunha, A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem, Electronic Notes in Discrete Mathematics, vol.44, pp.61-66, 2013.
DOI : 10.1016/j.endm.2013.10.010

M. López-ibáñez, J. Dubois-lacoste, T. Stützle, and M. Birattari, The irace package , Iterated Race for Automatic Algorithm Configuration, 2011.

N. Mladenovi´cmladenovi´c and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2

J. A. Moreno-pérez, M. Moreno-vega, and I. R. Martín, Variable neighborhood tabu search and its application to the median cycle problem, European Journal of Operational Research, vol.151, issue.2, pp.365-378, 2003.
DOI : 10.1016/S0377-2217(02)00831-7

L. Motta, L. S. Ochi, and C. Martinhon, GRASP metaheuristics to the generalized covering tour problem, MIC'2001?4th Metaheuristics International Conference, pp.387-391, 2001.

K. Murakami, A column generation approach for the multi-vehicle covering tour problem, 2014 IEEE International Conference on Automation Science and Engineering (CASE), pp.1063-1068, 2014.
DOI : 10.1109/CoASE.2014.6899457

Z. Naji-azimi, J. Renaud, A. Ruiz, and M. Salari, A covering tour approach to the location of satellite distribution centers to supply humanitarian aid, European Journal of Operational Research, vol.222, issue.3, pp.596-605, 2012.
DOI : 10.1016/j.ejor.2012.05.001

R. Neapolitan and K. Naimipour, Foundations of Algorithms: with C++ Pseudocode, 1998.

G. L. Nemhauser and L. A. Wolsey, Integer and combinatorial optimization, 1999.
DOI : 10.1002/9781118627372

S. U. Ngueveu, C. Prins, and R. W. Calvo, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Computers & Operations Research, vol.37, issue.11, pp.1877-1885, 2010.
DOI : 10.1016/j.cor.2009.06.014

P. C. Nolz, K. F. Doerner, W. J. Gutjahr, and R. F. Hartl, Advances in Multi-Objective Nature Inspired Computing, chapter A bi-objective metaheuristic for disaster relief operation planning, Bibliography, vol.167, pp.167-187, 2010.

A. Oliveira, M. P. Mello, A. C. Moretti, and E. F. Reis, MULTI-VEHICLE COVERING TOUR PROBLEM: BUILDING ROUTES FOR URBAN PATROLLING, Pesquisa Operacional, vol.24, issue.3, 2013.
DOI : 10.1093/ije/24.3.493

URL : http://doi.org/10.1590/0101-7438.2015.035.03.0617

C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization?Algorithms and Complexity, 1982.

M. B. Pedersen, Optimization models and solution methods for intermodal transportation, 2005.

D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Computers & Operations Research, vol.34, issue.8, pp.2403-2435, 2007.
DOI : 10.1016/j.cor.2005.09.012

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9164

D. Pisinger and S. Ropke, Handbook of Metaheuristics, chapter Large neighborhood search, pp.399-419, 2010.
DOI : 10.1007/978-1-4419-1665-5_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.2703

G. Polya, How to solve it, 1945.

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

C. Prins, Bio-Inspired Algorithms for the Vehicle Routing Problem, chapter A GRASP× evolutionary local search hybrid for the vehicle routing problem, pp.35-53, 2009.

C. Prins, N. Labadi, and M. Reghioui, Tour splitting algorithms for vehicle routing problems, International Journal of Production Research, vol.47, issue.2, pp.507-535, 2009.
DOI : 10.1016/0377-2217(85)90252-8

C. Prins, P. Lacomme, and C. Prodhon, Order-first split-second methods for vehicle routing problems: A review, Transportation Research Part C: Emerging Technologies, vol.40, pp.179-200, 2014.
DOI : 10.1016/j.trc.2014.01.011

R. Ramesh and K. Brown, An efficient four-phase heuristic for the generalized orienteering problem, Computers & Operations Research, vol.18, issue.2, pp.151-165, 1991.
DOI : 10.1016/0305-0548(91)90086-7

R. Ramesh, Y. Yoon, and M. Karwan, An Optimal Algorithm for the Orienteering Tour Problem, ORSA Journal on Computing, vol.4, issue.2, pp.155-165, 1992.
DOI : 10.1287/ijoc.4.2.155

G. Reinelt, TSPLIB?A Traveling Salesman Problem Library, ORSA Journal on Computing, vol.3, issue.4, pp.376-384, 1991.
DOI : 10.1287/ijoc.3.4.376

J. Renaud, F. F. Boctor, and G. Laporte, Efficient heuristics for Median Cycle Problems, Journal of the Operational Research Society, vol.3, issue.2, pp.179-186, 2004.
DOI : 10.1287/ijoc.3.4.376

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.575.1639

C. S. Revelle and G. Laporte, New directions in plant location, Studies in Locational Analysis, vol.5, pp.31-58, 1993.

G. Ribeiro and G. Laporte, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Computers & Operations Research, vol.39, issue.3, pp.728-735, 2012.
DOI : 10.1016/j.cor.2011.05.005

G. Righini and M. Salani, Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273, 2006.
DOI : 10.1016/j.disopt.2006.05.007

G. Righini and M. Salani, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, vol.3, issue.3, pp.155-170, 2008.
DOI : 10.1002/net.20212

URL : https://air.unimi.it/bitstream/2434/5590/2/rcespp2.pdf

S. Ropke and D. Pisinger, An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.40, issue.4, pp.455-472, 2006.
DOI : 10.1287/trsc.1050.0135

F. Rossi, P. Van-beek, and T. Walsh, Handbook of constraint programming, 2006.

M. Salari and Z. Naji-azimi, An integer programming-based local search for the covering salesman problem, Computers & Operations Research, vol.39, issue.11, pp.2594-2602, 2012.
DOI : 10.1016/j.cor.2012.01.004

M. Salari, M. Reihaneh, and M. Sabbagh, Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem, Computers & Industrial Engineering, vol.83, pp.244-251, 2015.
DOI : 10.1016/j.cie.2015.02.019

M. Schilde, K. F. Doerner, R. F. Hartl, and G. Kiechle, Metaheuristics for the bi-objective orienteering problem, Swarm Intelligence, vol.7, issue.2, pp.179-201, 2009.
DOI : 10.1007/3-540-44719-9_15

G. Schrimpf, J. Schneider, H. Stamm-wilbrandt, and G. Dueck, Record Breaking Optimization Results Using the Ruin and Recreate Principle, Journal of Computational Physics, vol.159, issue.2, pp.139-171, 2000.
DOI : 10.1006/jcph.1999.6413

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.516.8716

P. Shaw, A new local search algorithm providing high quality solutions to vehicle routing problems, 1997.

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7295

J. C. Simms, Fixed and mobile facilities in dairy practice. The Veterinary Clinics of North America -Food Animal Practice, pp.591-601, 1989.
DOI : 10.1016/s0749-0720(15)30953-1

W. Souffriau, P. Vansteenwegen, J. Vertommen, G. Vanden-berghe, and D. Van-oudheusden, A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDES, Applied Artificial Intelligence, vol.14, issue.10, pp.964-985, 2008.
DOI : 10.1016/S0377-2217(98)00099-X

A. Subramanian, E. Uchoa, and L. S. Ochi, A hybrid algorithm for a class of vehicle routing problems, Computers & Operations Research, vol.40, issue.10, pp.2519-2531
DOI : 10.1016/j.cor.2013.01.013

G. Talbi, Metaheuristics from design to implementation, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00750681

L. Tang and X. Wang, Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem, The International Journal of Advanced Manufacturing Technology, vol.123, issue.3, pp.1246-1258, 2006.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

T. Thomadsen and T. Stidsen, The quadratic selective travelling salesman problem, 2003.

P. M. Thompson and H. N. Psaraftis, Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems, Operations Research, vol.41, issue.5, pp.935-946, 1993.
DOI : 10.1287/opre.41.5.935

P. Toth and D. Vigo, The Vehicle Routing Problem, chapter An overview of vehicle routing problems, Society for Industrial and Applied Mathematics, pp.1-26, 2002.

P. Toth and D. Vigo, The Granular Tabu Search and Its Application to the Vehicle-Routing Problem, INFORMS Journal on Computing, vol.15, issue.4, pp.333-346, 2003.
DOI : 10.1287/ijoc.15.4.333.24890

P. Toth and D. Vigo, Vehicle Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics, 2014.
DOI : 10.1137/1.9781611973594

F. Tricoire, M. Romauch, K. F. Doerner, and R. F. Hartl, Heuristics for the multi-period orienteering problem with multiple time windows, Computers & Operations Research, vol.37, issue.2, pp.351-367, 2010.
DOI : 10.1016/j.cor.2009.05.012

F. Tricoire, A. Graf, and W. J. Gutjahr, The bi-objective stochastic covering tour problem, Computers & Operations Research, vol.39, issue.7, pp.1582-1592, 2012.
DOI : 10.1016/j.cor.2011.09.009

URL : http://doi.org/10.1016/j.cor.2011.09.009

T. Tsiligirides, Heuristic Methods Applied to Orienteering, Journal of the Operational Research Society, vol.35, issue.9, pp.797-809, 1984.
DOI : 10.1057/jors.1984.162

R. Tunalioglu, C. Koc, and T. Bektas, A multiperiod location-routing problem, Journal of the Operational Research Society, 2016.

T. Urli, Hybrid metaheuristics for combinatorial optimization, Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, 2014.

A. Van-breedam, An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and timerelated constraints, 1994.

P. Vansteenwegen and D. Van-oudheusden, The Mobile Tourist Guide: An OR Opportunity, OR Insight, vol.20, issue.3, pp.21-27, 2007.
DOI : 10.1057/ori.2007.17

P. Vansteenwegen, W. Souffriau, G. Vanden-berghe, and D. Van-oudheusden, A guided local search metaheuristic for the team orienteering problem, European Journal of Operational Research, vol.196, issue.1, pp.118-127, 2009.
DOI : 10.1016/j.ejor.2008.02.037

P. Vansteenwegen, W. Souffriau, and D. Van-oudheusden, The orienteering problem: A survey, European Journal of Operational Research, vol.209, issue.1, pp.1-10, 2011.
DOI : 10.1016/j.ejor.2010.03.045

URL : https://lirias.kuleuven.be/bitstream/123456789/265656/2/The+orienteering+problem+a+survey_.pdf

P. Vansteenwegen, W. Souffriau, G. Vanden-berghe, and D. Van-oudheusden, The City Trip Planner: An expert system for tourists, Expert Systems with Applications, vol.38, issue.6, pp.6540-6546, 2011.
DOI : 10.1016/j.eswa.2010.11.085

L. Vargas, N. Jozefowiez, and S. U. Ngueveu, A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour Problem, Proceedings of the 9th Learning and Intelligent OptimizatioN Conference, LION9, pp.170-185
DOI : 10.1007/978-3-319-19084-6_16

L. Vargas, N. Jozefowiez, and S. U. Ngueveu, A dynamic programming operator for tour location problems applied to the covering tour problem, Journal of Heuristics, vol.83, issue.2, 2015.
DOI : 10.1007/s10732-017-9324-2

L. Vargas, N. Jozefowiez, and S. U. Ngueveu, Solving the orienteering problem using a dynamic programming operator for tour location problems, 2015.

L. Vargas, N. Jozefowiez, and S. U. Ngueveu, A dynamic programming-based metaheuristic for the m-covering tour problem, 2016.

V. V. Vazirani, Approximation Algorithms, 2003.
DOI : 10.1007/978-3-662-04565-7

T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, A unified solution framework for multi-attribute vehicle routing problems, European Journal of Operational Research, vol.234, issue.3, pp.658-673, 2014.
DOI : 10.1016/j.ejor.2013.09.045

T. Vidal, N. Maculan, L. S. Ochi, P. H. Vaz, and . Penna, Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits, Transportation Science, vol.50, issue.2, pp.1-15, 2015.
DOI : 10.1287/trsc.2015.0584

URL : http://arxiv.org/abs/1401.3794

L. Vogt, C. A. Poojari, and J. E. Beasley, A tabu search algorithm for the single vehicle routing allocation problem, Journal of the Operational Research Society, vol.55, issue.2, pp.467-480, 2007.
DOI : 10.1057/palgrave.jors.2601672

C. Voudouris and E. P. Tsang, Handbook of metaheuristics, pp.185-218, 2003.

S. Voß, Local Search for Planning and Scheduling, LNCS 2148, chapter Meta-heuristics: The state of the art, pp.1-23, 2001.

Q. Wang, X. Sun, B. Golden, and J. Jia, Using artificial neural networks to solve the orienteering problem, Annals of Operations Research, vol.35, issue.1, pp.111-120, 1995.
DOI : 10.2172/6223080

X. Wang, B. Golden, and E. Wasil, The vehicle routing problem: latest advances and new challenges, chapter Using a genetic algorithm to solve the generalized orienteering problem Bibliography 171, pp.263-274, 2008.

A. Wren and A. Holliday, Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points, Journal of the Operational Research Society, vol.23, issue.3, pp.333-344, 1972.
DOI : 10.1057/jors.1972.53

T. Zhang, W. A. Chaovalitwongse, Y. Zhang, and P. M. Pardalos, The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem, Journal of Industrial and Management Optimization, vol.5, issue.4, pp.749-765, 2009.
DOI : 10.3934/jimo.2009.5.749

W. Zhang, State-space search: Algorithms, complexity, extensions, and applications, 1999.
DOI : 10.1007/978-1-4612-1538-7