S. Abdinnour-helm, A hybrid heuristic for the uncapacitated hub location problem, European Journal of Operational Research, vol.106, issue.2-3, p.58, 1998.

R. Abyazi-sani and R. Ghanbari, An efficient tabu search for solving the uncapacitated single allocation hub location problem, Computers & Industrial Engineering, vol.93, p.27, 2016.

J. Ahn, O. De-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, p.33, 2012.

Z. Akca, R. Berger, and T. Ralphs, A branch-and-price algorithm for combined location and routing problems under capacity restrictions, Operations research and cyber-infrastructure, vol.34, p.39, 2009.

M. Albareda-sambola, Location-routing and location-arc routing, Location science, p.32, 2015.

M. Albareda-sambola, J. A. Díaz, and E. Fernández, A compact model and tight bounds for a combined location-routing problem, Computers & Operations Research, vol.32, issue.3, p.34, 2005.

F. Altiparmak, M. Gen, L. Lin, and T. Paksoy, A genetic algorithm approach for multi-objective optimization of supply chain networks, Computers & industrial engineering, vol.51, issue.1, p.118, 2006.

S. Alumur and B. Y. Kara, Network hub location problems : The state of the art, European journal of operational research, vol.190, issue.1, p.133, 2008.

Y. An, Y. Zhang, and B. Zeng, The reliable hub-and-spoke design problem : Models and algorithms, Transportation Research Part B : Methodological, vol.77, p.30, 2015.

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, p.59, 2015.

N. Asgari, M. Rajabi, M. Jamshidi, M. Khatami, and R. Z. Farahani, A memetic algorithm for a multiobjective obnoxious waste location-routing problem : a case study, Annals of Operations Research, vol.250, issue.2, p.40, 2017.

T. Aykin and G. F. Brown, Interacting new facilities and location-allocation problems, Transportation Science, vol.26, issue.3, pp.212-222, 1992.

N. Azizi, S. Chauhan, S. Salhi, and N. Vidyarthi, The impact of hub failure in hub-and-spoke networks : Mathematical formulations and solution techniques, Computers & Operations Research, vol.65, p.30, 2016.

A. Bailey, B. Ornbuki-berrnan, and S. Asobiela, Discrete pso for the uncapacitated single allocation hub location problem, Computational intelligence in production and logistics systems (CIPLS), 2013 IEEE workshop on, vol.27, p.30, 2013.

B. M. Baker and M. Ayechew, A genetic algorithm for the vehicle routing problem. Computers & Operations Research, vol.30, pp.787-800, 2003.

A. Balakrishnan, J. E. Ward, and R. T. Wong, Integrated facility location and vehicle routing models : Recent work and future prospects, American Journal of Mathematical and Management Sciences, vol.7, issue.1-2, p.29, 1987.

R. Baldacci, A. Mingozzi, and R. Wolfler-calvo, An exact method for the capacitated location-routing problem, Operations Research, vol.59, issue.5, p.39, 2011.

M. Barkaoui and M. Gendreau, An adaptive evolutionary approach for real-time vehicle routing and dispatching, Computers & Operations Research, vol.40, issue.7, p.58, 2013.

S. Barreto, C. Ferreira, J. Paixao, and B. S. Santos, Using clustering analysis in a capacitated locationrouting problem, European Journal of Operational Research, vol.179, issue.3, p.39, 2007.

M. Barth, T. Younglove, and G. Scora, Development of a heavy-duty diesel modal emissions and fuel consumption model. California Partners for Advanced Transit and Highways (PATH), vol.43, p.92, 2005.

M. Bashiri, M. Mirzaei, and M. Randall, Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution, Applied Mathematical Modelling, vol.37, issue.5, p.58, 2013.

P. Bateson, The selfish gene : By richard dawkins, p.56, 1976.

T. Bekta? and G. Laporte, The pollution-routing problem, Transportation Research Part B : Methodological, vol.45, issue.8, p.43, 2011.

J. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. W. Calvo, A branch-and-cut method for the capacitated location-routing problem, Computers & Operations Research, vol.38, issue.6, p.39, 2011.
URL : https://hal.archives-ouvertes.fr/hal-02475782

J. Berger and M. Barkaoui, A hybrid genetic algorithm for the capacitated vehicle routing problem, Genetic and Evolutionary Computation Conference, vol.58, pp.646-656, 2003.

O. Berman, P. Jaillet, and D. Simchi-levi, Location-routing problems with uncertainty. Facility location : a survey of applications and methods, vol.106, p.32, 1995.

C. Blum and A. Roli, Metaheuristics in combinatorial optimization : Overview and conceptual comparison, ACM Computing Surveys (CSUR), vol.35, issue.3, p.55, 2003.

C. Blum, J. Puchinger, G. R. Raidl, and A. Roli, Hybrid metaheuristics in combinatorial optimization : A survey, Applied Soft Computing, vol.11, issue.6, p.56, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01224683

N. Bostel, P. Dejax, and M. Zhang, A model and a metaheuristic method for the hub location routing problem and application to postal services, Industrial Engineering and Systems Management (IESM), 2015 International Conference on, vol.42, p.96, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01320357

