R. E. Aleman and R. R. Hill, A tabu search with vocabulary building approach for the vehicle routing problem with split demands, International Journal of Metaheuristics, vol.1, issue.1, pp.55-80, 2010.

A. Urban and . Wg, Urban freight research roadmap, p.15, 2014.

J. Allen, G. Thorne, and M. Browne, Bestufs good practice guide on urban freight transport, BESTUFS EU Thematic Network, 2007.

E. Angelelli and M. G. Speranza, The periodic vehicle routing problem with intermediate facilities, European Journal of Operational Research, vol.137, issue.2, pp.233-247, 2002.

C. Archetti, N. Bianchessi, and M. Speranza, Optimal solutions for routing problems with profits, Seventh International Conference on Graphs and Optimization, vol.161, pp.547-557, 2010.

C. Archetti, N. Bianchessi, and M. G. Speranza, Branch-and-cut algorithms for the split delivery vehicle routing problem, European Journal of Operational Research, vol.238, issue.3, pp.685-698, 2014.

C. Archetti, A. Hertz, and M. G. Speranza, Metaheuristics for the team orienteering problem, Journal of Heuristics, vol.13, issue.1, pp.49-76, 2007.

C. Archetti, . Ángel-corberán, I. Plana, J. M. Sanchis, and M. G. Speranza, A matheuristic for the team orienteering arc routing problem, European Journal of Operational Research, vol.245, issue.2, pp.392-401, 2015.

C. Archetti, M. W. Savelsbergh, and M. G. Speranza, Worst-case analysis for split delivery vehicle routing problems, Transportation Science, vol.40, issue.2, pp.226-234, 2006.

C. Archetti and M. G. Speranza, Vehicle routing problems with split deliveries, International Transactions in Operational Research, vol.19, issue.1-2, pp.3-22, 2012.

C. Archetti and M. G. Speranza, Arc routing problems with profits, MOS-SIAM Series on Optimization, pp.257-284, 2014.

C. Archetti, M. G. Speranza, and M. W. Savelsbergh, An optimization-based heuristic for the split delivery vehicle routing problem, Transportation Science, vol.42, issue.1, pp.22-31, 2008.

C. Archetti, M. G. Speranza, and D. Vigo, Vehicle Routing Problems with Profits, chapter 10, vol.10, pp.273-297, 2014.

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.

E. Balas, The prize collecting traveling salesman problem, Networks, vol.19, issue.6, pp.621-636, 1989.

E. Balas, The prize collecting traveling salesman problem: Ii, vol.25, pp.199-216, 1995.

E. Balas, The Prize Collecting Traveling Salesman Problem and its Applications, pp.663-695, 2007.

R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi, An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation, Operations Research, vol.52, issue.5, pp.723-738, 2004.

R. Baldacci and A. Mingozzi, A unified exact method for solving different classes of vehicle routing problems, Mathematical Programming, vol.120, issue.2, p.347, 2008.

R. Baldacci, A. Mingozzi, and R. Roberti, New route relaxation and pricing strategies for the vehicle routing problem, Operations Research, vol.59, issue.5, pp.1269-1283, 2011.

R. Baldacci, A. Mingozzi, R. Roberti, and R. W. Calvo, An exact algorithm for the two-echelon capacitated vehicle routing problem, Operations research, vol.61, issue.2, pp.298-314, 2013.

R. Baldacci, P. Toth, and D. Vigo, Recent advances in vehicle routing exact algorithms, vol.4, pp.269-298, 2007.

M. L. Balinski and R. E. Quandt, On an integer program for a delivery problem, Operations research, vol.12, issue.2, pp.300-304, 1964.

A. Baltz, M. E. Ouali, G. Jäger, V. Sauerland, and A. Srivastav, Exact and heuristic algorithms for the travelling salesman problem with multiple time windows and hotel selection, Journal of the Operational Research Society, vol.66, issue.4, pp.615-626, 2015.

J. E. Beasley, Route first-cluster second methods for vehicle routing, Omega, vol.11, issue.4, pp.403-408, 1983.

J. M. Belenguer, M. C. Martinez, and E. Mota, A lower bound for the split delivery vehicle routing problem, Operations Research, vol.48, issue.5, pp.801-810, 2000.

J. E. Bell and P. R. Mcmullen, Ant colony optimization techniques for the vehicle routing problem, Advanced Engineering Informatics, vol.18, issue.1, pp.41-48, 2004.

A. Ben-said, R. El-hajj, and A. Moukrim, A variable space search heuristic for the capacitated team orienteering problem, Journal of Heuristics, vol.25, issue.2, pp.273-303, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01925402

A. Benjamin and J. Beasley, Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities, Computers & Operations Research, vol.37, issue.12, pp.2270-2280, 2010.

L. Berbotto, S. García, and F. J. Nogales, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, Annals of Operations Research, vol.222, issue.1, pp.153-173, 2014.

M. Blocho and Z. J. Czech, A parallel memetic algorithm for the vehicle routing problem with time windows, Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp.144-151, 2013.

M. Boudia, C. Prins, and M. Reghioui, An effective memetic algorithm with population management for the split delivery vehicle routing problem, Hybrid Metaheuristics. HM, vol.4771, pp.16-30, 2007.
URL : https://hal.archives-ouvertes.fr/hal-02490411

H. Bouly, D. Dang, and A. Moukrim, A memetic algorithm for the team orienteering problem, vol.4, pp.49-70, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00453370

