C. Ottawa, IFAC-PapersOnLine, pp.193-199, 2015.

?. Y. Rahmani, A. Oulamara, and W. Ramdane-cherif, Using Clustering Method to Solve Two Echelon Multi-Products Location-Routing Problem with Pickup and Delivery, ICORES, vol.2014, pp.425-433, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01307469

?. Y. Rahmani, A. Oulamara, and W. R. Cherif, Multi-products Location-Routing Problem with Pickup and Delivery, 2013 International Conference on Advanced Logistics and Transport, pp.29-31, 2013.
DOI : 10.1109/ICAdLT.2013.6568445

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

?. Y. Rahmani, A. Oulamara, and W. R. Cherif, Multi-products Location-Routing Problem with Pickup and Delivery, 2013 International Conference on Advanced Logistics and Transport, pp.22-24, 2013.
DOI : 10.1109/ICAdLT.2013.6568445

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

Y. Agarwal, K. Mathur, and H. M. Salkin, A set-partitioning-based exact algorithm for the vehicle routing problem, Networks, vol.19, issue.7, pp.731-749, 1989.
DOI : 10.1002/net.3230190702

A. Wren, Computers in Transport Planning and Operation, pp.103-106, 1971.

S. Anily and J. Bramel, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Naval Research Logistics, vol.2, issue.6, pp.654-670, 1999.
DOI : 10.1287/ijoc.2.1.64

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

A. Ahmadi-javid and N. Azad, Incorporating location, routing and inventory decisions in supply chain network design, Transportation Research Part E: Logistics and Transportation Review, vol.46, issue.5, pp.582-597, 2010.
DOI : 10.1016/j.tre.2009.06.005

M. Azi, J. Y. 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

J. Ahn, D. O. Weck, Y. Geng, and D. Klabjan, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, European Journal of Operational Research, vol.223, issue.1, pp.47-59, 2012.
DOI : 10.1016/j.ejor.2012.06.018

M. Albareda-sambola, E. Fernndez, and S. Nickel, Multiperiod Location-Routing with Decoupled Time Scales, European Journal of Operational Research, vol.217, issue.2, pp.248-258, 2012.
DOI : 10.1016/j.ejor.2011.09.022

M. Adelzadeh, V. M. Asi, and M. Koosha, A mathematical model and solving procedure for the multi-depot vehicle routing problem with fuzzy time

E. Ardjmand, G. Weckman, N. Park, P. Taherkhani, and M. Singh, Applying genetic algorithm to a new location and routing model of hazardous materials, International Journal of Production Research, vol.53, issue.3, pp.916-928, 2015.
DOI : 10.1016/j.jhazmat.2012.05.028

P. Augerat, J. M. Belenguer, E. Benavent, A. Corberan, and D. Naddef, Separating capacity constraints in the CVRP using tabu search, European Journal of Operational Research, vol.106, issue.2-3, pp.546-557, 1998.
DOI : 10.1016/S0377-2217(97)00290-7

N. Ascheuer, M. Junger, and G. Reinelt, A branch-and-cut algorithm for the asymmetric traveling salesman problem with precedence constraints, Computational Optimization and Applications, vol.17, issue.1, pp.61-84, 2000.
DOI : 10.1023/A:1008779125567

L. Bianco, A. Mingozzi, S. Riccardelli, and M. Spadoni, Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming, INFOR: Information Systems and Operational Research, vol.32, issue.1, 1994.
DOI : 10.1080/03155986.1994.11732235

J. Barcelo and J. Casanovas, A heuristic lagrangean algorithm for the capacitated plant location problem, European Journal of Operational Research, vol.15, issue.2, p.212226, 1984.
DOI : 10.1016/0377-2217(84)90211-X

A. Balakrishnan, Integrated Facility Location and Vehicle Routing Models: Recent Work and Future Prospects, American Journal of Mathematical and Management Sciences, vol.19, issue.1-2, pp.35-61, 1987.
DOI : 10.1057/jors.1968.74

R. Bowerman, B. Hall, and P. Calamai, A multi-objective optimization approach to urban school bus routing: Formulation and solution method, Transportation Research Part A: Policy and Practice, vol.29, issue.2, pp.2-107, 1995.
DOI : 10.1016/0965-8564(94)E0006-U

R. Borges-lopes, F. Plastria, C. Ferreira, and B. Sousa-santos, Location-arc routing problem: Heuristic approaches and test instances, Computers & Operations Research, vol.43, pp.309-317, 2014.
DOI : 10.1016/j.cor.2013.10.003

R. E. Burksjr, An adaptive taboo search heuristic for the location routing pickup and delivery problem with time windows with a theater distribution application, Ph.D. Dissertation, Air force institute of technology, 2006.

R. Baldacci, N. Christofides, and A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.120, issue.2, pp.351-385, 2008.
DOI : 10.1287/opre.33.5.1050

M. L. Brandeau and S. S. Chiu, An Overview of Representative Problems in Location Research, Management Science, vol.35, issue.6, pp.645-74, 1989.
DOI : 10.1287/mnsc.35.6.645

F. Bernardes-de-oliveira, R. Enayatifar, H. J. Sadaei, F. G. Guimaraes, and J. Y. Potvin, A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem, Expert Systems with Applications, issue.2

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.
DOI : 10.1287/opre.1040.0111

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.
DOI : 10.1287/opre.12.2.300

J. E. 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. E. Beasley, An algorithm for set covering problem, European Journal of Operational Research, vol.31, issue.1, pp.85-93, 1987.
DOI : 10.1016/0377-2217(87)90141-X

J. M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfer-calvo, A Branch-and-Cut method for the Capacitated Location-Routing Problem, Computers & Operations Research, vol.38, issue.6, pp.931-941, 2011.
DOI : 10.1016/j.cor.2010.09.019

M. Bellmore and J. C. Malone, Pathology of Traveling-Salesman Subtour-Elimination Algorithms, Operations Research, vol.19, issue.2, pp.278-307, 1971.
DOI : 10.1287/opre.19.2.278

J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

E. Balas, M. Fischetti, and W. R. Pulleyblank, The precedence-constrained asymmetric traveling salesman polytope, Mathematical Programming, vol.22, issue.1-3, 1995.
DOI : 10.1007/BF01585767