L. Bouhafs and A. Koukam, A combination of simulated annealing and ant colony system for the capacitated location-routing problem, International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, vol.37, p.39, 2006.

J. Brimberg, N. Mladenovi?, R. Todosijevi?, and D. Uro?evi?, General variable neighborhood search for the uncapacitated single allocation p-hub center problem, Optimization Letters, vol.11, issue.2, p.30, 2017.

D. L. Bryan and M. E. O'kelly, Hub-and-spoke networks in air transportation : an analytical review, Journal of regional science, vol.39, issue.2, p.19, 1999.

L. Caccetta, M. Alameen, and M. Abdul-niby, An improved clarke and wright algorithm to solve the capacitated vehicle routing problem. Engineering, Technology & Applied Science Research, vol.3, issue.2, p.98, 2013.

A. M. Campbell, T. J. Lowe, and L. Zhang, The p-hub center allocation problem, European Journal of Operational Research, vol.176, issue.2, p.24, 2007.

J. F. Campbell, Hub location and the p-hub median problem, Operations Research, vol.44, issue.6, p.22, 1991.

J. F. Campbell, Integer programming formulations of discrete hub location problems, European Journal of Operational Research, vol.72, issue.2, p.129, 1994.

J. F. Campbell and M. E. O'kelly, Twenty-five years of hub location research, Transportation Science, vol.46, issue.2, p.129, 2012.

D. Catanzaro, E. Gourdin, M. Labbé, and F. A. Özsoy, A branch-and-cut algorithm for the partitioning-hub location-routing problem, Computers & operations research, vol.38, issue.2, p.44, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01255533

D. Cattaruzza, N. Absi, D. Feillet, and T. Vidal, A memetic algorithm for the multi trip vehicle routing problem, European Journal of Operational Research, vol.236, issue.3, p.58, 2014.
URL : https://hal.archives-ouvertes.fr/emse-00847561

S. Çetiner, C. Sepil, and H. Süral, Hubbing and routing in postal delivery systems, Annals of Operations research, vol.181, issue.1, p.44, 2010.

E. Chardine-baumann and V. Botta-genoulaz, A framework for sustainable performance assessment of supply chain management practices, Computers & Industrial Engineering, vol.76, p.43, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01356044

C. Chen and C. Ting, A hybrid lagrangian heurisitic/simulated annealing algorithm for the multidepot location routing problem, Proceedings of the Eastern Asia Society for Transportation Studies The 7th International Conference of Eastern Asia Society for Transportation Studies, vol.37, p.39, 2007.

C. Contardo, J. Cordeau, and B. Gendron, A computational comparison of flow formulations for the capacitated location-routing problem, Discrete Optimization, vol.10, issue.4, p.39, 2013.

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

C. Contardo, J. Cordeau, and B. Gendron, A grasp+ ilp-based metaheuristic for the capacitated locationrouting problem, Journal of Heuristics, vol.20, issue.1, p.39, 2014.

I. Correia, S. Nickel, and F. Saldanha-da-gama, Hub and spoke network design with single-assignment, capacity decisions and balancing requirements, Applied Mathematical Modelling, vol.35, issue.10, p.49, 2011.

I. Correia, S. Nickel, and F. Saldanha-da-gama, Multi-product capacitated single-allocation hub location problems : formulations and inequalities, Networks and Spatial Economics, vol.14, issue.1, p.27, 2014.

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, p.34, 2010.

R. Cuda, G. Guastaroba, and M. G. Speranza, A survey on two-echelon routing problems, Computers & Operations Research, vol.55, p.32, 2015.

C. B. Cunha and M. R. Silva, A genetic algorithm for the problem of configuring a hub-and-spoke network for a ltl trucking company in brazil, European Journal of Operational Research, vol.179, issue.3, p.58, 2007.

M. Da-graça-costa, M. E. Captivo, and J. Clímaco, Capacitated single allocation hub location problem-a bi-criteria approach, Computers & Operations Research, vol.35, issue.11, p.25, 2008.

H. Damgacioglu, D. Dinler, N. E. Ozdemirel, and C. Iyigun, A genetic algorithm for the uncapacitated single allocation planar hub location problem, Computers & Operations Research, vol.62, p.30, 2015.

R. S. De-camargo, G. Miranda, and A. Løkketangen, A new formulation and an exact approach for the many-to-many hub location-routing problem, Applied Mathematical Modelling, vol.37, issue.12, p.44, 2013.

K. Deb, Multi-objective optimization using evolutionary algorithms, vol.16, p.56, 2001.

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm : NSGA-II, IEEE Transactions on Evolutionary Computation, vol.6, issue.2, p.99, 2002.

, Guidelines for company reporting on greenhouse gas emissions, Food & Rural Affairs (DEFRA), p.45, 2005.

E. Demir, T. Bekta?, and G. Laporte, An adaptive large neighborhood search heuristic for the pollutionrouting problem, European Journal of Operational Research, vol.223, issue.2, p.92, 2012.

E. Demir, T. Bekta?, and G. Laporte, The bi-objective pollution-routing problem, European Journal of Operational Research, vol.232, issue.3, p.92, 2014.

J. Deng, L. Wang, S. Wang, and X. Zheng, A competitive memetic algorithm for the distributed twostage assembly flow-shop scheduling problem, International Journal of Production Research, vol.54, issue.12, p.59, 2016.