H. Bouly, D. Dang, and A. Moukrim, A memetic algorithm for the team orienteering problem, vol.4, pp.49-70, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00453370

S. Boussier, D. Feillet, and M. Gendreau, An exact algorithm for team orienteering problems, vol.4, pp.211-230, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01315417

K. Braekers, K. Ramaekers, and I. V. Nieuwenhuyse, The vehicle routing problem: State of the art classification and review, Computers & Industrial Engineering, vol.99, pp.300-313, 2016.

O. Bräysy 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-118, 2005.

O. Bräysy and M. Gendreau, Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, vol.39, issue.1, pp.119-139, 2005.

U. Breunig, V. Schmid, R. F. Hartl, and T. Vidal, A large neighbourhood based heuristic for two-echelon routing problems, Computers and Operations Research, vol.76, pp.208-225, 2016.

B. Bullnheimer, R. F. Hartl, and C. Strauss, An improved ant System algorithm for thevehicle Routing Problem, Annals of Operations Research, vol.89, pp.319-328, 1999.

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.

S. E. Butt and D. M. Ryan, An optimal solution procedure for the multiple tour maximum collection problem using column generation, Computers & Operations Research, vol.26, issue.4, pp.427-441, 1999.

M. Castro, K. Sörensen, P. Vansteenwegen, and P. Goos, A fast metaheuristic for the travelling salesperson problem with hotel selection, vol.4, pp.15-34, 2015.

M. Castro, K. Sörensen, P. Vansteenwegen, and P. Goos, A memetic algorithm for the travelling salesperson problem with hotel selection, Computers & Operations Research, vol.40, issue.7, pp.1716-1728, 2013.

I. Chao, B. Golden, and E. A. Wasil, The team orienteering problem, European Journal of Operational Research, vol.88, pp.464-474, 1996.

I. Chao, B. L. Golden, and E. A. Wasil, A fast and effective heuristic for the orienteering problem, European Journal of Operational Research, vol.88, issue.3, pp.475-489, 1996.

I. Chao, B. L. Golden, and E. A. Wasil, The team orienteering problem, European Journal of Operational Research, vol.88, issue.3, pp.464-474, 1996.

P. Chen, B. Golden, X. Wang, and E. Wasil, A novel approach to solve the split delivery vehicle routing problem, International Transactions in Operational Research, vol.24, issue.1-2, pp.27-41, 2017.

N. Christofides and S. Eilon, An algorithm for the vehicle-dispatching problem, Journal of the Operational Research Society, vol.20, issue.3, pp.309-318, 1969.

N. Christofides, A. Mingozzi, and P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Mathematical programming, vol.20, issue.1, pp.255-282, 1981.

N. Christofides, A. Mingozzi, and P. Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks, vol.11, issue.2, pp.145-164, 1981.

, CITEPA, 2019.

W. T. Civitas, Policy note -smart choices for cities. making urban freight logistics more sustainable, 2015.

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.

, Keep Europe moving: sustainable mobility for our continent: mid-term review of the European Commission's, 2001.

, Green Paper -Towards a new culture for urban mobility, 2007.

C. Contardo and R. Martinelli, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, Discrete Optimization, vol.12, pp.129-146, 2014.

J. F. Cordeau, M. Gendreau, and G. Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, vol.30, pp.105-119, 1997.

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.

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-936, 2001.

J. Cordeau, G. Laporte, M. W. Savelsbergh, and D. Vigo, Chapter 6 vehicle routing, Transportation, vol.14, pp.367-428, 2007.

J. Cordeau and M. Maischberger, A parallel iterated tabu search heuristic for vehicle routing problems, Computers & Operations Research, vol.39, issue.9, pp.2033-2050, 2012.

T. Crainic, S. Mancini, G. Perboli, and R. Tadei, A GRASP with Path-Relinking Metaheuristic for the Two-Echelon Vehicle Routing Problem, 2011.

T. G. Crainic, S. Mancini, G. Perboli, and R. Tadei, Clustering-based heuristics for the two-echelon vehicle routing problem, 2008.

T. G. Crainic, S. Mancini, G. Perboli, and R. Tadei, Multi-start heuristics for the twoechelon vehicle routing problem, Evolutionary Computation in Combinatorial Optimization, pp.179-190, 2011.

T. G. Crainic, S. Mancini, G. Perboli, and R. Tadei, Impact of Generalized Travel Costs on Satellite Location in the Two-Echelon Vehicle Routing Problem, Procedia -Social and Behavioral Sciences, vol.39, pp.195-204, 2012.

T. G. Crainic, G. Perboli, S. Mancini, and R. Tadei, Two-Echelon Vehicle Routing Problem: A satellite location analysis, Procedia -Social and Behavioral Sciences, vol.2, issue.3, pp.5944-5955, 2010.

T. G. Crainic, N. Ricciardi, and G. Storchi, Advanced freight transportation systems for congested urban areas, Transportation Research Part C: Emerging Technologies, vol.12, issue.2, pp.119-137, 2004.

T. G. Crainic, N. Ricciardi, and G. Storchi, Models for evaluating and planning city logistics systems, Transportation Science, vol.43, issue.4, pp.432-454, 2009.

B. Crevier, J. Cordeau, and G. Laporte, The multi-depot vehicle routing problem with inter-depot routes, European Journal of Operational Research, vol.176, issue.2, pp.756-773, 2007.

F. Cruijssen, O. Bräysy, W. Dullaert, H. Fleuren, and M. Salomon, Joint route planning under varying market conditions, International Journal of Physical Distribution & Logistics Management, vol.37, issue.4, pp.287-304, 2007.

