. Akca, A branch-and-price algorithm for combined location and routing problems under capacity restrictions, Operations research and cyber-infrastructure, pp.309-330, 2009.

, Deniz Aksen et Kemal Altinkemer. A location-routing problem for the conversion to the "click-and-mortar" retailing : The static case, European Journal of Operational Research, vol.186, issue.2, p.14, 2008.

A. Chami, New model for a variant of pick up and delivery problem, 2016 IEEE International Conference on, pp.1708-001713, 2016.

A. Chami, A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands, Annals of Operations Research, pp.1-19, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02300030

A. Chami, A hybrid genetic algorithm to solve a multi-objective Pickup and Delivery Problem, IFAC-PapersOnLine, vol.50, issue.1, pp.14656-14661, 2017.

A. Chami, Hervé Manier et Marie-Ange Manier. A new metaheuristic to solve a selective pickup and delivery problem, Logistics Operations Management (GOL), vol.20, pp.1-5, 2018.

. Albareda-sambola, Heuristic and lower bound for a stochastic location-routing problem, European Journal of Operational Research, vol.179, issue.3, p.14, 2007.

. Albareda-sambola, Maria Albareda-Sambola, Elena Fernández et Stefan Nickel. Multiperiod location-routing with decoupled time scales, European Journal of Operational Research, vol.217, issue.2, p.14, 2012.

A. Cf-alvim, D. Eric, and . Taillard, POPMUSIC for the world location-routing problem, EURO Journal on Transportation and Logistics, vol.2, issue.3, p.14, 2013.