H. Derbel, B. Jarboui, H. Chabchoub, S. Hanafi, and N. Mladenovi?, A variable neighborhood search for the capacitated location-routing problem, Logistics (LOGISTIQUA), 2011 4th International Conference on, vol.38, p.39, 2011.

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, p.97, 2012.

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, p.33, 2015.

C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon, A memetic approach for the capacitated location routing problem, Proceedings of the 9th EU/Meeting on Metaheuristics for Logistics and Vehicle Routing, vol.38, p.39, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02081981

C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon, A grasp× els approach for the capacitated locationrouting problem, Computers & Operations Research, vol.37, issue.11, p.39, 2010.
URL : https://hal.archives-ouvertes.fr/hal-02081913

O. Dukkanci and B. Y. Kara, Routing and scheduling decisions in the hierarchical hub location problem, Computers & Operations Research, vol.85, p.30, 2017.

A. E. Zade and M. Lotfi, Stochastic facility and transfer point covering problem with a soft capacity constraint, International Transactions in Operational Research, p.25, 2015.

A. Ebrahimi-zade, H. Hosseini-nasab, and A. Zahmatkesh, Multi-period hub set covering problems with flexible radius : A modified genetic solution, Applied Mathematical Modelling, vol.40, issue.4, p.30, 2016.

A. T. Ernst and M. Krishnamoorthy, Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location science, vol.4, p.26, 1996.

A. T. Ernst and M. Krishnamoorthy, Solution algorithms for the capacitated single allocation hub location problem, Annals of Operations Research, vol.86, p.139, 1999.

A. T. Ernst, H. Hamacher, H. Jiang, M. Krishnamoorthy, and G. Woeginger, Uncapacitated single and multiple allocation p-hub center problems, Computers & Operations Research, vol.36, issue.7, p.24, 2009.

J. W. Escobar, R. Linfati, and P. Toth, A two-phase hybrid heuristic algorithm for the capacitated locationrouting problem, Computers & Operations Research, vol.40, issue.1, p.39, 2013.

J. W. Escobar, R. Linfati, M. G. Baldoquin, and P. Toth, A granular variable tabu neighborhood search for the capacitated location-routing problem, Transportation Research Part B : Methodological, vol.67, p.39, 2014.

R. Z. Farahani, M. Hekmatfar, A. B. Arabani, and E. Nikbakhsh, Hub location problems : A review of models, classification, solution techniques, and applications, Computers & Industrial Engineering, vol.64, issue.4, p.151, 1920.

H. Farrokhi-asl, R. Tavakkoli-moghaddam, B. Asgarian, and E. Sangari, Metaheuristics for a bi-objective location-routing-problem in waste collection management, Journal of Industrial and Production Engineering, vol.34, issue.4, p.41, 2017.

F. Forouzanfar and R. Tavakkoli-moghaddam, Using a genetic algorithm to optimize the total cost for a location-routing-inventory problem in a supply chain with risk pooling, Journal of Applied Operational Research, vol.4, issue.1, p.58, 2012.

F. Fortin and M. Parizeau, Revisiting the NSGA-II crowding-distance computation, Proceedings of the 15th annual conference on Genetic and evolutionary computation, vol.63, p.136, 2013.

Y. Gao and Z. Qin, A chance constrained programming approach for uncertain p-hub center location problem, Computers & Industrial Engineering, vol.102, p.31, 2016.

A. Ghodratnama, R. Tavakkoli-moghaddam, and A. Azaron, Robust and fuzzy goal programming optimization approaches for a novel multi-objective hub location-allocation problem : A supply chain overview, Applied Soft Computing, vol.37, p.31, 2015.

F. W. Glover and G. A. Kochenberger, Handbook of metaheuristics, vol.57, p.55, 2006.

B. L. Golden, S. Raghavan, and E. A. Wasil, The vehicle routing problem : latest advances and new challenges, vol.43, p.129, 2008.

J. Gonzalez-feliu, G. Perboli, R. Tadei, and D. Vigo, The two-echelon capacitated vehicle routing problem, p.34, 2008.
URL : https://hal.archives-ouvertes.fr/halshs-00879447

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

V. C. Guzmáan, A. D. Masegosa, D. A. Pelta, and J. L. Verdegay, Fuzzy models and resolution methods for covering location problems : an annotated bibliography, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.24, issue.04, p.28, 2016.

T. Harks, F. G. König, and J. Matuschke, Approximation algorithms for capacitated location routing, Transportation Science, vol.47, issue.1, p.34, 2013.

Y. He, T. Wu, C. Zhang, and Z. Liang, An improved mip heuristic for the intermodal hub location problem, Omega, vol.57, p.30, 2015.

J. Hickman, D. Hassel, R. Joumard, Z. Samaras, and S. Sorenson, Meet-methodology for calculating transport emissions and energy consumption, European Commission, vol.45, p.93, 1999.

W. Ho, G. T. Ho, P. Ji, and H. C. Lau, A hybrid genetic algorithm for the multi-depot vehicle routing problem, Engineering Applications of Artificial Intelligence, vol.21, issue.4, p.58, 2008.