T. Cura, An artificial bee colony algorithm approach for the team orienteering problem with time windows, Computers & Industrial Engineering, vol.74, pp.270-290, 2014.

L. Dablanc, Freight transport for development toolkit: Urban freight -freight transport, a key for the new urban economy, 2009.

S. Dahl and U. Derigs, Cooperative planning in express carrier networks -an empirical study on the effectiveness of a real-time decision support system, Decision Support Systems, vol.51, issue.3, pp.620-626, 2011.

D. Dang, R. El-hajj, and A. Moukrim, A branch-and-cut algorithm for solving the team orienteering problem. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.332-339, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00917153

D. Dang, R. N. Guibadj, and A. Moukrim, A pso-based memetic algorithm for the team orienteering problem, Applications of Evolutionary Computation, pp.471-480, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00575903

D. Dang, R. N. Guibadj, and A. Moukrim, An effective pso-inspired algorithm for the team orienteering problem, European Journal of Operational Research, vol.229, issue.2, pp.332-344, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00934974

G. Dantzig, R. Fulkerson, J. , and S. , Solution of a large-scale traveling-salesman problem, Journal of the Operations Research Society of America, vol.2, issue.4, pp.393-410, 1954.

C. Defryn, K. Sörensen, and T. Cornelissens, The selective vehicle routing problem in a collaborative environment, European Journal of Operational Research, vol.250, issue.2, pp.400-411, 2016.

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.2, issue.3, pp.297-308, 1995.

U. Derigs, B. Li, and U. Vogel, Local search-based metaheuristics for the split delivery vehicle routing problem, Journal of the Operational Research Society, vol.61, issue.9, pp.1356-1364, 2010.

G. Desaulniers, F. Lessard, and A. Hadjar, Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows, Transportation Science, vol.42, issue.3, pp.387-404, 2008.

G. Desaulniers, O. B. Madsen, R. , and S. , Chapter 5: The Vehicle Routing Problem with Time Windows, MOS-SIAM Series on Optimization. SIAM, vol.18, pp.119-159, 2014.

J. Desrosiers, Y. Dumas, and F. Soumis, A dynamic programming solution of the largescale single-vehicle dial-a-ride problem with time windows, American Journal of Mathematical and Management Sciences, vol.6, issue.3-4, pp.301-325, 1986.

A. Divsalar, P. Vansteenwegen, C. , and D. , A variable neighborhood search method for the orienteering problem with hotel selection, International Journal of Production Economics, vol.145, issue.1, pp.150-160, 2013.

A. Divsalar, P. Vansteenwegen, K. Sörensen, C. , and D. , A memetic algorithm for the orienteering problem with hotel selection, European Journal of Operational Research, vol.237, issue.1, pp.29-49, 2014.

M. Dorigo and T. Stützle, Ant Colony Optimization: Overview and Recent Advances, pp.311-351, 2019.

M. Dror and P. Trudeau, Split delivery routing, Naval Research Logistics (NRL), vol.37, issue.3, pp.383-402, 1990.

G. Dueck, New optimization heuristics: the great deluge algorithm and the record-to-record travel, Journal of Computational physics, vol.104, issue.1, pp.86-92, 1993.

D. Duque, L. Lozano, and A. L. Medaglia, Solving the orienteering problem with time windows via the pulse framework, Computers & Operations Research, vol.54, pp.168-176, 2015.

T. Eiichi, R. G. Qureshi, and A. G. , City logistics 1: New opportunities and challenges, City Logistics 1: New Opportunities and Challenges, chapter 1-Recent Developments and Prospects for Modeling City Logistics, pp.1-28, 2018.

S. Eilon, C. D. Watson-gandy, and N. Christofides, Distribution management, 1971.

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.

R. El-hajj, D. Dang, and A. Moukrim, Solving the team orienteering problem with cutting planes, Computers & Operations Research, vol.74, pp.21-30, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01300334

). El-hajj-;-el-jajj and R. , Vehicle routing problems with profits, exact and heuristic approaches, Bilal et Moukrim, Aziz Technologies de l'Information et des Systèmes, 2015.

J. W. Escobar, R. Linfati, P. Toth, and M. G. Baldoquin, A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem, Journal of Heuristics, vol.20, issue.5, pp.483-509, 2014.

J. Ferreira, A. Quintas, J. A. Oliveira, G. A. Pereira, L. ;. Dias et al., Solving the team orienteering problem: Developing a solution tool using a genetic algorithm approach, Soft Computing in Industrial Applications, pp.365-375, 2014.

M. Fischetti, J. J. Gonzalez, and P. Toth, Solving the orienteering problem through branch-and-cut, INFORMS Journal on Computing, vol.10, issue.2, pp.133-148, 1998.

M. L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks, vol.11, issue.2, pp.109-124, 1981.

B. A. Foster and D. M. Ryan, An integer programming approach to the vehicle scheduling problem, Operational Research Quarterly, pp.367-384, 1976.

M. Gansterer, M. Küçüktepe, and R. F. Hartl, The multi-vehicle profitable pickup and delivery problem, OR Spectrum, vol.39, issue.1, pp.303-319, 2017.

A. Garcia, P. Vansteenwegen, O. Arbelaitz, W. Souffriau, and M. T. Linaza, Integrating public transportation in personalised electronic tourist guides, Computers & Operations Research, vol.40, issue.3, pp.758-774, 2013.