R. Bellman, Dynamic programming and the numerical solution of variational problems, Operations Research, vol.5, pp.277-288, 1957.

G. Berbeglia, J. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a??classification scheme and survey, TOP, vol.41, issue.2, pp.1-31, 2007.
DOI : 10.1137/1.9780898718515.ch8

J. Berger and M. Barkaoui, A new hybrid genetic algorithm for the capacitated vehicle routing problem, Journal of the Operational Research Society, vol.7, issue.12, pp.1254-1262, 2003.
DOI : 10.1002/net.3230230804

R. Baldacci, A. Mingozzi, and R. Wolfler-calvo, An Exact Method for the Capacitated Location-Routing Problem, Operations Research, vol.59, issue.5, pp.1284-1296, 2011.
DOI : 10.1287/opre.1110.0989

S. Barreto, C. Ferreira, J. Paixao, S. Santos, and B. , Using clustering analysis in a capacitated location-routing problem, European Journal of Operational Research, vol.179, issue.3, pp.968-977, 2007.
DOI : 10.1016/j.ejor.2005.06.074

M. Boccia, T. Crainic, A. Sforza, and C. Sterle, A Metaheuristic for a Two Echelon Location-Routing Problem, Symposium on Experimental Algorithms -SEA 2010, pp.288-301, 2010.
DOI : 10.1007/978-3-642-13193-6_25

M. Boccia, T. Crainic, A. Sforza, and C. Sterle, Location-routing models for designing a two-echelon freight distribution system, Tech. Rep, pp.2011-2017, 2011.

A. Bruns and A. Klose, An iterative heuristic for location-routing problems based on clustering The Netherlands, Proceedings of the Second International Workshop on Distribution Logistics, pp.1-6, 1995.

C. Contardo, V. Hemmelmayr, and T. G. Crainic, Lower and upper bounds for the two-echelon capacitated location-routing problem, Computers & Operations Research, vol.39, issue.12, pp.3185-3199, 2012.
DOI : 10.1016/j.cor.2012.04.003

T. G. Crainic, S. Mancini, G. Perboli, G. Tadei, and R. , Heuristics for the twoechelon capacitated vehicle routing problem. WP. CIRRELT-2008-46, Canada, 2008.

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

M. C. Carrera, W. Portmann, and R. Cherif, Scheduling problems for logistic platforms with fixed staircase component arrivals and various deliveries hypotheses, Proceedings of the 2 th International Conference on Applied Operational Research, Finlande, p.517528, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00523289

A. Claus, A New Formulation for the Travelling Salesman Problem, SIAM Journal on Algebraic Discrete Methods, vol.5, issue.1, pp.21-25, 1984.
DOI : 10.1137/0605004

S. Ceria, P. Nobili, A. Sassano, and J. E. Beasley, A lagrangian-based heuristic for large-scale set covering problems A tree search algorithm for the p-median problem, Mathematical Programming, pp.215-228196, 1982.

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. F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J. S. Sormany, New Heuristics for the Vehicle Routing Problem, 2004.
DOI : 10.1007/0-387-24977-X_9

C. H. Christiansen, Elements of Vehicle Routing under uncertainty, 2007.

J. F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J. S. Sormany, New Heuristics for the Vehicle Routing Problem, Logistics Systems -Design and Optimization, pp.279-298, 2005.
DOI : 10.1007/0-387-24977-X_9

J. F. Cordeau and G. Laporte, Tabu Search Heuristics for the Vehicle Routing Problem, 2002.
DOI : 10.1007/0-387-23667-8_6

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.
DOI : 10.1016/j.trc.2004.07.002

C. Contardo, J. Cordeau, and B. Gendron, An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem, INFORMS Journal on Computing, vol.26, issue.1, pp.88-102, 2014.
DOI : 10.1287/ijoc.2013.0549

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.
DOI : 10.1016/j.disopt.2014.03.001

T. G. Crainic, N. Ricciardi, and G. Storchi, Models for evaluating and planning city logistic transportation systems, 2007.

I. M. Coelho, P. L. Munhoz, M. N. Haddad, M. J. Souza, and L. S. Ochi, A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups, Electronic Notes in Discrete Mathematics, vol.39, pp.99-106, 2012.
DOI : 10.1016/j.endm.2012.10.014

D. Cattaruzza, N. Absi, D. Feillet, and D. Vigo, An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows, Computers & Operations Research, vol.51, 2014.
DOI : 10.1016/j.cor.2014.06.006

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

B. Crevier, J. F. Cordeau, and G. Laporte, The multi-depot vehicle routing [60] N. Christofides, N. Eilon, An algorithm for the vehicle-dispatching problem, Operational Research Quarterly, vol.20, issue.3, pp.309-318, 1969.

A. L. Chen, G. K. Yang, and Z. M. Wu, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Journal of Zhejiang University-SCIENCE A, vol.7, issue.4, pp.607-614, 2006.
DOI : 10.1631/jzus.2006.A0607

T. G. Crainic, S. Mancini, G. Perboli, and R. Tadei, Lower bounds for the twoechelon capacitated vehicle routing problem, Annual Conference of the EURO Working Group on Metaheuristics, 2008.

S. Cetiner, C. Sepil, and H. Sural, Hubbing and routing in postal delivery systems, Annals of Operations Research, vol.29, issue.3, pp.109-124, 2010.
DOI : 10.1057/jors.1984.162

R. Cuda, G. Guastaroba, and M. G. Speranza, A survey on two-echelon routing problems, Computers & Operations Research, vol.55, pp.185-199, 2015.
DOI : 10.1016/j.cor.2014.06.008

R. De-camargo, G. De-miranda, and A. Lokketangen, A new formulation and an exact approach for the many-to-many hub location-routing problem, Applied Mathematical Modelling, vol.37, issue.12-13, pp.7465-7480, 2013.
DOI : 10.1016/j.apm.2013.02.035

M. Drexl and M. Schneider, A survey of variants and extensions of the location-routing problem, European Journal of Operational Research, vol.241, issue.2, pp.283-308, 2015.
DOI : 10.1016/j.ejor.2014.08.030