[. Baldacci, An exact method for the capacitated location-routing problem, Operations research, vol.59, issue.5, p.18, 2011.

[. Bard, A branchand-cut procedure for the vehicle routing problem with time windows, Transportation Science, vol.36, issue.2, p.15, 2002.

[. Barreto, Using clustering analysis in a capacitated location-routing problem, European Journal of Operational Research, vol.179, issue.3, p.14, 2007.

[. Belenguer, Christian Prins, Caroline Prodhon et Roberto Wolfler Calvo. A branch-and-cut method for the capacitated location-routing problem, Computers & Operations Research, vol.38, issue.6, pp.931-941, 2011.

[. Belloso, Using multi-start biased randomization of heuristics to solve the vehicle routing problem with clustered backhauls, Proc. ICAOR, vol.10, p.16, 2015.

[. Belmecheri, Farouk Yalaoui et Lionel Amodeo. An ant colony optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows, IFAC Proceedings Volumes, vol.42, pp.1550-1555, 2009.

[. Berger, Location-routing problems with distance constraints, Transportation Science, vol.41, issue.1, p.14, 2007.

[. Biesinger, A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands, Transportation Science, vol.52, issue.3, p.16, 2018.

[. Borndörfer, Telebus Berlin : Vehicle scheduling in a dial-a-ride system, Computer-Aided Transit Scheduling, p.11, 1999.

A. Bortfeldt and T. Hahn, Dirk Männel et Lars Mönch. Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, European Journal of Operational Research, vol.243, issue.1, pp.82-96, 2015.

[. Brønmo, Kjetil Fagerholt et Bjørn Nygreen. A multi-start local search heuristic for ship scheduling-a computational study, Computers & Operations Research, vol.34, issue.3, p.11, 2007.

[. Caballero, Martín Matamala et Claudio Contardo. The pickup and delivery problem with transfers : Formulation and a branch-andcut solution method, European Journal of Operational Research, vol.200, issue.3, pp.711-724, 2007.

[. Crainic, A Reactive GRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem, vol.12, 2019.

[. Cuda, Rosario Cuda, Gianfranco Guastaroba et Maria Grazia Speranza. A survey on two-echelon routing problems, Computers & Operations Research, vol.55, pp.185-199, 2015.

B. George, . Dantzig, H. John, and . Ramser, The truck dispatching problem, Management science, vol.6, issue.1, pp.80-91, 1959.

B. George, P. Dantzig, and . Wolfe, Decomposition principle for linear programs, Operations research, vol.8, issue.1, pp.101-111, 1960.

G. Dantzig, R. Fulkerson, and S. Johnson, Solution of a large-scale traveling-salesman problem, Journal of the operations research society of America, vol.2, issue.4, pp.393-410, 1954.

M. Darvish, C. Archetti, C. Leandro, G. Coelho, and . Speranza, Flexible two-echelon location routing problem, European Journal of Operational Research, p.14, 2019.

. Deif and . Bodin, Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling, Proceedings of the Babson conference on software uses in transportation and logistics management, vol.10, pp.75-96, 1984.

. Dell'amico, A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection, Transportation science, vol.40, issue.2, p.16, 2006.

H. Derbel and B. Jarboui, Saïd Hanafi et Habib Chabchoub. Genetic algorithm with iterated local search for solving a locationrouting problem, Expert Systems with Applications, vol.39, issue.3, p.14, 2012.

, Relation between vehicle routing problems : an insertion heuristic for the vehicle routing problem with simultaneous delivery and pickup applied to the vehicle routing problem with backhauls, Journal of the Operational Research Society, vol.53, issue.1, pp.115-118, 2002.

M. Dorigo and T. Stützle, Ant colony optimization : overview and recent advances, Handbook of metaheuristics, vol.17, pp.311-351, 2019.

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.

M. Drexl, Synchronization in vehicle routing-a survey of VRPs with multiple synchronization constraints, Transportation Science, vol.46, issue.3, pp.297-316, 2012.

M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Operations Research, vol.42, issue.5, pp.977-978, 1994.

. Duhamel, Christophe Duhamel, Philippe Lacomme, Christian Prins et Caroline Prodhon. A GRASP× ELS approach for the capacitated locationrouting problem, Computers & Operations Research, vol.37, issue.11, pp.1912-1923, 2010.

. Dumas, Yvan Dumas, Jacques Desrosiers et Francois Soumis. The pickup and delivery problem with time windows, European journal of operational research, vol.54, issue.1, p.12, 1991.

[. Elbeltagi, Comparison among five evolutionary-based optimization algorithms, Advanced engineering informatics, vol.19, issue.1, p.26, 2005.

[. Fischetti, A branch-andbound algorithm for the capacitated vehicle routing problem on directed graphs, Operations Research, vol.42, issue.5, p.15, 1994.

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

[. Fleszar, A variable neighbourhood search algorithm for the open vehicle routing problem, European Journal of Operational Research, vol.195, issue.3, p.17, 2009.

[. Franca, Glaydston Mattos Ribeiro et Gisele de Lorena Diniz Chaves. The planning of selective collection in a real-life vehicle routing problem : A case in Rio de Janeiro, Sustainable Cities and Society, vol.47, p.101488, 2019.

[. Gendreau, A tabu search heuristic for the vehicle routing problem, Management science, vol.40, issue.10, p.17, 1994.

. Ghaffari-nasab, Nader Ghaffari-Nasab, Mohamad Saeed Jabalameli, Mir Bahador Aryanezhad et Ahmad Makui. Modeling and solving the biobjective capacitated location-routing problem with probabilistic travel times, The International Journal of Advanced Manufacturing Technology, vol.67, issue.9, p.14, 2007.

P. Ga and . De, Comparison of three evolutionary algorithms, Industrial Engineering and Management Systems, vol.11, issue.3, p.26, 2012.

[. Karagul, Erdal Aydemir et Aykut Oral. A Simulated Annealing Algorithm Based Solution Method for a Green Vehicle Routing Problem with Fuel Consumption, Lean and Green Supply Chain Management, pp.161-187, 2019.

.. J. Kennedy and . Eberhart, Particle swarm optimization, Proceedings of IEEE International Conference on Neural Networks IV, vol.1000, 1995.

[. Kim, Waste collection vehicle routing problem with time windows, Computers & Operations Research, vol.33, issue.12, pp.3624-3642, 2006.

Ç. Koç and G. Laporte, Vehicle routing with backhauls : Review and research perspectives, Computers & Operations Research, vol.91, pp.79-91, 2018.

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, p.18, 1981.

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

[. Lavoie, A new approach for crew pairing problems by column generation with an application to air transportation, European Journal of Operational Research, vol.35, issue.1, p.15, 1988.

[. Letchford, A branch-and-cut algorithm for the capacitated open vehicle routing problem, Journal of the Operational Research Society, vol.58, issue.12, p.15, 2007.

[. Li, &. Lim, ;. Li, and A. Lim, A metaheuristic for the pickup and delivery problem with time windows, International Journal on Artificial Intelligence Tools, vol.12, issue.02, pp.173-186, 2003.

[. Liao, A discrete version of particle swarm optimization for flowshop scheduling problems, Computers & Operations Research, vol.34, issue.10, p.26, 2007.

. Cky-lin and . 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, pp.1833-1849, 2006.

, Transportation Science, vol.47, issue.3, pp.344-355, 2013.

G. Mitrovi?-mini?-&-laporte-;-sne?ana-mitrovi?-mini? and . Laporte, The pickup and delivery problem with time windows and transshipment. INFOR : Information Systems and Operational Research, vol.44, pp.217-227, 2006.

G. Nagy and S. Salhi, Location-routing : Issues, models and methods, European journal of operational research, vol.177, issue.2, p.18, 2007.

. Nagy, The vehicle routing problem with divisible deliveries and pickups, Transportation Science, vol.49, issue.2, pp.271-294, 2013.

. Nguyen, Viet-Phuong Nguyen, Christian Prins et Caroline 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, p.14, 2012.

. Nguyen, Viet-Phuong Nguyen, Christian Prins et Caroline 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, p.14, 2012.

[. Okabe, A critical survey of performance indices for multi-objective optimisation, The 2003 Congress on Evolutionary Computation, 2003. CEC'03, vol.2, pp.878-885, 2003.

I. Or, P. William, and . Pierskalla, A transportation locationallocation model for regional blood banking, AIIE transactions, vol.11, issue.2, p.13, 1979.

[. Parragh, A survey on pickup and delivery problems. Part II : Transportation between pickup and delivery locations, Journal für Betriebswirtschaft, 2007.

K. F. Sophie-n-parragh, . Doerner, F. Richard, and . Hartl, A survey on pickup and delivery problems, Journal für Betriebswirtschaft, vol.58, issue.1, p.11, 2008.

[. Pinto, An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls, FME Transactions, vol.43, issue.4, pp.311-318, 2015.

. Prins, Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité, MOSIM, vol.4, pp.1115-1122, 2004.

;. Bibliographie and . Prins, Christian Prins, Caroline Prodhon et Roberto Wolfler Calvo. A memetic algorithm with population management (MA| PM) for the capacitated location-routing problem, European Conference on Evolutionary Computation in Combinatorial Optimization, p.18, 2006.

. Prins, Christian Prins, Caroline Prodhon et Roberto Wolfler Calvo. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking, vol.4, pp.221-238, 2006.

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

, Caroline Prodhon et Christian Prins. A survey of recent research on location-routing problems, European Journal of Operational Research, vol.238, issue.1, p.18, 2014.

, A hybrid evolutionary algorithm for the periodic location-routing problem, European Journal of Operational Research, vol.210, issue.2, p.14, 2011.

Y. Qu, F. Jonathan, and . Bard, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, Computers & Operations Research, vol.39, issue.10, pp.2439-2456, 2012.

[. Rahmani, Ruslan Sadykov et François Vanderbeck. A Column Generation Based Heuristic for the Dial-A-Ride Problem, International Conference on Information Systems, Logistics and Supply Chain (ILS), p.12, 2016.

, New mixed integer-programming model for the pickup-and-delivery problem with transshipment, European Journal of Operational Research, vol.235, issue.3, pp.530-539, 2014.

S. Rath, J. Walter, and . Gutjahr, A math-heuristic for the warehouse location-routing problem in disaster relief, Computers & Operations Research, vol.42, p.14, 2014.

[. Reffet, Étude d'impact des zones logistiques urbaines, 2007.

, Brahim Rekiek, Alain Delchambre et Hussain Aziz Saleh. Handicapped person transportation : An application of the grouping genetic algorithm, Engineering Applications of Artificial Intelligence, vol.19, issue.5, p.11, 2006.

. Reyes-sierra, Multiobjective particle swarm optimizers : A survey of the state-of-the-art, International journal of computational intelligence research, vol.2, issue.3, p.51, 2006.

G. Mattos-ribeiro and G. Laporte, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Computers & operations research, vol.39, issue.3, p.17, 2012.

, Stefan Ropke et Jean-François Cordeau. Branch and cut and price for the pickup and delivery problem with time windows, Transportation Science, vol.43, p.12, 2009.

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, p.12, 2006.

[. Sacco, The fuzzy clearing approach for a niching genetic algorithm applied to a nuclear reactor core design optimization problem, Annals of Nuclear Energy, vol.31, issue.1, p.91, 2004.

S. Salhi and G. Nagy, A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling, Journal of the operational Research Society, vol.50, issue.10, pp.1034-1042, 1999.

W. P. Martin, M. Savelsbergh, and . Sol, The general pickup and delivery problem, Transportation science, vol.29, issue.1, pp.17-29, 1995.

, Frédéric Semet et Eric Taillard. Solving real-life vehicle routing problems efficiently using tabu search, Annals of Operations research, vol.41, issue.4, pp.469-488, 1993.

[. Shi, Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem, Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on, vol.1, p.12, 2009.

X. Song and D. Jones, Nasrin Asgari et Tim Pigden. Multiobjective vehicle routing and loading with time window constraints : a real-life application, Annals of Operations Research, pp.1-27, 2019.

, Jacqueline M Bloemhof-Ruwaard et Tolga Bekta?. The time-dependent two-echelon capacitated vehicle routing problem with environmental considerations, International Journal of Production Economics, vol.164, p.12, 2015.

[. Tan, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, European Journal of Operational Research, vol.172, issue.3, p.14, 2006.

[. Ticha, Dominique Feillet et Alain Quilliot. Empirical analysis for the VRPTW with a multigraph representation for the road network, Computers & Operations Research, vol.88, pp.103-116, 2017.

C. Ting and C. Chen, A multiple ant colony optimization algorithm for the capacitated location routing problem, International Journal of Production Economics, vol.141, issue.1, p.19, 2013.

P. Toth and D. Vigo, Vehicle routing : problems, methods, and applications. SIAM, p.11, 2014.

. Villegas, Andrés L Medaglia et Nubia Velasco. A GRASP with evolutionary path relinking for the truck and trailer routing problem, Computers & Operations Research, vol.38, issue.9, p.14, 2011.

[. Vincent, A simulated annealing heuristic for the capacitated location routing problem, Computers & Industrial Engineering, vol.58, issue.2, p.19, 2010.

;. Watson-gandy-&-dohrn, . Cdt-watson-gandy, and . Dohrn, Depot location with van salesmen-a practical approach, Omega, vol.1, issue.3, pp.321-329, 1973.

E. O-wilson, Sociobiology : the new synthesis, p.26, 1975.

[. Xu, An unpaired pickup and delivery vehicle routing problem with multi-visit, Transportation Research Part E : Logistics and Transportation Review, vol.103, p.12, 2017.

[. Zhao, Shuang Chen et Cun-Xun Zang. Model and algorithm for inventory/routing decision in a three-echelon logistics system, European Journal of Operational Research, vol.191, issue.3, p.13, 2008.