T. J. Gaskell, Bases for vehicle fleet scheduling, Or, pp.281-295, 1967.

D. Gavalas, C. Konstantopoulos, K. Mastakas, and G. Pantziou, A survey on algorithmic approaches for solving tourist trip design problems, Journal of Heuristics, vol.20, issue.3, pp.291-328, 2014.

D. Gavalas, C. Konstantopoulos, K. Mastakas, G. Pantziou, and N. Vathis, Efficient heuristics for the time dependent team orienteering problem with time windows, Applied Algorithms, pp.152-163, 2014.

D. Gavalas, C. Konstantopoulos, K. Mastakas, G. Pantziou, and N. Vathis, Approximation algorithms for the arc orienteering problem, Information Processing Letters, vol.115, issue.2, pp.313-315, 2015.

B. Gavish and S. C. Graves, The travelling salesman problem and related problems, 1978.

R. Gedik, E. Kirac, A. B. Milburn, and C. Rainwater, A constraint programming approach for the team orienteering problem with time windows, Computers & Industrial Engineering, vol.107, pp.178-195, 2017.

M. Gendreau, A. Hertz, and G. Laporte, A tabu search heuristic for the vehicle routing problem, Management science, vol.40, issue.10, pp.1276-1290, 1994.

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.

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, pp.539-545, 1998.

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, pp.539-545, 1998.

M. Gendreau, J. Potvin, O. Bräumlaysy, G. Hasle, and A. Løkketangen, Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography, pp.143-169, 2008.

M. Gendreau, J. Potvin, O. Bräumlaysy, G. Hasle, and A. Løkketangen, Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography, pp.143-169, 2008.

M. Gendreau and C. D. Tarantilis, Solving large-scale vehicle routing problems with time windows: The state-of-the-art, 2010.

V. Ghilas, E. Demir, and T. Van-woensel, Integrating passenger and freight transportation: Model formulation and insights, Proceedings of the 2013 Beta Working Papers (WP), vol.441, 2013.

V. Ghilas, E. Demir, and T. Van-woensel, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines, Computers & Operations Research, vol.72, pp.12-30, 2016.

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.

R. Giovanni and S. Matteo, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, vol.51, issue.3, pp.155-170, 2008.

B. Golden, A. Assad, and R. Dahl, Analysis of a large scale vehicle routing problem with an inventory component, vol.7, pp.181-190, 1984.

B. L. Golden, L. Levy, and R. Vohra, The orienteering problem, Naval Research Logistics (NRL), vol.34, issue.3, pp.307-318, 1987.

P. Grangier, M. Gendreau, F. Lehuédé, and L. Rousseau, An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization, European Journal of Operational Research, vol.254, issue.1, pp.80-91, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01082951

C. Groër, B. Golden, and E. Wasil, A parallel algorithm for the vehicle routing problem, INFORMS Journal on Computing, vol.23, issue.2, pp.315-330, 2011.

R. N. Guibadj and A. Moukrim, Memetic algorithm with an efficient split procedure for the team orienteering problem with time windows, International Conference on Artificial Evolution. EA 2013, vol.8752, pp.183-194, 2014.

A. Gunawan, H. C. Lau, and K. Lu, An iterated local search algorithm for solving the orienteering problem with time windows, Evolutionary Computation in Combinatorial Optimization, pp.61-73, 2015.

A. Gunawan, H. C. Lau, and K. Lu, Sails: hybrid algorithm for the team orienteering problem with time windows, Proceedings of the 10th international conference of the practice and theory of automated timetabling, pp.202-217, 2015.

A. Gunawan, H. C. Lau, and K. Lu, Well-tuned ils for extended team orienteering problem with time windows, LARC Technical Report Series, 2015.

A. Gunawan, H. C. Lau, and P. Vansteenwegen, Orienteering problem: A survey of recent variants, solution approaches and applications, European Journal of Operational Research, vol.255, issue.2, pp.315-332, 2016.

E. Hadjiconstantinou, N. Christofides, and A. Mingozzi, A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations, Annals of Operations Research, p.61, 1995.

H. Hashimoto and M. Yagiura, A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows, Evolutionary Computation in Combinatorial Optimization, pp.254-265, 2008.

V. Hemmelmayr, K. F. Doerner, R. F. Hartl, and S. Rath, A heuristic solution method for node routing based solid waste collection problems, Journal of Heuristics, vol.19, issue.2, pp.129-156, 2013.

V. C. Hemmelmayr, J. Cordeau, and T. G. Crainic, An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics, Computers & Operations Research, vol.39, issue.12, pp.3215-3228, 2012.

S. C. Ho and M. Gendreau, Path relinking for the vehicle routing problem, Journal of Heuristics, vol.12, issue.1, pp.55-72, 2006.

J. Holland, Adaptation in natural and artificial systems: an introductory analysis with application to biology, Control and artificial intelligence, 1975.

Q. Hu and A. Lim, An iterative three-component heuristic for the team orienteering problem with time windows, European Journal of Operational Research, vol.232, issue.2, pp.276-286, 2014.

S. Irnich, B. Funke, and T. Grünert, Sequential search and its application to vehicle-routing problems, Computers & Operations Research, vol.33, issue.8, pp.2405-2429, 2006.

S. Irnich, M. Schneider, and D. Vigo, Four Variants of the Vehicle Routing Problem, MOS-SIAM Series on Optimization. SIAM, vol.9, pp.241-271, 2014.