M. Dror, D. Fortin, and C. , Redistribution of self-service electric cars : A case of pickup and delivery, Tech. Rep. W.P, vol.3543, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073142

U. Derigs and T. , Indirect search for the vehicle routing problem with pickup and delivery and time windows, OR Spectrum, vol.35, issue.2, pp.149-165, 2008.
DOI : 10.1007/s00291-006-0072-1

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

E. Demir, T. Bekta, 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. Dorigo, V. Maniezzo, A. Colorni, G. B. Dantzig, and K. H. Ramser, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.26, issue.1, pp.29-4180, 1959.
DOI : 10.1109/3477.484436

M. Desrochers and T. W. Verhoog, A matching based savings algorithm for the vehicle routing problem, 1989.

H. Derbel, B. Jarboui, S. Hanafi, and H. Chabchoub, An Iterated Local Search for Solving A Location-Routing Problem, Electronic Notes in Discrete Mathematics, vol.36, pp.875-882, 2010.
DOI : 10.1016/j.endm.2010.05.111

H. Derbel, B. Jarboui, S. Hanafi, and H. Chabchoub, Genetic algorithm with iterated local search for solving a location-routing problem, Expert Systems with Applications, vol.39, issue.3, 2012.
DOI : 10.1016/j.eswa.2011.08.146

C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon, A GRASP??ELS approach for the capacitated location-routing problem, Computers & Operations Research, vol.37, issue.11, pp.1912-1923, 2010.
DOI : 10.1016/j.cor.2009.07.004

C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon, A GRASP??ELS approach for the capacitated location-routing problem, Computers & Operations Research, vol.37, issue.11, 2010.
DOI : 10.1016/j.cor.2009.07.004

E. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

S. Eilon, C. D. Watson-gandy, and N. Christofides, Distribution Management-Mathematical Modelling and Practical Analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.4, issue.6, 1971.
DOI : 10.1109/TSMC.1974.4309370

T. A. Feo and M. G. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, vol.8, issue.2, pp.67-71, 1989.
DOI : 10.1016/0167-6377(89)90002-3

M. Fischetti, P. Toth, and D. Vigo, A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs, Operations Research, vol.42, issue.5, pp.846-859, 1994.
DOI : 10.1287/opre.42.5.846

M. H. Fazel-zarandi, A. Hemmati, S. Davari, and B. Turksen, Capacitated locationrouting problem with time windows under uncertainty, Knowledge-Based Systems, pp.480-489, 2013.

M. L. Fisher, Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees, Operations Research, vol.42, issue.4, pp.626-642, 1994.
DOI : 10.1287/opre.42.4.626

M. L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks, vol.21, issue.2, pp.109-124, 1981.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

. Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Mathematical Programming, vol.106, pp.491-511, 2006.

F. Glover, Tabu search and adaptive memory programing -advances, applications and challenges, Interfaces in Computer Science and Operations Research, pp.1-75, 1996.

A. Gibbons, Algorithmic Graph Theory, 1985.

B. George, B. Dantzig, and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research, vol.8, 1960.

L. Gao and E. J. Powell-robinson, A dual-based optimization procedure for the two-echelon uncapacitated facility location problem, Naval Research Logistics, vol.28, issue.2, pp.191-212, 1992.
DOI : 10.1016/S0167-5060(08)70728-3

H. Gunnarsson, M. Ronnqvist, and D. Carlsson, A combined terminal location and ship routing problem, Journal of the Operational Research Society, vol.35, issue.3, pp.928-938, 2006.
DOI : 10.1057/palgrave.jors.2600908

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.
DOI : 10.1287/mnsc.40.10.1276

M. Gendreau, G. Laporte, and J. Y. Potvin, The vehicle routing problem, chapter Metaheuristics for the vehicle routing problem, 2001.

M. Gendreau, G. Laporte, and R. Seguin, Stochastic vehicle routing, European Journal of Operational Research, vol.88, issue.1, pp.3-12, 1996.
DOI : 10.1016/0377-2217(95)00050-X

B. Gendron and F. Semet, Formulations and relaxations for a multi-echelon capacitated location???distribution problem, Computers & Operations Research, vol.36, issue.5, pp.1335-1355, 2009.
DOI : 10.1016/j.cor.2008.02.009

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

B. L. Golden, A. Assad, L. Levy, and F. Gheysens, The fleet size and mix routing problem, Management Science and Statistics. Working paper, 1982.

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

M. Gendreau, G. Laporte, D. Vigo100-]-g, G. Gutierrez-jarpa, G. Desaulniers et al., Heuristics for the traveling salesman problem with pickup and delivery, Computers & Operations Research, vol.26, issue.7, pp.699-714, 1999.
DOI : 10.1016/S0305-0548(98)00085-9

J. Gonzalez-feliu, Models and methods for the city logistics. The two-echelon capacitated vehicle routing problem, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00844731

J. Gonzalez-feliu, The multi-echelon location-routing problem : Concepts and methods for tactical and operational planning, 2010.

L. Gouveia and P. Pesneau, On extended formulations for the precedence constrained asymmetric traveling salesman problem, Networks, vol.22, issue.2, pp.77-89, 2006.
DOI : 10.1002/net.20122

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

G. Guastaroba, M. G. Speranza, and D. Vigo, Designing service networks with intermediate facilities : an overview, under review, 2014.

J. and G. Feliu, Two-echelon freight transport optimization : unifying concepts via a systematic review, Working papers on operations management, pp.18-30, 2011.

K. Govindan, A. Jafarian, R. Khodaverdi, and K. Devika, Two-echelon multiplevehicle location?routing problem with time windows for optimization of sustainable supply chain network of perishable food, International Journal of Production Economics, vol.152, 2014.

W. J. Guerrero and C. Prodhon, Capacitated hierarchical clustering heuristic for multi depot location-routing problems, International Journal of Logistics Research and Applications : A Leading Journal of Supply Chain Management, vol.16, issue.5, pp.433-444, 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, 2012.
DOI : 10.1016/j.cor.2012.04.007

R. W. Hall, Vehicle Routing Software Survey, 2013.

P. Hansen and N. Mladenovic, Variable neighborhood search: Principles and applications, European Journal of Operational Research, vol.130, issue.3, pp.449-467, 2001.
DOI : 10.1016/S0377-2217(00)00100-4