A. Hoff, J. Peiró, Á. Corberán, and R. Martí, Heuristics for the capacitated modular hub location problem, Computers & Operations Research, vol.86, p.30, 2017.

M. Jabal-ameli, M. Aryanezhad, and N. Ghaffari-nasab, A variable neighborhood descent based heuristic to solve the capacitated location-routing problem, International Journal of Industrial Engineering Computations, vol.2, issue.1, p.39, 2011.

R. Jamshidi, S. F. Ghomi, and B. Karimi, Multi-objective green supply chain optimization with a new hybrid memetic algorithm using the taguchi method, Scientia Iranica, vol.19, issue.6, p.96, 2012.

A. Jokar and R. Sahraeian, An iterative two phase search based heuristic to solve the capacitated locationrouting problem, Australian Journal of Basic and Applied Sciences, vol.5, issue.12, p.39, 2011.

A. Jokar and R. Sahraeian, A heuristic based approach to solve a capacitated location-routing problem, Journal of Management and Sustainability, vol.2, issue.2, p.39, 2012.

B. Y. Kara and B. C. Tansel, On the single-assignment p-hub center problem, European Journal of Operational Research, vol.125, issue.3, p.24, 2000.

I. Kara, B. Kara, and M. Yetis, Energy minimizing vehicle routing problem. Combinatorial optimization and applications, vol.49, p.133, 2007.

I. Karaoglan and F. Altiparmak, A hybrid genetic algorithm for the location-routing problem with simultaneous pickup and delivery, Computers and Industrial Engineering (CIE), 2010 40th International Conference on, vol.56, p.58, 2010.

I. Karaoglan and F. Altiparmak, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Computers & Operations Research, vol.55, p.135, 1996.

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, p.34, 2011.

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, p.152, 2012.

M. Karimi, A. Eydi, and E. Korani, Modeling of the capacitated single allocation hub location problem with a hierarchical approach, International Journal of Engineering, vol.27, issue.4, p.49, 2014.

L. Kechmane, B. Nsiri, and A. Baalal, A memetic algorithm for the capacitated location-routing problem, INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, vol.7, issue.6, p.39, 2016.

J. G. Klincewicz, Hub location in backbone/tributary network design : A review, Location Science, vol.6, issue.1, p.19, 1998.

A. Klose and A. Drexl, Facility location models for distribution system design, European journal of operational research, vol.162, issue.1, p.19, 2005.

Ç. Koç and G. Laporte, Vehicle routing with backhauls : Review and research perspectives. Computers & Operations Research, p.129, 2017.

R. Kramer, A. Subramanian, T. Vidal, and F. C. Lucídio-dos-anjos, A matheuristic approach for the pollution-routing problem, European Journal of Operational Research, vol.243, issue.2, p.49, 2015.

J. Kratica, An electromagnetism-like metaheuristic for the uncapacitated multiple allocation p-hub median problem, Computers & Industrial Engineering, vol.66, issue.4, p.30, 2013.

J. Kratica, M. Milanovi?, Z. Stanimirovi?, and D. To?i?, An evolutionary-based approach for solving a capacitated hub location problem, Applied Soft Computing, vol.11, issue.2, p.58, 2011.

J. Kratica, Z. Stanimirovi?, D. To?i?, and V. Filipovi?, Genetic algorithm for solving uncapacitated multiple allocation hub location problem, Computing and Informatics, vol.24, issue.4, p.58, 2012.

M. Lam and J. , Capacitated hierarchical clustering heuristic for multi depot location-routing problems, International Journal of Logistics Research and Applications, vol.16, issue.5, p.39, 2013.

G. Laporte, A survey of algorithms for location-routing problems, Investigación Operativa, vol.1, issue.2, p.29, 1989.

G. Laporte, The vehicle routing problem : An overview of exact and approximate algorithms, European journal of operational research, vol.59, issue.3, p.129, 1992.

G. Laporte, What you should know about the vehicle routing problem, Naval Research Logistics (NRL), vol.54, issue.8, p.129, 2007.

G. Laporte, Y. Nobert, and D. Arpin, An exact algorithm for solving a capacitated location-routing problem, Annals of Operations Research, vol.6, issue.9, p.35, 1986.

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, p.35, 1988.

K. Li, K. Deb, Q. Zhang, and Q. Zhang, Efficient nondomination level update method for steady-state evolutionary multiobjective optimization, IEEE Transactions on Cybernetics, vol.97, p.102, 2016.

R. Liu, Z. Jiang, and N. Geng, A hybrid genetic algorithm for the multi-depot open vehicle routing problem, OR spectrum, vol.36, issue.2, p.58, 2014.

S. Liu and S. Lee, A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration, The International Journal of Advanced Manufacturing Technology, vol.22, p.44, 2003.

R. B. Lopes, S. Barreto, C. Ferreira, and B. S. Santos, A decision-support tool for a capacitated locationrouting problem, Decision Support Systems, vol.46, issue.1, p.39, 2008.

R. B. Lopes, C. Ferreira, B. S. Santos, and S. Barreto, A taxonomical analysis, current methods and objectives on location-routing problems, International Transactions in Operational Research, vol.20, issue.6, p.40, 2013.