S. K. Jacobsen and O. B. Madsen, A comparative study of heuristics for a two-level routing-location problem, European Journal of Operational Research, vol.5, issue.6, pp.378-387, 1980.

M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger, Subset-row inequalities applied to the vehicle-routing problem with time windows, Operations Research, vol.56, issue.2, pp.497-511, 2008.

M. Jepsen, S. Spoorendonk, R. , and S. , A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem, Transportation Science, vol.47, issue.1, pp.23-37, 2013.

M. Jin, K. Liu, and R. O. Bowden, A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem, International Journal of Production Economics, vol.105, issue.1, pp.228-242, 2007.

M. Jin, K. Liu, and B. Eksioglu, A column generation approach for the split delivery vehicle routing problem, Operations Research Letters, vol.36, issue.2, pp.265-270, 2008.

B. Kallehauge, Formulations and exact algorithms for the vehicle routing problem with time windows, Computers & Operations Research, vol.35, issue.7, pp.2307-2330, 2008.

S. Karakati? and V. Podgorelec, A survey of genetic algorithms for solving multi depot vehicle routing problem, Applied Soft Computing, vol.27, pp.519-532, 2015.

L. Ke, C. Archetti, and Z. Feng, Ants can solve the team orienteering problem, Computers & Industrial Engineering, vol.54, issue.3, pp.648-665, 2008.

L. Ke, L. Zhai, J. Li, C. , and F. T. , Pareto mimic algorithm: An approach to the team orienteering problem, Omega, vol.61, pp.155-166, 2016.

M. Keshtkaran, K. Ziarati, A. Bettinelli, and D. Vigo, Enhanced exact solution methods for the team orienteering problem, International Journal of Production Research, vol.54, issue.2, pp.591-601, 2016.

J. Kikuta, T. Ito, I. Tomiyama, S. Yamamoto, and T. Yamada, New subway-integrated city logistics system, Seventh International Conference on City Logistics which was held on, vol.39, pp.476-489, 2011.

B. Kim, S. Kim, and S. Sahoo, Waste collection vehicle routing problem with time windows, Part Special Issue: Recent Algorithmic Advances for Arc Routing Problems, vol.33, pp.3624-3642, 2006.

M. A. Krajewska, H. Kopfer, G. Laporte, S. Ropke, and G. Zaccour, Horizontal cooperation among freight carriers: request allocation and profit sharing, Journal of the Operational Research Society, vol.59, issue.11, pp.1483-1491, 2008.

J. Kytöjoki, T. Nuortio, O. Bräysy, and M. Gendreau, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Computers & Operations Research, vol.34, issue.9, pp.2743-2757, 2007.

N. Labadie, R. Mansini, J. Melechovský, and R. Wolfler-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.
URL : https://hal.archives-ouvertes.fr/hal-02521846

N. Labadie, J. Melechovský, and R. Wolfler-calvo, Hybridized evolutionary local search algorithm for the team orienteering problem with time windows, Journal of Heuristics, vol.17, issue.6, pp.729-753, 2011.
URL : https://hal.archives-ouvertes.fr/hal-02494247

G. Laporte, Fifty Years of Vehicle Routing, Transportation Science, vol.43, pp.408-416, 2009.

G. Laporte, M. Desrochers, and Y. Nobert, Two exact algorithms for the distanceconstrained vehicle routing problem, Networks, vol.14, issue.1, pp.161-172, 1984.

G. Laporte and S. Martello, The selective travelling salesman problem, Discrete Applied Mathematics, vol.26, issue.2, pp.193-207, 1990.

G. Laporte, H. Mercure, and Y. Nobert, An exact algorithm for the asymmetrical capacited vehicle routing problem, Networks, vol.16, pp.33-46, 1986.

G. Laporte and Y. Nobert, A branch and bound algorithm for the capacitated vehicle routing problem, Operations-Research-Spektrum, vol.5, issue.2, pp.77-85, 1983.

G. Laporte, Y. Nobert, and M. Desrochers, Optimal routing under capacity and distance restrictions, Operations research, vol.33, issue.5, pp.1050-1073, 1985.

G. Laporte, Y. Nobert, and S. Taillefer, Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems, Transportation Science, vol.22, issue.3, pp.161-172, 1988.

A. C. Leifer and M. B. Rosenwein, Strong linear programming relaxations for the orienteering problem, European Journal of Operational Research, vol.73, issue.3, pp.517-523, 1994.

J. Leonardi, M. Browne, A. , and J. , Before-after assessment of a logistics trial with clean urban freight vehicles: A case study in london, Seventh International Conference on City Logistics which was held on, vol.39, pp.146-157, 2011.

B. Li, D. Krushinsky, H. A. Reijers, and T. Van-woensel, The Share-A-Ride Problem: People and parcels sharing taxis, European Journal of Operational Research, vol.238, issue.1, pp.31-40, 2014.

B. Li, D. Krushinsky, T. V. Woensel, and H. A. Reijers, An adaptive large neighborhood search heuristic for the share-a-ride problem, Computers & Operations Research, vol.66, pp.170-180, 2016.

B. Li, D. Krushinsky, T. V. Woensel, and H. A. Reijers, The share-a-ride problem with stochastic travel times and stochastic delivery locations, Transportation Research Part C: Emerging Technologies, vol.67, pp.95-108, 2016.

F. Li, B. Golden, and E. Wasil, Very large-scale vehicle routing: new test problems, algorithms, and results, Computers & Operations Research, vol.32, issue.5, pp.1165-1179, 2005.

