C. Archetti, D. Feillet, A. Hertz, and M. 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. Speranza, and D. Vigo, Vehicle routing problems. Tech. rep The prize collecting traveling salesman problem, Italy Balas E Networks, vol.19, issue.6, pp.621-636, 1989.

E. Balas, The prize collecting traveling salesman problem and its applications The traveling salesman problem and its variations, pp.663-695, 2007.
DOI : 10.1007/0-306-48213-4_14

V. Campos, R. Marti, J. Sánchez-oro, A. Duarte, I. Chao et al., Grasp with path relinking for the orienteering problem A fast and effective heuristic for the orienteering problem, Journal of Operational Research Society European Journal of Operational Research, vol.65, issue.88, pp.475-489, 1996.

F. 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-119, 1997.
DOI : 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G

J. Cordeau, M. Gendreau, G. Laporte, J. Potvin, and F. Semet, A guide to vehicle routing heuristics, Journal of the Operational Research Society, vol.53, issue.5, pp.512-522, 2002.
DOI : 10.1057/palgrave.jors.2601319

F. Cornillier, F. Boctor, G. Laporte, and R. J. , The petrol station replenishment problem with time windows, Computers & Operations Research, vol.36, issue.3, pp.919-935, 2009.
DOI : 10.1016/j.cor.2007.11.007

F. Cornillier, F. Boctor, and R. J. , Heuristics for the multi-depot petrol station replenishment problem with time windows, European Journal of Operational Research, vol.220, issue.2, pp.361-369, 2012.
DOI : 10.1016/j.ejor.2012.02.007

M. Dell-'amico, F. Maffioli, and P. Varbrand, 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. Bektas, 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

U. Derigs, J. Gottlieb, J. Kalkoff, M. Piesche, F. Rothlauf et al., Vehicle routing with compartments: applications, modelling and heuristics, OR Spectrum, vol.3, issue.2, pp.885-914, 2011.
DOI : 10.1023/B:JMMA.0000036583.17284.02

J. Dongarra, Performance of various computers using standard linear equations software Calvo R (2008) A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Tech. rep. Computers & Operations Research, vol.35, pp.1725-1741, 2013.

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

M. Fischetti, J. Salazar-gonzalez, and P. Toth, The generalized traveling salesman and orienteering problems The traveling salesman problem and its variations, pp.609-662, 2007.
DOI : 10.1007/0-306-48213-4_13

A. Garcia, P. Vansteenwegen, W. Souffriau, O. Arbelaitz, and M. Linaza, Solving multi constrained team orienteering problems to generate tourist routes. Tech. rep., Centre for Industrial Management, 2010.

H. Gehring and J. Homberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, Proceedings of the Evolutionary Algorithms in Engineering and Computer Science, pp.57-64, 1999.

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, 1995.
DOI : 10.1287/opre.46.3.330

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. 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

M. Golumbic, N. Piscataway, P. Hansen, and N. Mladenovic, Algorithmic graph theory and perfect graphs Variable neighborhood search, Handbook of Metaheuristics, pp.145-184, 2003.

M. Jepsen, Branch-and-cut and branch-and-cut-and-price algorithms for solving vehicle routing problems. Dissertation, 2011.

N. Labadie, J. Melechovsk, and R. Calvo, Hybridized evolutionary local search algorithm for??the??team orienteering problem with time windows, Journal of Heuristics, vol.36, issue.12, pp.729-753, 2011.
DOI : 10.1007/978-0-387-77778-8_12

N. Labadie, R. Mansini, J. Melechovsk, and R. Calvo, The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search, European Journal of Operational Research, vol.220, issue.1, pp.15-27, 2012.
DOI : 10.1016/j.ejor.2012.01.030

R. Lahyani, M. Khemakhem, F. Semet, L. Coelho, M. Khemakhem et al., Rich vehicle routing problems: From a taxonomy to a definition A multicompartment vehicle routing problem arising in the collection of olive oil in tunisia, European Journal of Operational Research , forth- coming Lahyani R OMEGA, vol.51, pp.1-10, 2014.

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 : https://doi.org/10.1016/0166-218x(90)90100-q