R. B. Lopes, F. Plastria, C. Ferreira, and B. S. Santos, Location-arc routing problem : Heuristic approaches and test instances, Computers & Operations Research, vol.43, p.34, 2014.

R. B. Lopes, C. Ferreira, and B. S. Santos, A simple and effective evolutionary algorithm for the capacitated location-routing problem, Computers & Operations Research, vol.70, p.39, 2016.

M. Lozano and C. García-martínez, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification : Overview and progress report, Computers & Operations Research, vol.37, issue.3, p.55, 2010.

A. I. Mahmutogullari and B. Y. Kara, Hub location under competition, European Journal of Operational Research, vol.250, issue.1, p.30, 2016.

S. Ajdad, S. A. Torabi, and S. Salhi, A hierarchical algorithm for the planar single-facility location routing problem, Computers & Operations Research, vol.39, issue.2, p.134, 2012.

M. Mari?, Z. Stanimirovi?, and P. Stanojevi?, An efficient memetic algorithm for the uncapacitated single allocation hub location problem, Soft Computing, vol.17, issue.3, p.58, 2013.

Y. Marinakis and M. Marinaki, A particle swarm optimization algorithm with path relinking for the location routing problem, Journal of Mathematical Modelling and Algorithms, vol.7, issue.1, p.39, 2008.

Y. Marinakis and M. Marinaki, A bilevel genetic algorithm for a real life location routing problem, International Journal of Logistics : Research and Applications, vol.11, issue.1, p.39, 2008.

I. Martínez-salazar, J. Molina, R. Caballero, and F. Ángel-bello, Memetic algorithms for solving a biobjective transportation location routing problem, IIE Annual Conference. Proceedings, page 3654. Institute of Industrial and Systems Engineers (IISE), vol.57, p.58, 2014.

E. Martins-de-sá, I. Contreras, J. Cordeau, R. Saraiva-de-camargo, and G. De-miranda, The hub line location problem, Transportation Science, vol.49, issue.3, p.30, 2015.

E. M. Martins-de-sá, I. Contreras, and J. Cordeau, Exact and heuristic algorithms for the design of hub networks with multiple lines, European Journal of Operational Research, vol.246, issue.1, p.30, 2015.

G. Mavrotas, Effective implementation of the ?-constraint method in multi-objective mathematical programming problems, Applied Mathematics and Computation, vol.213, issue.2, p.119, 2009.

J. F. Meier, An improved mixed integer program for single allocation hub location problems with stepwise cost function, International Transactions in Operational Research, vol.24, issue.5, p.30, 2017.

M. B. Menezes, D. Ruiz-hernández, and V. Verter, A rough-cut approach for evaluating location-routing decisions via approximation algorithms, Transportation Research Part B : Methodological, vol.87, p.29, 2016.

M. Merakl? and H. Yaman, Robust intermodal hub location under polyhedral demand uncertainty, Transportation Research Part B : Methodological, vol.86, p.31, 2016.

M. Merakl? and H. Yaman, A capacitated hub location problem under hose demand uncertainty, Computers & Operations Research, vol.88, p.31, 2017.

I. Mesgari and F. Barzinpour, A fast variable neighborhood search for p-hub median problem using social network analysis concepts, Journal of the Chinese Institute of Engineers, vol.39, issue.3, p.30, 2016.

T. Meyer, A. T. Ernst, and M. Krishnamoorthy, A 2-phase algorithm for solving the single allocation p-hub center problem, Computers & Operations Research, vol.36, issue.12, p.27, 2009.

H. Min, V. Jayaraman, and R. Srivastava, Combined location-routing problems : A synthesis and future research directions, European Journal of Operational Research, vol.108, issue.1, p.29, 1998.

S. Miskovic, Memetic algorithm for the uncapacitated multiple allocation p-hub center problem, IPSI BGD TRANSACTIONS ON INTERNET RESEARCH, vol.13, issue.1

M. Mohammadi, R. Tavakkoli-moghaddam, H. Tolouei, and M. Yousefi, Solving a hub covering location problem under capacity constraints by a hybrid algorithm, Journal of Applied Operational Research, vol.2, issue.2, p.58, 2010.

M. Mohammadi, F. Jolai, and R. Tavakkoli-moghaddam, Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm, Applied Mathematical Modelling, vol.37, issue.24, p.31, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01793937

M. Mohammadi, J. Razmi, and R. Tavakkoli-moghaddam, Multi-objective invasive weed optimization for stochastic green hub location routing problem with simultaneous pick-ups and deliveries, Economic Computation & Economic Cybernetics Studies & Research, vol.47, issue.3

M. Mohammadi, J. Razmi, and R. Tavakkoli-moghaddam, Multi-objective invasive weed optimization for stochastic green hub location routing problem with simultaneous pick-ups and deliveries, Economic Computation & Economic Cybernetics Studies & Research, vol.47, issue.3, p.44, 2013.

M. Mohammadi, S. Torabi, and R. Tavakkoli-moghaddam, Sustainable hub location under mixed uncertainty, Transportation Research Part E : Logistics and Transportation Review, vol.62, p.31, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01793924

M. Mohammadi, R. Tavakkoli-moghaddam, A. Siadat, and Y. Rahimi, A game-based meta-heuristic for a fuzzy bi-objective reliable hub location problem, Engineering Applications of Artificial Intelligence, vol.50, p.31, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01794867