E. Hadjiconstantinou, N. Christofides, and A. Mingozzi, A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations, Annals of Operations Research, vol.23, issue.1, pp.21-43, 1995.
DOI : 10.1007/BF02098280

W. Haijun, D. Lijing, and M. Shihua, Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake, Transportation Research Part E : Logistics and Transportation Review, pp.160-179, 2014.

S. Hakimi, Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph, Operations Research, vol.12, issue.3, pp.450-459, 1964.
DOI : 10.1287/opre.12.3.450

P. Healy and R. Moll, A new extension of local search applied to the Dial-A-Ride Problem, European Journal of Operational Research, vol.83, issue.1, 1995.
DOI : 10.1016/0377-2217(93)E0292-6

H. Hernandez-perez and J. Salazar-gonzalez, The one-commodity pickup-anddelivery travelling salesman problem, Combinatorial Optimization Eureka,You Shrink Springer, pp.89-104, 2003.

H. Hernandez-perez and J. Salazar-gonzalez, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, European Journal of Operational Research, vol.196, issue.3, pp.987-995, 2009.
DOI : 10.1016/j.ejor.2008.05.009

H. Hernandez-perez and J. Salazar-gonzalez, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Discrete Applied Mathematics, vol.145, issue.1, pp.126-139, 2004.
DOI : 10.1016/j.dam.2003.09.013

M. Hamidi, K. Farahmand, S. R. Sajjadi, and K. Nygard, A heuristic algorithm for a multi-product four-layer capacitated location-routing problem, international journal of industrial engineering computations, vol.5, issue.1, pp.87-100, 2014.
DOI : 10.5267/j.ijiec.2013.09.008

S. H. Huang, Solving the multi-compartment capacitated location routing problem with pickup???delivery routes and stochastic demands, Computers & Industrial Engineering, vol.87, 2015.
DOI : 10.1016/j.cie.2015.05.008

M. Hamidi, K. Farahmand, and S. R. Sajjadi, Modeling a four-layer location-routing problem, International Journal of Industrial Engineering Computations, vol.3, issue.1, pp.43-52, 2012.
DOI : 10.5267/j.ijiec.2011.08.015

J. H. Holmberg, M. Ronnqvist, and E. D. Yuan, Adaptation in natural and artificial systems The University of Michigan Press An exact algorithm for the capacitated facility location problems with single sourcing, Tech. rep. European Journal of Operational Research, vol.123, issue.113, p.544559, 1975.

D. , I. , G. Paletta, and F. Vocaturo, A ship-truck intermodal transportation problem, Marit Econ Logist, vol.11, pp.247-59, 2009.

T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno et al., An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, Discrete Applied Mathematics, vol.156, issue.11, pp.2050-2069, 2008.
DOI : 10.1016/j.dam.2007.04.022

W. C. Jordan and L. D. Burns, Truck backhauling on two terminal networks, Transportation Research Part B: Methodological, vol.18, issue.6, pp.487-503, 1984.
DOI : 10.1016/0191-2615(85)90014-1

S. Jacobsen and O. 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.
DOI : 10.1016/0377-2217(80)90124-1

E. L. Johnson, Modeling and Strong Linear Programs for Mixed Integer Programming, Algorithms and Model Formulations in Mathematical Programming, 1989.
DOI : 10.1007/978-3-642-83724-1_1

J. G. Klincewicz and H. Luss, A lagrangian relaxation heuristic for capacitated facility location with single-source constraints, Journal of the Operational Research Society, vol.37, issue.5, p.495500, 1986.

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

L. Kaufman, M. V. Ecde, and P. Hansen, A Plant and Warehouse Location Problem, Journal of the Operational Research Society, vol.28, issue.3, pp.547-554, 1977.
DOI : 10.1057/jors.1977.104

B. Kalantari, A. Hill, and S. Arora, An algorithm for the traveling salesman problem with pickup and delivery customers, European Journal of Operational Research, vol.22, issue.3, pp.377-386, 1985.
DOI : 10.1016/0377-2217(85)90257-7

V. Kachitvichyanukul, P. Sombuntham, and S. Kunnapapdeelert, Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO, Computers & Industrial Engineering, vol.89, 2015.
DOI : 10.1016/j.cie.2015.04.011

J. G. Klincewicz and H. Luss, A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints, Journal of the Operational Research Society, vol.37, issue.5, pp.495-500, 1986.
DOI : 10.1057/jors.1986.84

I. Karaoglan, F. Altiparmak, I. Kara, and B. Dengiz, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, European Journal of Operational Research, vol.211, issue.2, pp.318-332, 2011.
DOI : 10.1016/j.ejor.2011.01.003

C. Koc, T. Bekta, and O. Jabali, The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm, European Journal of Operational Research, vol.248, issue.1, pp.33-51, 2016.
DOI : 10.1016/j.ejor.2015.06.082

I. Karaoglan and F. Altiparmak, A memetic algorithm for the capacitated locationrouting problem with mixed backhauls, Computers & Operations Research, vol.55, 2015.

I. Karaoglan, F. Altiparmak, I. Kara, and B. Dengiz, The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach, Omega, vol.40, issue.4, 2012.
DOI : 10.1016/j.omega.2011.09.002

A. Klose and A. Drexl, Facility location models for distribution system design, European Journal of Operational Research, vol.162, issue.1, pp.4-29, 2005.
DOI : 10.1016/j.ejor.2003.10.031

G. Laporte and Y. Nobert, An exact algorithm for minimizing routing and operating costs in depot location, European Journal of Operational Research, vol.6, issue.2, pp.224-226, 1981.
DOI : 10.1016/0377-2217(81)90212-5

G. Laporte, Y. Nobert, and D. Arpin, An exact algorithm for solving a capacitated location-routing problem, Annals of Operations Research, vol.1, issue.9, pp.293-310, 1986.
DOI : 10.1080/05695557908974447

J. Li, C. Prins, and F. Chu, A scatter search for a multi-type transshipment point location problem with multicommodity flow, Journal of Intelligent Manufacturing, vol.25, issue.10, pp.1103-1117, 2012.
DOI : 10.1007/978-1-4615-0337-8

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