S. Lin and V. Yu, A simulated annealing heuristic for the team orienteering problem with time windows, European Journal of Operational Research, vol.217, issue.1, pp.94-107, 2012.
DOI : 10.1016/j.ejor.2011.08.024

N. Mladenovic 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
URL : https://hal.archives-ouvertes.fr/hal-00979295

R. Montemanni and L. Gambardella, An Enhanced Ant Colony System for the Team Orienteering Problem with Time Windows, 2011 International Symposium on Computer Science and Society, pp.287-306, 2009.
DOI : 10.1109/ISCCS.2011.95

L. Muyldermans and G. Pang, On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm, European Journal of Operational Research, vol.206, issue.1, pp.93-103, 2010.
DOI : 10.1016/j.ejor.2010.02.020

J. Oppen, A. Loekketangen, and J. Desrosiers, Solving a rich vehicle routing and inventory problem using column generation, Computers & Operations Research, vol.37, issue.7, pp.1308-1317, 2010.
DOI : 10.1016/j.cor.2009.09.014

J. Perttunen, On the Significance of the Initial Solution in Travelling Salesman Heuristics, Journal of the Operational Research Society, vol.45, issue.10, pp.1131-1140, 1994.
DOI : 10.1057/jors.1994.183

U. Pferschy and J. Schauer, The Knapsack Problem with Conflict Graphs, Journal of Graph Algorithms and Applications, vol.13, issue.2, pp.233-249, 2009.
DOI : 10.7155/jgaa.00186

D. Pirkwieser and S. Ropke, Hybrid metaheuristics and matheuristics for problems in bioinformatics and transportation A general heuristic for vehicle routing problems, Computers & Operations Research, vol.34, issue.8, pp.2403-2435, 2007.

. Prescott-gagnon, G. Desaulniers, and L. Rousseau, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Networks, vol.35, issue.4, pp.190-204, 2009.
DOI : 10.1007/978-1-4615-6089-0

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, Dynamic programming for the orienteering problem with time windows, 2006.

G. Righini and M. Salani, Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming, Computers & Operations Research, vol.36, issue.4, pp.1191-1203, 2009.
DOI : 10.1016/j.cor.2008.01.003

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

M. Savelsbergh, The Vehicle Routing Problem with Time Windows: Minimizing Route Duration, ORSA Journal on Computing, vol.4, issue.2, pp.146-154, 1992.
DOI : 10.1287/ijoc.4.2.146

M. Schilde, K. Doerner, F. Richard, 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

M. Schilde, K. Doerner, F. Richard, and G. Kiechle, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, Computers & Operations Research, vol.38, issue.12, pp.1719-1730, 2011.
DOI : 10.1016/j.cor.2011.02.006

G. Schrimph, 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

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 CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming, 1998.
DOI : 10.1007/3-540-49481-2_30

M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.
DOI : 10.1287/opre.35.2.254
URL : http://www.banaan.org/~vinnoo/pdf1.pdf

W. Souffriau, P. Vansteenwegen, G. Berghe, and D. Oudheusden, Automated Parameterisation of a Metaheuristic for the Orienteering Problem, Adaptive and Multilevel Metaheuristics, vol.136, pp.255-269, 2008.
DOI : 10.1007/978-3-540-79438-7_13

W. Souffriau, P. Vansteenwegen, G. Berghe, and D. Oudheusden, The Multiconstraint Team Orienteering Problem with Multiple Time Windows, Transportation Science, vol.47, issue.1, pp.53-63, 2013.
DOI : 10.1287/trsc.1110.0377

A. Subramanian, Heuristic, exact and hybrid approaches for vehicle routing problems. Dissertation, 2012.

F. Tricoire, M. Romauch, K. Doerner, and R. 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

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

P. Vansteenwegen, W. Souffriau, G. Berghe, and D. 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, G. Berghe, and D. Oudheusden, Iterated local search for the team orienteering problem with time windows, Computers & Operations Research, vol.36, issue.12, pp.3281-3290, 2009.
DOI : 10.1016/j.cor.2009.03.008

P. Vansteenwegen, W. Souffriau, and D. 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

T. Vidal, T. 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

M. Wen, E. Krapper, J. Larsen, and T. Stidsen, A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem, Networks, vol.113, issue.4, pp.311-322, 2011.
DOI : 10.1016/j.ijpe.2007.11.011