M. A. Mohammed, M. S. Ahmad, and S. A. Mostafa, Using genetic algorithm in implementing capacitated vehicle routing problem, Computer & Information Science (ICCIS), 2012 International Conference on, vol.1, p.58, 2012.

N. Mokhtari and M. Abbasi, Applying vnpso algorithm to solve the many-to-many hub location-routing problem in a large scale, European Online Journal of Natural and Social Sciences, vol.3, issue.4, p.44, 2014.

P. Moscato and C. Cotta, A gentle introduction to memetic algorithms, Handbook of metaheuristics, vol.56, pp.105-144, 2003.

M. Moshref-javadi and S. Lee, The latency location-routing problem, European Journal of Operational Research, vol.255, issue.2, p.33, 2016.

A. Nadizadeh, R. Sahraeian, A. S. Zadeh, and S. M. Homayouni, Using greedy clustering method to solve capacitated location-routing problem, African Journal of Business Management, vol.5, issue.17, p.39, 2011.

M. Naeem and B. Ombuki-berman, An efficient genetic algorithm for the uncapacitated single allocation hub location problem, Evolutionary Computation (CEC), p.58, 2010.

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, p.58, 2010.

G. Nagy and S. Salhi, The many-to-many location-routing problem, Top, vol.6, issue.2, p.44, 1998.

G. Nagy and S. Salhi, Location-routing : Issues, models and methods, European Journal of Operational Research, vol.177, issue.2, p.32, 2007.

J. Nalepa and Z. J. Czech, A parallel memetic algorithm to solve the vehicle routing problem with time windows, p.58, 2014.

F. Neri and C. Cotta, Memetic algorithms and memetic computing optimization : A literature review. Swarm and Evolutionary Computation, vol.2, p.56, 2012.

V. Nguyen, C. Prins, and C. Prodhon, A multi-start evolutionary local search for the two-echelon location routing problem, Hybrid Metaheuristics, vol.6373, p.34, 2010.
URL : https://hal.archives-ouvertes.fr/hal-02890911

A. H. Niknamfar, S. T. Niaki, and S. A. Niaki, Opposition-based learning for competitive hub location : A bi-objective biogeography-based optimization algorithm. Knowledge-Based Systems, vol.128, p.30, 2017.

M. E. O'kelly, The location of interacting hub facilities, Transportation science, vol.20, issue.2, pp.92-106, 1986.

M. E. O'kelly, A quadratic integer program for the location of interacting hub facilities, European Journal of Operational Research, vol.32, issue.3, p.49, 1987.

M. E. O'kelly, A quadratic integer program for the location of interacting hub facilities, European Journal of Operational Research, vol.32, issue.3, p.26, 1987.

B. Ombuki, B. J. Ross, and F. Hanshar, Multi-objective genetic algorithms for vehicle routing problem with time windows, Applied Intelligence, vol.24, issue.1, p.58, 2006.

F. Parvaresh, S. H. Golpayegany, S. M. Husseini, and B. Karimi, Solving the p-hub median problem under intentional disruptions using simulated annealing, Networks and Spatial Economics, vol.13, issue.4, p.30, 2013.

J. Peiró, Á. Corberán, and R. Martí, Grasp for the uncapacitated r-allocation p-hub median problem, Computers & Operations Research, vol.43, p.31, 2014.

M. Peker and B. Y. Kara, The p-hub maximal covering problem and extensions for gradual decay functions, Omega, vol.54, p.30, 2015.

M. I. Piecyk and A. C. Mckinnon, Forecasting the carbon footprint of road freight transport in 2020, International Journal of Production Economics, vol.128, issue.1, p.91, 2010.

J. Potvin, Evolutionary algorithms for vehicle routing. CIRRELT, vol.58, p.133, 2007.

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

C. Prins, Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence, vol.22, p.58, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02525203

C. Prins, C. Prodhon, and R. W. Calvo, A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem, Lecture notes in computer science, vol.3906, p.59, 2006.
URL : https://hal.archives-ouvertes.fr/hal-02891678

C. Prins, C. Prodhon, and R. W. Calvo, Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. 4OR : A, Quarterly Journal of Operations Research, vol.4, issue.3, p.134, 2006.
URL : https://hal.archives-ouvertes.fr/hal-02507805

C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R. Wolfler-calvo, Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic, Transportation Science, vol.41, issue.4, p.39, 2007.
URL : https://hal.archives-ouvertes.fr/hal-02507797

C. Prodhon, A hybrid evolutionary algorithm for the periodic location-routing problem, European Journal of Operational Research, vol.210, issue.2, p.58, 2011.
URL : https://hal.archives-ouvertes.fr/hal-02476398

C. Prodhon and C. Prins, A memetic algorithm with population management (ma| pm) for the periodic location-routing problem, Hybrid Metaheuristics, vol.5296, p.58, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02891655

C. Prodhon and C. Prins, A survey of recent research on location-routing problems, European Journal of Operational Research, vol.238, issue.1, p.32, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02479036

J. Puerto, A. Ramos, and A. M. Rodríguez-chía, Single-allocation ordered median hub location problems, Computers & Operations Research, vol.38, issue.2, p.28, 2011.