J. Lin and H. Lei, Distribution systems design with two-level routing considerations, Annals of Operations Research, vol.29, issue.10, pp.329-347, 2009.
DOI : 10.1080/05695557908974447

R. B. Lopesa, C. Ferreira, B. S. Beatriz-sousa-santo, and S. Barreto, A taxonomical analysis, current methods and objectives on location-routing problems, International Transactions in Operational Research, vol.1245, issue.8, pp.795-822, 2013.
DOI : 10.1016/j.knosys.2012.09.007

G. Laporte, M. Desrochers, and Y. Norbert, Two exact algorithms for the distance-constrained vehicle routing problem, Networks, vol.3, issue.1, pp.161-172, 1984.
DOI : 10.1002/net.3230140113

G. Laporte, M. Gendreau, J. Potvin, and F. Semet, Classical and modern heuristics for the vehicle routing problem, International Transactions in Operational Research, vol.21, issue.4-5, pp.285-300, 2000.
DOI : 10.2307/2584478

G. Laporte, F. Louveaux, H. Mercure, H. R. Lourenco, O. C. Martin et al., Models and exact solutions for a class of stochastic location-routing problems Iterated local search, Handbook of metaheuristics, pp.71-78, 1989.

G. Laporte and Y. Norbert, Exact Algorithms for the Vehicle Routing Problem, Annals of Discrete Mathematics, vol.31, pp.147-184, 1987.
DOI : 10.1016/S0304-0208(08)73235-3

G. Laporte, Location-routing problems Vehicle Routing : Methods and Studies, pp.163-198, 1988.

G. Laporte, Fifty Years of Vehicle Routing, Transportation Science, vol.43, issue.4, pp.408-424, 2009.
DOI : 10.1287/trsc.1090.0301

S. Lin, Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, vol.44, issue.10, pp.2245-2269, 1965.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

C. K. Lin and R. C. Kwok, Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data, European Journal of Operational Research, vol.175, issue.3
DOI : 10.1016/j.ejor.2004.10.032

C. Lin and R. Kwok, Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data, European Journal of Operational Research, vol.175, issue.3, 2006.
DOI : 10.1016/j.ejor.2004.10.032

J. Lysgaard, A CVRPSEP package

J. Li, P. M. Pardalos, H. Sun, J. Pei, and Y. Zhang, Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups, Expert Systems with Applications, vol.42, issue.7, pp.3551-3561, 2015.
DOI : 10.1016/j.eswa.2014.12.004

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

L. F. Lopez-castro and J. R. Montoya-torres, Vehicle routing problem with fuzzy time windows, Proceedings of the 2011 IEEE workshop on computational intelligence in production and logistics systems, pp.39-46, 2011.

J. Li, Y. Li, and P. M. Pardalos, Multi-depot vehicle routing problem with time windows under shared depot resources, Journal of Combinatorial Optimization, vol.40, issue.2, pp.10878-10892
DOI : 10.1016/j.cor.2012.07.018

A. Lipowski, Roulette-wheel selection via stochastic acceptance, Physica A: Statistical Mechanics and its Applications, vol.391, issue.6
DOI : 10.1016/j.physa.2011.12.004

P. Lacomme, C. Prins, and M. Sevaux, Algorithmes de graphes, Paris : Eyrolles, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00009111

A. H. Land and A. G. Doig, An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol.28, issue.3, pp.497-520, 1960.
DOI : 10.2307/1910129

W. Meihua, T. Xuhong, C. Shan, and W. Shumi, Hybrid Ant Colony Optimization Algorithm for Two Echelon Vehicle Routing Problem, Procedia Engineering, vol.15, pp.3361-3365, 2011.
DOI : 10.1016/j.proeng.2011.08.630

D. L. Miller, A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems, ORSA Journal on Computing, vol.7, issue.1, pp.1-9, 1995.
DOI : 10.1287/ijoc.7.1.1

M. Mokhtarinejad, A. Ahmadi, B. Karimi, and S. H. Rahmati, A novel learning based approach for a new integrated location-routing and scheduling problem within cross-docking considering direct shipment, Applied Soft Computing, vol.34, 2015.
DOI : 10.1016/j.asoc.2015.04.062

A. Mingozzi and A. Valletta, An exact algorithm for period and multi-depot vehicle routing problems, Odysseus 2003 -Second International Workshop on Freight Transportation and Logistics, 2003.

T. Magnanti and R. Wong, Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria, Operations Research, vol.29, issue.3, pp.464-484, 1981.
DOI : 10.1287/opre.29.3.464

J. Mageean and J. Nelson, The evaluation of demand responsive transport services in Europe, Journal of Transport Geography, vol.11, issue.4, pp.255-270, 2003.
DOI : 10.1016/S0966-6923(03)00026-7

A. C. Matos and R. C. Oliveira, An experimental study of the ant colony system for the period vehicle routing problem. Ant colony optimization and swarm intelligence, Lecture Notes in Computer Science, vol.3172, pp.1-29, 2004.

O. 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.
DOI : 10.1016/0377-2217(83)90199-6

G. Mosheiov, The Travelling Salesman Problem with pick-up and delivery, European Journal of Operational Research, vol.79, issue.2, pp.299-310, 1994.
DOI : 10.1016/0377-2217(94)90360-3

Y. Marinakis-]-h, V. Min, R. Jayaraman, and . Srivastava, An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands Combined location-routing problems : A synthesis and future research directions, Applied Soft Computing European Journal of Operational Research, vol.37, issue.1081, pp.1-15, 1998.

C. E. Miller, A. W. Tucker, and R. A. Zemlin, Integer Programming Formulation of Traveling Salesman Problems, Journal of the ACM, vol.7, issue.4, p.3269, 1960.
DOI : 10.1145/321043.321046

N. H. Moin, S. Salhi, and N. A. Aziz, An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem, International Journal of Production Economics, vol.133, issue.1, pp.334-343, 2011.
DOI : 10.1016/j.ijpe.2010.06.012

G. Mosheiov, The pickup delivery location problem on networks, Networks, vol.36, issue.4, pp.243-251, 1995.
DOI : 10.1002/net.3230260408