Y. Li, H. Chen, and C. Prins, Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests, European Journal of Operational Research, vol.252, issue.1, pp.27-38, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02277560

S. Lin, Computer solutions of the traveling salesman problem, The Bell System Technical Journal, vol.44, issue.10, pp.2245-2269, 1965.

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.

S. Lin, Solving the team orienteering problem using effective multi-start simulated annealing, Applied Soft Computing, vol.13, issue.2, pp.1064-1073, 2013.

S. Lin and V. F. 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.

R. Liu, Z. Jiang, R. Y. Fung, F. Chen, and X. Liu, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, Computers & Operations Research, vol.37, issue.5, pp.950-959, 2010.

L. Lozano, D. Duque, and A. L. Medaglia, An exact algorithm for the elementary shortest path problem with resource constraints, Transportation Science, vol.50, issue.1, pp.348-357, 2016.

Y. Lu, U. Benlic, and Q. Wu, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, Computers & Operations Research, vol.90, pp.193-207, 2018.

X. Lv, N. Wang, Y. Zhen, C. , and H. , Shipper collaboration with pickup and delivery requests in reverse logistics, 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM, vol.49, pp.1868-1873, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02565231

X. Lyu, N. Wang, and Z. Y. Chen, Shipper collaboration in forward and reverse logistics, Journal of Industrial & Management Optimization, vol.13, p.1, 1547.
URL : https://hal.archives-ouvertes.fr/hal-02470437

O. B. Madsen, Methods for solving combined two level location-routing problems of realistic dimensions, European Journal of Operational Research, vol.12, issue.3, pp.295-301, 1983.

R. Masson, A. Trentini, F. Lehuédé, N. Malhéné, O. Péton et al., Optimization of a city logistics transportation system with mixed passengers and goods, EURO Journal on Transportation and Logistics, vol.6, issue.1, pp.81-109, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01068305

D. Mester and O. Bräysy, Active guided evolution strategies for large-scale vehicle routing problems with time windows, Computers & Operations Research, vol.32, issue.6, pp.1593-1614, 2005.

R. Montemanni and L. M. Gambardella, Ant colony system for team orienteering problems with time windows, Foundations of Computing and Decision Sciences, vol.34, issue.4, pp.287-306, 2009.

R. Montemanni, D. Weyland, and L. M. Gambardella, An enhanced ant colony system for the team orienteering problem with time windows, International Symposium on Computer Science and Society, pp.381-384, 2011.

J. R. Montoya-torres, J. L. Franco, S. N. Isaza, H. F. Jiménez, and N. Herazo-padilla, A literature review on the vehicle routing problem with multiple depots, Computers & Industrial Engineering, vol.79, pp.115-129, 2015.

S. Muthuswamy and S. S. Lam, Discrete particle swarm optimization for the team orienteering problem, Memetic Computing, vol.3, issue.4, pp.287-303, 2011.

Y. Nagata and O. Bräysy, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, Networks, vol.54, issue.4, pp.205-215, 2009.

Y. Nagata, O. Bräysy, and W. Dullaert, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research, vol.37, issue.4, pp.724-737, 2010.

F. B. Oliveira, R. Enayatifar, H. J. Sadaei, F. G. Guimarães, and J. Potvin, A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem, Expert Systems with Applications, vol.43, pp.117-130, 2016.

B. Ombuki-berman and F. T. Hanshar, Using Genetic Algorithms for Multi-depot Vehicle Routing, pp.77-99, 2009.

I. H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, vol.41, issue.4, pp.421-451, 1993.

G. Ozbaygin, O. Karasan, Y. , and H. , New exact solution approaches for the split delivery vehicle routing problem, EURO Journal on Computational Optimization, vol.6, issue.1, pp.85-115, 2018.

D. Pecin, C. Contardo, G. Desaulniers, and E. Uchoa, New enhancements for the exact solution of the vehicle routing problem with time windows, INFORMS Journal on Computing, vol.29, issue.3, pp.489-502, 2017.

G. Perboli, F. Pezzella, and R. Tadei, Eve-opt: a hybrid algorithm for the capacitated vehicle routing problem, Mathematical Methods of Operations Research, vol.68, issue.2, p.361, 2008.

G. Perboli and R. Tadei, New families of valid inequalities for the two-echelon vehicle routing problem. Electronic notes in discrete mathematics, vol.36, pp.639-646, 2010.

G. Perboli, R. Tadei, and D. Vigo, The two-echelon capacitated vehicle routing problem: Models and math-based heuristics, Transportation Science, vol.45, issue.3, pp.364-380, 2011.

D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Computers & Operations Research, vol.34, issue.8, pp.2403-2435, 2007.

M. Poggi and E. Uchoa, Chapter 3: New Exact Algorithms for the Capacitated Vehicle Routing Problem, MOS-SIAM Series on Optimization. SIAM, vol.3, pp.59-86, 2014.

M. Poggi, H. Viana, and E. Uchoa, The Team Orienteering Problem: Formulations and Branch-Cut and Price, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), vol.14, pp.142-155, 2010.

J. Potvin and J. Rousseau, An exchange heuristic for routing problems with time windows, Journal of the Operational Research Society, vol.46, issue.12, pp.1433-1446, 1995.

E. 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.54, issue.4, pp.190-204, 2009.

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.
URL : https://hal.archives-ouvertes.fr/hal-02478977

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.
URL : https://hal.archives-ouvertes.fr/hal-02478977

C. Prins, A GRASP x evolutionary local search hybrid for the vehicle routing problem, Bio-inspired algorithms for the vehicle routing problem, pp.35-53, 2009.