J. Puerto, A. Ramos, and A. M. Rodríguez-chía, A specialized branch & bound & cut for single-allocation ordered median hub location problems, Discrete Applied Mathematics, vol.161, issue.16, p.30, 2013.

J. Puerto, A. Ramos, A. M. Rodríguez-chía, and M. C. Sánchez-gil, Ordered median hub location problems with capacity constraints, Transportation Research Part C : Emerging Technologies, vol.70, p.30, 2016.

C. L. Quintero-araujo, J. P. Caballero-villalobos, A. A. Juan, and J. R. Montoya-torres, A biasedrandomized metaheuristic for the capacitated location routing problem, International Transactions in Operational Research, vol.24, issue.5, p.39, 2017.

Z. Rasoulinejad, M. Bashiri, and M. Mehrbanfar, A clustering based simulated annealing approach for solving an un-capacitated single allocation p-hub location problem, Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on, vol.27, p.30, 2013.

C. Reeves, Genetic algorithms. Handbook of metaheuristics, vol.63, pp.55-82, 2003.

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, p.58, 2014.

I. Rodríguez-martín, J. Salazar-gonzález, and H. Yaman, A branch-and-cut algorithm for the hub location and routing problem, Computers & Operations Research, vol.50, p.44, 2014.

A. Rybi?ková, A. Burketová, and D. Mocková, Solution to the location-routing problem using a genetic algorithm, Smart Cities Symposium Prague (SCSP), p.39, 2016.

A. Saboury, N. Ghaffari-nasab, F. Barzinpour, and M. S. Jabalameli, Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks, Computers & Operations Research, vol.40, issue.10, p.30, 2013.

H. Saiedy, S. D. Moezi, and M. Noruzi, Modeling of capacitated single allocation hub location problems with n-hub center, vol.25, p.49, 2011.

M. Schneider and M. Drexl, A survey of the standard location-routing problem, Annals of Operations Research, vol.32, p.33, 2017.

M. Schneider and M. Löffler, Large composite neighborhoods and large-scale benchmark instances for the capacitated location-routing problem, vol.38, p.39, 2015.

E. Z. Serper and S. A. Alumur, The design of capacitated intermodal hub networks with different vehicle types, Transportation Research Part B : Methodological, vol.86, p.30, 2016.

M. Setak, H. Karimi, and S. Rastani, Designing incomplete hub location-routing network in urban transportation problem, International Journal of Engineering-Transactions C : Aspects, vol.26, issue.9, p.44, 2013.

M. Shahabi and A. Unnikrishnan, Robust hub network design problem, Transportation Research Part E : Logistics and Transportation Review, vol.70, p.31, 2014.

M. R. Silva and C. B. Cunha, New simple and efficient heuristics for the uncapacitated single allocation hub location problem, Computers & Operations Research, vol.36, issue.12, p.27, 2009.

M. R. Silva and C. B. Cunha, A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem, European Journal of Operational Research, vol.27, p.30, 2017.

S. Sodsoon, Max-min ant system for location-routing problems, Suranaree Journal of Science & Technology, vol.17, issue.4, p.39, 2010.

K. Sörensen and M. Sevaux, Ma| pm : memetic algorithms with population management, Computers & Operations Research, vol.33, issue.5, p.56, 2006.

Z. Stanimirovi?, Solving the capacitated single allocation hub location problem using genetic algorithm. Recent Advances in Stochastic Modelling and Data Analysis, p.58, 2007.

Z. Stanimirovi?, An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem, Control & Cybernetics, vol.37, issue.3, p.58, 2008.

Z. Stanimirovi?, A genetic algorithm approach for the capacitated single allocation p-hub median problem, Computing and Informatics, vol.29, issue.1, p.58, 2012.

P. Stanojevi?, M. Mari?, and Z. Stanimirovi?, A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem, Applied Soft Computing, vol.33, p.30, 2015.

M. Steadieseifi, N. P. Dellaert, W. Nuijten, T. Van-woensel, and R. Raoufi, Multimodal freight transportation planning : A literature review, European journal of operational research, vol.233, issue.1, p.27, 2014.

C. Sterle, Location-routing models and methods for freight distribution and info-mobility in city logistics. technical, p.34, 2008.

J. U. Sun, An integrated hub location and multi-depot vehicle routing problem, In Applied Mechanics and Materials, vol.409, p.44, 2013.

J. U. Sun, An endosymbiotic evolutionary algorithm for the hub location-routing problem, Mathematical Problems in Engineering, vol.43, p.44, 2015.

J. U. Sun and D. Park, An ant colony system hybridized with a genetic algorithm for the capacitated hub location problem, International Conference on Hybrid Information Technology, p.58, 2012.

K. Takano and M. Arai, A genetic algorithm for the hub-and-spoke problem applied to containerized cargo transport, Journal of Marine Science and Technology, vol.14, issue.2, p.58, 2009.

E. Talbi and R. Todosijevi?, The robust uncapacitated multiple allocation p-hub median problem. Computers & Industrial Engineering, p.28, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01654718

P. Z. Tan and B. Y. Kara, A hub covering model for cargo delivery systems, Networks, vol.49, issue.1, p.26, 2007.