G. Nagy and S. Salhi, The many-to-many location-routing problem, Top, vol.103, issue.2, pp.261-275, 1998.
DOI : 10.1007/978-3-662-03196-4

V. Nguyen, C. Prins, and C. Prodhon, A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem, Engineering Applications of Artificial Intelligence, vol.25, issue.1, pp.56-71, 2012.
DOI : 10.1016/j.engappai.2011.09.012

G. Nagy and S. Salhi, Location-routing: Issues, models and methods, European Journal of Operational Research, vol.177, issue.2, pp.649-672, 2007.
DOI : 10.1016/j.ejor.2006.04.004

URL : http://kar.kent.ac.uk/9938/1/124_Salhi%2C_Nagy.pdf

V. Nguyen, C. Prins, and C. Prodhon, Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking, European Journal of Operational Research, vol.216, issue.1, pp.113-126, 2012.
DOI : 10.1016/j.ejor.2011.07.030

G. Nagy and S. Salhi, Location-routing: Issues, models and methods, European Journal of Operational Research, vol.177, issue.2, pp.649-672, 2007.
DOI : 10.1016/j.ejor.2006.04.004

V. Nguyen, C. Prins, and C. Prodhon, A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem, Engineering Applications of Artificial Intelligence, vol.25, issue.1, pp.56-71, 2012.
DOI : 10.1016/j.engappai.2011.09.012

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1999.
DOI : 10.1002/9781118627372

I. H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, vol.15, issue.4, pp.421-451, 1993.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

L. Ozdamar and O. Demir, A hierarchical clustering and routing procedure for large scale disaster relief logistics planning, Transportation Research Part E: Logistics and Transportation Review, vol.48, issue.3, pp.591-602, 2012.
DOI : 10.1016/j.tre.2011.11.003

Z. Ozyurt and D. Aksen, Solving the multi-depot location routing problem with Lagrangian relaxation, Operations ResearchComputer Science Interfaces Series, vol.37, pp.125-144, 2007.

I. Or, Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking, 1976.

S. N. Parragh, K. F. Doerner, and R. F. Hartl, A survey on pickup and delivery problems, Journal f??r Betriebswirtschaft, vol.1667, issue.2, pp.81-117, 2008.
DOI : 10.1002/(SICI)1520-6440(199907)82:7<30::AID-ECJC4>3.0.CO;2-2

H. Paessens, The savings algorithm for the vehicle routing problem, European Journal of Operational Research, vol.34, issue.3, pp.336-344, 1988.
DOI : 10.1016/0377-2217(88)90154-3

S. N. Parragh, K. F. Doerner, and R. F. Hartl, A survey on pickup and delivery problems, Journal f??r Betriebswirtschaft, vol.41, issue.1, pp.21-51, 2008.
DOI : 10.1007/978-3-642-85256-5_26

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.
DOI : 10.1016/j.endm.2010.05.081

C. Prodhon and C. Prins, A survey of recent research on location-routing problems, European Journal of Operational Research, vol.238, issue.1, pp.1-17, 2014.
DOI : 10.1016/j.ejor.2014.01.005

H. N. Psaraftis, A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases, European Journal of Operational Research, vol.215, issue.3, 2011.
DOI : 10.1016/j.ejor.2011.06.038

C. Prins, Efficient heuristics for the heterogeneous fleet multitrip vrp with application to a large-scale real case, Journal of Mathematical Modelling and Algorithms, vol.1, issue.2, pp.135-150, 2002.
DOI : 10.1023/A:1016516326823

M. Padberg and G. Rinaldi, Optimization of a 532 city symmetric traveling salesman problemby branch-and-cut, Operations Research Letters, pp.1-7, 1987.

C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R. Wolfer-calvo, Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic, Transportation Science, vol.41, issue.4, pp.470-483, 2007.
DOI : 10.1287/trsc.1060.0187

C. Prins, C. Prodhon, and R. Wolfer-calvo, A memetic algorithm with population management (MA | PM) for the capacitated location-routing problem

C. Prins, C. Prodhon, and R. W. Calvo, Solving the capacitated locationrouting problem by a GRASP complemented by a learning process and a path relinking, pp.221-238, 2006.

C. Prodhon, A Metaheuristic for the Periodic Location-Routing Problem, 2008.
DOI : 10.1007/978-3-540-77903-2_25

G. Perboli, R. Tadei, and D. , The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics, Transportation Science, vol.45, issue.3, pp.364-80, 2011.
DOI : 10.1287/trsc.1110.0368

C. Prodhon, Le probleme de localisation-routage, 2006.

S. Ray, A. Soeanu, J. Berger, and M. Debbabi, (in press) The multi-depot splitdelivery vehicle routing problem : Model and solution algorithm. Knowledgebased Systems

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, 2004.
DOI : 10.1287/trsc.1050.0135

J. Reese, Solution methods for thep-median problem: An annotated bibliography, Networks, vol.21, issue.3, pp.125-142, 2006.
DOI : 10.1007/978-1-4615-4567-5_6

T. K. Ralphs, Parallel branch and cut for capacitated vehicle routing, Parallel Computing, vol.29, issue.5, pp.607-629, 2003.
DOI : 10.1016/S0167-8191(03)00045-0

Y. Rahmani, A. Oulamara, and W. R. Cherif, Multi-products Location-Routing Problem with Pickup and Delivery, 2013 International Conference on Advanced Logistics and Transport
DOI : 10.1109/ICAdLT.2013.6568445

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

J. Renaud, G. Laporte, and F. F. Boctor, A tabu search heuristic for the multi-depot vehicle routing problem, Computers & Operations Research, vol.23, issue.3, pp.229-235, 1996.
DOI : 10.1016/0305-0548(95)O0026-P

C. Rego and C. , Le Probléme de Tournées de Véhicules : Etude et Résolution Approchée, 1994.

W. , R. Cherif-khettaf, M. Haj-rachid, C. Bloch, and P. Chatonnay, New notation and classification scheme for vehicle routing problem

I. Rodriguez-martin, J. Salazar-gonzalez, and H. Yaman, A branch-and-cut algorithm for the hub location and routing problem, Computers & Operations Research, vol.50, pp.161-174, 2014.
DOI : 10.1016/j.cor.2014.04.014