C. Prins, A GRASP Evolutionary Local Search Hybrid for the Vehicle Routing Problem, pp.35-53, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02476253

C. Prins, N. Labadie, and M. Reghioui, Tour splitting algorithms for vehicle routing problems, International Journal of Production Research, vol.47, issue.2, pp.507-535, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02525151

R. Ramesh and K. M. Brown, An efficient four-phase heuristic for the generalized orienteering problem, Computers & Operations Research, vol.18, issue.2, pp.151-165, 1991.

R. Ramesh, Y. Yoon, and M. H. Karwan, An optimal algorithm for the orienteering tour problem, ORSA Journal on Computing, vol.4, issue.2, pp.155-165, 1992.

M. Reimann, K. Doerner, and R. F. Hartl, D-ants: Savings based ants divide and conquer the vehicle routing problem, Computers & Operations Research, vol.31, issue.4, pp.563-591, 2004.

J. Renaud, F. F. Boctor, and G. Laporte, An improved petal heuristic for the vehicle routeing problem, Journal of the Operational Research Society, pp.329-336, 1996.

P. P. Repoussis, C. D. Tarantilis, and G. Ioannou, Arc-guided evolutionary algorithm for the vehicle routing problem with time windows, IEEE Transactions on Evolutionary Computation, vol.13, issue.3, pp.624-647, 2009.

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.

Y. Rochat and É. D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics, vol.1, issue.1, pp.147-167, 1995.

R. A. Rossi, D. F. Gleich, A. H. Gebremedhin, M. M. Patwary, A. et al., A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components, 2013.

D. M. Ryan, C. Hjorring, and F. Glover, Extensions of the petal method for vehicle routeing, Journal of the Operational Research Society, pp.289-296, 1993.

R. Sadykov and F. Vanderbeck, Bin packing with conflicts: A generic branch-and-price algorithm, INFORMS Journal on Computing, vol.25, issue.2, pp.244-255, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00539869

F. A. Santos, A. S. Da-cunha, and G. R. Mateus, Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem, Optimization Letters, vol.7, issue.7, pp.1537-1547, 2013.

F. A. Santos, G. R. Mateus, and A. S. Da-cunha, A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, Transportation Science, vol.49, issue.2, pp.355-368, 2014.

M. Schilde, K. F. Doerner, R. F. Hartl, and G. Kiechle, Metaheuristics for the bi-objective orienteering problem, Swarm Intelligence, vol.3, issue.3, pp.179-201, 2009.

V. Schmid and J. F. Ehmke, An effective large neighborhood search for the team orienteering problem with time windows, Computational Logistics, pp.3-18, 2017.

F. Semet, P. Toth, and D. Vigo, Chapter 2: Classical Exact Algorithms for the Capacitated Vehicle Routing Problem, MOS-SIAM Series on Optimization. SIAM, vol.18, pp.37-57, 2014.

P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, Principles and Practice of Constraint Programming-CP98, pp.417-431, 1998.

M. M. Silva, A. Subramanian, and L. S. Ochi, An iterated local search heuristic for the split delivery vehicle routing problem, Computers & Operations Research, vol.53, pp.234-249, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00946296

M. M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.

L. Song, H. Gu, and H. Huang, A lower bound for the adaptive two-echelon capacitated vehicle routing problem, Journal of Combinatorial Optimization, vol.33, pp.1145-1167, 2017.

W. Souffriau, P. Vansteenwegen, G. V. Berghe, and D. V. Oudheusden, A path relinking approach for the team orienteering problem, Metaheuristics for Logistics and Vehicle Routing, vol.37, pp.1853-1859, 2010.

W. Souffriau, P. Vansteenwegen, G. Vanden-berghe, and D. Van-oudheusden, The multiconstraint team orienteering problem with multiple time windows, Transportation Science, vol.47, issue.1, pp.53-63, 2013.

W. Souffriau, P. Vansteenwegen, J. Vertommen, G. V. Berghe, and D. V. Oudheusden, A personalized tourist trip design algorithm for mobile tourist guides, Applied Artificial Intelligence, vol.22, issue.10, pp.964-985, 2008.

M. Soysal, J. M. Bloemhof-ruwaard, and T. Bekta?, The time-dependent two-echelon capacitated vehicle routing problem with environmental considerations, International Journal of Production Economics, vol.164, pp.366-378, 2015.

K. Sörensen and M. Sevaux, Ma-pm: memetic algorithms with population management, Computers & Operations Research, vol.33, issue.5, pp.1214-1225, 2006.

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

H. Tae and B. Kim, A branch-and-price approach for the team orienteering problem with time windows, International Journal of Industrial Engineering, vol.22, issue.2, pp.243-251, 2015.

É. Taillard, Parallel iterative search methods for vehicle routing problems, Networks, vol.23, issue.8, pp.661-673, 1993.

Y. Takeo, K. Seiji, and W. Kohtaro, Heuristic and exact algorithms for the disjunctively constrained knapsack problem, vol.43, pp.2864-2870, 2002.

H. Tang and E. Miller-hooks, A tabu search heuristic for the team orienteering problem, Computers & Operations Research, vol.32, issue.6, pp.1379-1407, 2005.

H. Tang and E. Miller-hooks, A tabu search heuristic for the team orienteering problem, Computers & Operations Research, vol.32, pp.1379-1407, 2005.

E. Taniguchi and R. G. Thompson, Modeling city logistics, Transportation Research Record, vol.1790, issue.1, pp.45-51, 2002.