M. Tanash, I. Contreras, and N. Vidyarthi, An exact algorithm for the modular hub location problem with single assignments, Computers & Operations Research, vol.85, p.30, 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.39, 2013.

R. Todosijevi?, D. Uro?evi?, N. Mladenovi?, and S. Hanafi, A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem, Optimization Letters, vol.11, issue.6, p.30, 2017.

H. Topcuoglu, F. Corut, M. Ermis, and G. Yilmaz, Solving the uncapacitated hub location problem using genetic algorithms, Computers & Operations Research, vol.32, issue.4, p.58, 2005.

E. M. Toro, J. F. Franco, M. G. Echeverri, and F. G. Guimarães, A multi-objective model for the green capacitated location-routing problem considering environmental impact, Computers & Industrial Engineering, vol.110, p.41, 2017.

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

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

F. Tricoire, Multi-directional local search, Computers & Operations Research, vol.39, issue.12, pp.3089-3101, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01925330

F. Tricoire and S. N. Parragh, Investing in logistics facilities today to reduce routing emissions tomorrow, Transportation Research Part B : Methodological, p.40, 2017.

D. Tuzun and L. I. Burke, A two-phase tabu search approach to the location routing problem, European journal of operational research, vol.116, issue.1, p.38, 1999.

S. Ubeda, F. Arcelus, and J. Faulin, Green logistics at eroski : A case study, International Journal of Production Economics, vol.131, issue.1, p.44, 2011.

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, p.58, 2012.

M. Wasner and G. Zäpfel, An integrated multi-depot hub-location vehicle routing model for network planning of parcel service, International Journal of Production Economics, vol.90, issue.3, p.44, 2004.

T. Wu, C. Low, and J. Bai, Heuristic solutions to multi-depot location-routing problems, Computers & Operations Research, vol.29, issue.10, p.39, 2002.

Y. Xiao, Q. Zhao, I. Kaku, and Y. Xu, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Computers & Operations Research, vol.39, issue.7, p.49, 2012.

H. Yaman, Allocation strategies in hub networks, European Journal of Operational Research, vol.211, issue.3, p.20, 2011.

H. Yaman and S. Elloumi, Star p-hub center problem and star p-hub median problem with bounded path lengths, Computers & Operations Research, vol.39, issue.11, p.24, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01126040

K. Yang, Y. Liu, and G. Yang, An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem, Computers & Industrial Engineering, vol.64, issue.1, p.31, 2013.

K. Yang, Y. Liu, and G. Yang, Solving fuzzy p-hub center problem by genetic algorithm incorporating local search, Applied Soft Computing, vol.13, issue.5, p.31, 2013.

K. Yang, L. Yang, and Z. Gao, Planning and optimization of intermodal hub-and-spoke network under mixed uncertainty, Transportation Research Part E : Logistics and Transportation Review, vol.95, p.31, 2016.

K. Yang, L. Yang, and Z. Gao, Hub-and-spoke network design problem under uncertainty considering financial and service issues : A two-phase approach, Information Sciences, vol.402, p.31, 2017.

F. V. Yu, S. Lin, W. Lee, and C. Ting, A simulated annealing heuristic for the capacitated location routing problem, Computers & Industrial Engineering, vol.58, issue.2, p.39, 2010.

V. F. Yu and S. Lin, Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing, International Journal of Production Research, vol.54, issue.2, p.96, 2016.

S. Zameni and J. Razmi, Multimodal transportation p-hub location routing problem with simultaneous pick-ups and deliveries, Journal of Optimization in Industrial Engineering, vol.8, issue.17, p.58, 2015.

H. Zhai, Y. Liu, and K. Yang, Modeling two-stage uhl problem with uncertain demands, Applied Mathematical Modelling, vol.40, issue.4, p.31, 2016.

M. Zhalechian, R. Tavakkoli-moghaddam, and Y. Rahimi, A self-adaptive evolutionary algorithm for a fuzzy multi-objective hub location problem : An integration of responsiveness and social responsibility, Engineering Applications of Artificial Intelligence, vol.62, p.25, 2017.

M. Zhalechian, R. Tavakkoli-moghaddam, and Y. Rahimi, A self-adaptive evolutionary algorithm for a fuzzy multi-objective hub location problem : An integration of responsiveness and social responsibility, Engineering Applications of Artificial Intelligence, vol.62, p.31, 2017.

M. Zhalechian, R. Tavakkoli-moghaddam, Y. Rahimi, and F. Jolai, An interactive possibilistic programming approach for a multi-objective hub location problem : Economic and environmental design, Applied Soft Computing, vol.52, p.31, 2017.

B. Zhang, Z. Ma, and S. Jiang, Location-routing-inventory problem with stochastic demand in logistics distribution systems, Wireless Communications, Networking and Mobile Computing, 2008. WiCOM'08. 4th International Conference on, p.33, 2008.

M. Zhang, N. Bostel, P. Dejax, and H. M. Hoang, An exact method for the capacitated single allocation hub location-routing problem, XIII ISOLDE Symposium, vol.42, p.58, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01085206

E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. G. Da-fonseca, Performance assessment of multiobjective optimizers : An analysis and review, IEEE Transactions on Evolutionary Computation, vol.7, issue.2, p.119, 2003.