J. Rieck, C. Ehrenberg, and J. Zimmermann, Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery, European Journal of Operational Research, vol.236, issue.3, pp.863-878, 2014.
DOI : 10.1016/j.ejor.2013.12.021

I. Rodriguez-martin, J. Salazar-gonzoalez, and H. Yaman, A branch-and-cut algorithm for the hub location and routing problem, Computers & Operations Research, vol.50, pp.161-174, 2014.
DOI : 10.1016/j.cor.2014.04.014

Y. Rahmani, A. Oulamara, and W. R. Cherif, MultiProducts Location- Routing problem with Pickup and Delivery : Two-Echelon model, 11th IFAC Workshop on Intelligent Manufacturing -IMS Sao Paulo, Brazil, pp.124-129, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01307531

Y. Rahmani, A. Oulamara, and W. R. Cherif, Multi-products Location-Routing Problem with Pickup and Delivery, 2013 International Conference on Advanced Logistics and Transport, pp.115-116, 2012.
DOI : 10.1109/ICAdLT.2013.6568445

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

I. Rodriguez-martin and J. Salazar-gonzalez, The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic, 5th International Conference INOC 2011, pp.401-405, 2011.
DOI : 10.1007/s11301-008-0036-4

I. Rodriguez-martin, J. Salazar-gonzlez, and H. Yaman, A branch-and-cut algorithm for the hub location and routing problem, Computers & Operations Research, vol.50, pp.161-174, 2014.
DOI : 10.1016/j.cor.2014.04.014

H. Ro and D. Tcha, A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints, European Journal of Operational Research, vol.18, issue.3, pp.349-358, 1984.
DOI : 10.1016/0377-2217(84)90156-5

D. M. Ryan, C. Hjorring, and F. Glover, Extensions of the Petal Method for Vehicle Routeing, Journal of the Operational Research Society, vol.44, issue.3, pp.289-296, 1993.
DOI : 10.1057/jors.1993.54

D. Sariklis and S. Powell, A heuristic method for the open vehicle routing problem, Journal of the Operational Research Society, vol.51, issue.5, pp.564-573, 2000.
DOI : 10.1057/palgrave.jors.2600924

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.
DOI : 10.1287/opre.35.2.254

S. Salhi, A. Imran, and N. A. , The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation, Computers & Operations Research, vol.52, pp.315-325, 2014.
DOI : 10.1016/j.cor.2013.05.011

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming), p.417431, 1998.
DOI : 10.1007/3-540-49481-2_30

S. Salhi, S. R. Thangiah, and F. Rahman, A genetic clustering method of the multidepot vehicle routing problem, Artificial neural network and genetic algorithms, pp.234-237, 1998.

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, p.139171, 2000.
DOI : 10.1006/jcph.1999.6413

R. Sridharan, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, European Journal of Operational Research, vol.66, issue.3, p.305312, 1993.
DOI : 10.1016/0377-2217(93)90219-D

M. Sniedovich, Dynamic Programming : Foundations and Principles, 2010.
DOI : 10.1201/EBK0824740993

D. Skorin-kapov, J. Skorin-kapov, and M. O?kelly, Tight linear programming relaxations of uncapacitated p-hub median problems, European Journal of Operational Research, vol.94, issue.3, pp.582-593, 1996.
DOI : 10.1016/0377-2217(95)00100-X

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.
DOI : 10.1016/j.ijpe.2014.11.016

M. W. Savelsbergh, A Branch-and-Price Algorithm for the Generalized Assignment Problem, Operations Research, vol.45, issue.6, 1997.
DOI : 10.1287/opre.45.6.831

F. Semet and E. Taillard, Solving real-life vehicle routing problems efficiently using tabu search, Annals of Operations Research, vol.23, issue.4, pp.469-488, 1993.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

M. Schwengerer, S. Pirkwieser, and G. R. , A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
DOI : 10.1007/978-3-642-29124-1_2

. Middendorf, Evolutionary Computation in Combinatorial Optimisation -EvoCOP 2012, Lecture Notes in computer Science, vol.7245, pp.13-24, 2012.

S. Sajjadi and S. Cheraghi, Multi-products location routing problem integrated Bibliographie with inventory under stochastic demand, International Journal of Industrial and Systems Engineering, 2011.

T. Stutzle, Iterated local search for the quadratic assignment problem, European Journal of Operational Research, vol.174, issue.3, p.15191539, 2006.
DOI : 10.1016/j.ejor.2005.01.066

F. J. Sevilla and C. S. Blas, Vehicle routing problem with time windows and intermediate facilities, 27 Congreso Nacional de Estadistica e Investigacion Operativa, 2003.

P. Schittekat and K. Sorensen, OR Practice???Supporting 3PL Decisions in the Automotive Industry by Generating Diverse Solutions to a Large-Scale Location-Routing Problem, Operations Research, vol.57, issue.5, 2009.
DOI : 10.1287/opre.1080.0633

S. Scheuerer, A tabu search heuristic for the truck and trailer routing problem, Computers & Operations Research, vol.33, issue.4, pp.894-909, 2006.
DOI : 10.1016/j.cor.2004.08.002

K. C. Tan, Y. H. Chew, and L. H. Lee, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, European Journal of Operational Research, vol.172, issue.3, pp.855-885, 2006.
DOI : 10.1016/j.ejor.2004.11.019

D. Tas, N. Dellaert, T. Van-woensel, and T. De-kok, Vehicle routing problem with stochastic travel times including soft time windows and service costs, Computers & Operations Research, vol.40, issue.1, pp.214-224, 2013.
DOI : 10.1016/j.cor.2012.06.008

E. D. Taillard, Parallel iterative search methods for vehicle routing problems, Networks, vol.12, issue.8, pp.661-673, 1993.
DOI : 10.1002/net.3230230804

P. Toth and D. Vigo, The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications, pp.129-154, 2002.
DOI : 10.1137/1.9780898718515

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

R. Tavakkoli-moghaddam, A. Makui, and Z. Mazloomi, A new integrated mathematical model for a bi-objective multi-depot location-routing problem solved by a multi-objective scatter search algorithm, Journal of Manufacturing Systems, vol.29, issue.2-3, pp.29-111, 2010.
DOI : 10.1016/j.jmsy.2010.11.005