E. Taniguchi and R. G. Thompson, City Logistics -Mapping The Future, 2014.

E. Taniguchi, R. G. Thompson, and T. Yamada, New opportunities and challenges for city logistics, Tenth International Conference on City Logistics, vol.12, pp.5-13, 2015.

E. Taniguchi, R. G. Thompson, T. Yamada, and J. Van-duin, City logistics -Network modelling and intelligent transport systems, 2001.

C. Tarantilis, Solving the vehicle routing problem with adaptive memory programming methodology, Computers & Operations Research, vol.32, issue.9, pp.2309-2327, 2005.

C. Tarantilis, F. Stavropoulou, and P. Repoussis, The capacitated team orienteering problem: A bi-level filter-and-fan method, European Journal of Operational Research, vol.224, issue.1, pp.65-78, 2013.

C. D. Tarantilis, A. K. Anagnostopoulou, and P. P. Repoussis, Adaptive path relinking for vehicle routing and scheduling problems with product returns, Transportation Science, vol.47, issue.3, pp.356-379, 2013.

C. D. Tarantilis, E. E. Zachariadis, and C. T. Kiranoudis, A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities, INFORMS Journal on Computing, vol.20, issue.1, pp.154-168, 2008.

R. E. Tarjan, Graph theory and gaussian elimination, 1975.

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

P. M. Thompson and H. N. Psaraftis, Cyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems, Operations research, vol.41, issue.5, pp.935-946, 1993.

R. G. Thompson and E. Taniguchi, City Logistics Mapping The Future, City Logistics -Mapping The Future, chapter 13-Future Directions, pp.201-210, 2014.

P. Toth and D. Vigo, The vehicle routing problem, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01223571

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.

P. Toth and D. Vigo, Vehicle Routing: Problems, Methods, and Applications, Second Edition. Number 18 in MOS-SIAM Series on Optimization. SIAM, 2014.

A. Trentini and N. Mahléné, Toward a Shared Urban Transport System Ensuring Passengers & Goods Cohabitation, TeMa Journal of Land Use, Mobility and Environment, vol.3, issue.2, pp.37-44, 2010.

A. Trentini, R. Masson, F. Lehuédé, N. Malhéné, O. Péton et al., A shared " passengers & goods " city logistics system, p.10, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00861728

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, pp.351-367, 2010.

T. Tsiligirides, Heuristic methods applied to orienteering, Journal of the Operational Research Society, vol.35, issue.9, pp.797-809, 1984.

T. Van-rooijen and H. Quak, City logistics in the european civitas initiative, Eighth International Conference on City Logistics, vol.125, pp.312-325, 2013.

P. Vansteenwegen, W. Souffriau, G. V. Berghe, and D. V. Oudheusden, A guided local search metaheuristic for the team orienteering problem, European Journal of Operational Research, vol.196, issue.1, pp.118-127, 2009.

P. Vansteenwegen, W. Souffriau, G. V. Berghe, and D. V. Oudheusden, Iterated local search for the team orienteering problem with time windows, Computers & Operations Research, vol.36, issue.12, pp.3281-3290, 2009.

P. Vansteenwegen, W. Souffriau, G. V. Berghe, and D. V. Oudheusden, Metaheuristics for Tourist Trip Planning, pp.15-31, 2009.

P. Vansteenwegen, W. Souffriau, and D. V. Oudheusden, The orienteering problem: A survey, European Journal of Operational Research, vol.209, issue.1, pp.1-10, 2011.

P. Vansteenwegen, W. Souffriau, and K. Sörensen, The travelling salesperson problem with hotel selection, Journal of the Operational Research Society, vol.63, issue.2, pp.207-217, 2012.

P. Vansteenwegen and D. Van-oudheusden, The mobile tourist guide: An or opportunity, OR Insight, vol.20, issue.3, pp.21-27, 2007.

C. Verbeeck, P. Vansteenwegen, and E. Aghezzaf, An extension of the arc orienteering problem and its application to cycle trip planning, Transportation Research Part E: Logistics and Transportation Review, vol.68, pp.64-78, 2014.

L. Verdonck, A. Caris, K. Ramaekers, and G. K. Janssens, Collaborative logistics from the perspective of road transportation companies, Transport Reviews, vol.33, issue.6, pp.700-719, 2013.

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

T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, European Journal of Operational Research, vol.231, issue.1, pp.1-21, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02493969

T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, Heuristics for multi-attribute vehicle routing problems: A survey and synthesis, European Journal of Operational Research, vol.231, pp.1-21, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02493969

T. Vidal, T. G. 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-489, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02476430

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

K. Wang, Y. Shao, and W. Zhou, Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service, Transportation Research Part D, vol.57, pp.262-276, 2017.

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.

T. Yamada, City Logistics Mapping The Future, City Logistics -Mapping The Future, chapter 11-Cooperative Freight Transport Systems, pp.167-176, 2014.

P. C. Yellow, A computational modification to the savings method of vehicle scheduling, Operational Research Quarterly, pp.281-283, 1970.

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-176, 2009.

Z. Y. Zeng, W. S. Xu, Z. Y. Xu, and W. H. Shao, A Hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics, 2014.

L. Zhou, R. Baldacci, D. Vigo, W. , and X. , A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution, European Journal of Operational Research, vol.265, issue.2, pp.765-778, 2018.

. E-n22,

, Avg

, Avg

A. Benchmarks,

B. Table, 6 -Results on Set 6a instances