E. Taniguchi and R. G. Thompson, Modelling City Logistics, Transportation Research Record, vol.1790, pp.45-51, 2002.
DOI : 10.1108/9780585473840-002

C. J. Ting and C. H. Chen, A multiple ant colony optimization algorithm for the capacitated location routing problem, International Journal of Production Economics, vol.141, issue.1, pp.34-44, 2013.
DOI : 10.1016/j.ijpe.2012.06.011

A. S. Tasan and M. Gen, A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries, The vehicle routing problem, 2001.

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, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Discrete Applied Mathematics, vol.123, issue.1-3, pp.487-512, 2002.
DOI : 10.1016/S0166-218X(01)00351-1

S. Tragantalerngsak, J. Holt, and M. Ronnqvist, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, European Journal of Operational Research, vol.102, issue.3, pp.611-625, 2007.
DOI : 10.1016/S0377-2217(96)00227-5

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, 2013.
DOI : 10.1016/j.ejor.2013.09.045

J. G. Villegas, C. Prins, C. Prodhon, A. L. Medaglia, N. Velasco et al., GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots, Engineering Applications of Artificial Intelligence, vol.23, issue.5, pp.780-794, 2011.
DOI : 10.1016/j.engappai.2010.01.013

C. Voudouris and E. Tsang, Guided local search and its application to the traveling salesman problem, European Journal of Operational Research, vol.113, issue.2, pp.469-499, 1999.
DOI : 10.1016/S0377-2217(98)00099-X

P. Vansteenwegen, W. Souriau, G. Vanden-berghe, and D. Van-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

J. W. Escobar, R. Linfati, and P. Toth, A two-phase hybrid heuristic algorithm for the capacitated location-routing problem, Computers & Operations Research, vol.40, issue.1, pp.70-79, 2013.
DOI : 10.1016/j.cor.2012.05.008

. Jr, A. William, P. G. Dees, and . Karger, Automated rip-up and reroute techniques, Proceedings of the 19th conference on Design automation, pp.432-439, 1982.

C. Wu, D. Du, and D. Xu, Primal???dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach, Theoretical Computer Science, vol.562, 2015.
DOI : 10.1016/j.tcs.2014.09.045

C. Wang, D. Mu, F. Zhao, and J. W. Sutherland, A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup???delivery and time windows, Computers & Industrial Engineering, vol.83, pp.111-122, 2015.
DOI : 10.1016/j.cie.2015.02.005

T. H. Wu, C. Low, and J. W. Bai, Heuristic solutions to multi-depot location-routing problems, Computers & Operations Research, vol.29, issue.10, pp.1393-1415, 2002.
DOI : 10.1016/S0305-0548(01)00038-7

M. H. Webb, Cost Functions in the Location of Depots for Multiple-Delivery Journeys, Journal of the Operational Research Society, vol.19, issue.3, pp.311-320, 1968.
DOI : 10.1057/jors.1968.74

T. H. Wu, C. Low, and J. W. Bai, Heuristic solutions to multi-depot location-routing problems, Computers & Operations Research, vol.29, issue.10, pp.1393-1415, 2002.
DOI : 10.1016/S0305-0548(01)00038-7

M. Wasner and G. , An integrated multi-depot hub-location vehicle routing model for network planning of parcel service, International Journal of Production Economics, vol.90, issue.3, pp.403-419, 2004.
DOI : 10.1016/j.ijpe.2003.12.002

J. W. Escobar, R. Linfati, G. M. Baldoquin, and P. Toth, A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem, Transportation Research Part B: Methodological, vol.67, pp.344-356, 2014.
DOI : 10.1016/j.trb.2014.05.014

V. F. Yu, L. , and S. , Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery, Applied Soft Computing, vol.24, pp.284-290, 2014.
DOI : 10.1016/j.asoc.2014.06.024

W. Yi and L. Ozdamar, A dynamic logistics coordination model for evacuation and support in disaster response activities, European Journal of Operational Research, vol.179, issue.3, pp.1177-1193, 2007.
DOI : 10.1016/j.ejor.2005.03.077

V. F. Yu and S. Lin, A simulated annealing heuristic for the open locationrouting problem, Computers and Operations Research, vol.62, 2015.

J. Yang and H. Sun, Battery swap station location-routing problem with capacitated electric vehicles, Computers & Operations Research, vol.55, 2015.
DOI : 10.1016/j.cor.2014.07.003

P. Yellow, J. Yellen, and J. Gross, A computational modification to the savings method of vehicle scheduling Graph theory and its applications, Operational Research Quarterly Physics, vol.21159, issue.2, pp.281-283139171, 1970.

K. Q. Zhu, Heuristic Methods For Vehicle Routing Problem with Time Windows, 1999.

M. H. Zarandi, A. Hemmati, and S. Davari, The multi-depot capacitated locationrouting problem with fuzzy travel times, Expert Systems with Applications, vol.38, issue.8, 2011.

Y. Zhang, M. Qi, W. H. Lin, and L. Miao, A metaheuristic approach to the reliable location routing problem under disruptions, Transportation Research Part E: Logistics and Transportation Review, vol.83, pp.90-110, 2015.
DOI : 10.1016/j.tre.2015.09.001

B. Zhang, Z. Ma, and S. Jiang, Location-Routing-Inventory Problem with Stochastic Demand in Logistics Distribution Systems, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, pp.1-4, 2008.
DOI : 10.1109/WiCom.2008.1547

T. Zhang, W. A. Chaovalitwongse, and Y. Zhang, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Computers & Operations Research, vol.39, issue.10
DOI : 10.1016/j.cor.2011.11.021

E. E. Zachariadis and C. T. Kiranoudis, A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries, Expert Systems with Applications, 2011.

Y. Zhang and X. D. Chen, An Optimization Model for the Vehicle Routing Problem in Multi-product Frozen Food Delivery, Journal of Applied Research and Technology, vol.12, issue.2, 2014.
DOI : 10.1016/S1665-6423(14)72340-5

Y. Z. Mehrjerdi and A. Nadizadeh, Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands, European Journal of Operational Research, vol.229, issue.1, p.7584, 2013.
DOI : 10.1016/j.ejor.2013.02.013