, Managing the Network Size: a Sparse Graph Construction Heuristic growing difficulty of the instances, with respect to distinct parameters, it appears interesting to combine them

. .. Introduction,

. .. A-hybrid-matheuristic, , p.117

C. .. Study, 117 6.4.1 Performance of the Algorithms

. .. Conclusions, 127 Bibliography [Adulyasak 2012] Yossiri Adulyasak, Jean-François Cordeau and Raf Jans. Optimization-based adaptive large neighborhood search for the production routing problem, Transportation Science, vol.48, issue.1, p.27, 2012.

Y. Adulyasak, J. Cordeau, and R. Jans, The production routing problem: A review of formulations and solution algorithms, Computers & Operations Research, vol.55, p.27, 2015.

, Polyhedral combinatorics of the k-partitioning problem with representative variables, Zacharie Ales, Arnaud Knippel and Alexandre Pauchet, vol.211, pp.1-14, 2016.

F. Altiparmak, M. Gen, L. Lin, and I. Karaoglan, A steady-state genetic algorithm for multi-product supply chain network design, Computers & Industrial Engineering, vol.56, issue.2, pp.521-537, 2009.

A. Amiri, Designing a distribution network in a supply chain system: Formulation and efficient solution procedure, European journal of operational research, vol.171, issue.2, pp.567-576, 2006.

, Service network design with asset management: Formulations and comparative analyses, Transportation Research Part C: Emerging Technologies, vol.17, issue.2, p.33, 2009.

J. Andersen and M. Christiansen, Teodor Gabriel Crainic and Roar Grønhaug. Branch and price for service network design with asset management constraints, Transportation Science, vol.45, issue.1, p.33, 2011.

C. Archetti, L. Bertazzi, G. Paletta, and M. Speranza, Analysis of the maximum level policy in a production-distribution system, Computers & Operations Research, vol.38, issue.12, p.27, 2011.

A. Azaron, S. A. Brown, M. Tarim, and . Modarres, A multi-objective stochastic programming approach for supply chain design considering risk, International Journal of Production Economics, vol.116, issue.1, pp.129-138, 2008.

C. Barnhart, N. Krishnan, D. Kim, and K. Ware, Network design for express shipment delivery, Computational Optimization and Applications, vol.21, issue.3, p.29, 2002.

M. Bashiri, H. Badri, and J. Talebi, A new approach to tactical and strategic planning in production-distribution networks, Applied Mathematical Modelling, vol.36, issue.4, pp.1703-1717, 2012.

M. Benita and . Beamon, Supply chain design and analysis:: Models and methods, International journal of production economics, vol.55, issue.3, p.21, 1998.

F. Jacques and . Benders, Partitioning procedures for solving mixedvariables programming problems, Numerische mathematik, vol.4, issue.1, pp.238-252, 1962.

P. Berkhin, A survey of clustering data mining techniques, Grouping multidimensional data, p.76, 2006.

, Application of fuzzy mathematical programming approach to the production allocation and distribution supply chain network problem, Expert Systems with Applications, vol.37, issue.6, p.26, 2010.

N. Boland, M. Hewitt, L. Marshall, and M. Savelsbergh, The continuous-time service network design problem, Operations Research, vol.65, issue.5, pp.1303-1321, 2017.

N. Boland, M. Hewitt, L. Marshall, and M. Savelsbergh, The price of discretizing time: a study in service network design, EURO Journal on Transportation and Logistics, vol.126, p.16, 2018.

J. Bravo and C. J. Vidal, Freight transportation function in supply chain optimization models: A critical review of recent trends, Expert Systems with Applications, vol.40, issue.17, p.22, 2013.

P. Chandra, L. Marshall, and . Fisher, Coordination of production and distribution planning, European Journal of Operational Research, vol.72, issue.3, pp.503-517, 1994.

M. Chouman, G. Teodor, B. Crainic, and . Gendron, A cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design. Université de Montréal, Centre de recherche sur les transports, vol.34, p.30, 2003.

M. Chouman, T. G. Crainic, and B. Gendron, Commodity representations and cut-set-based inequalities for multicommodity capacitated fixed-charge network design, Transportation Science, vol.51, issue.2, pp.650-667, 2016.

M. Chouman, T. G. Crainic, and B. Gendron, The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, EURO Journal on Computational Optimization, vol.6, issue.2, pp.143-184, 2018.

A. Cintron, R. Ravindran, and J. Ventura, Multi-criteria mathematical model for designing the distribution network of a consumer goods company, Computers & Industrial Engineering, vol.58, issue.4, pp.584-593, 2010.

G. Codato and M. Fischetti, Combinatorial Benders' cuts for mixed-integer linear programming, Operations Research, vol.54, issue.4, p.43, 2006.

M. Alysson and . Costa, A survey on benders decomposition applied to fixedcharge network design problems, Computers & operations research, vol.32, issue.6, pp.1429-1450, 2005.

M. Alysson, J. Costa, B. Cordeau, G. Gendron, and . Laporte, Accelerating benders decomposition with heuristic master problem solutions, Pesquisa Operacional, vol.32, issue.1, p.43, 2012.

G. Teodor, J. Crainic, and . Rousseau, Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem, Transportation Research Part B: Methodological, vol.20, issue.3, p.21, 1986.

T. Gabriel, C. , and G. Laporte, Planning models for freight transportation, European journal of operational research, vol.97, issue.3, p.21, 1997.

T. Gabriel and C. , Service network design in freight transportation, European journal of operational research, vol.122, issue.2, pp.272-288, 2000.

T. Gabriel-crainic, M. Gendreau, and J. M. Farvolden, A simplex-based tabu search method for capacitated network design, FORMS journal on Computing, vol.12, issue.3, pp.223-236, 2000.

T. Gabriel-crainic, A. Frangioni, and B. Gendron, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Discrete Applied Mathematics, vol.112, issue.1-3, pp.73-99, 2001.

T. Gabriel-crainic, B. Gendron, and G. Hernu, A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design, Journal of Heuristics, vol.10, issue.5, pp.525-545, 2004.

T. Gabriel-crainic, M. Hewitt, and W. Rei, Partial decomposition strategies for two-stage stochastic integer programs. CIRRELT, vol.40, 2014.

T. Gabriel-crainic, M. Hewitt, M. Toulouse, and D. Vu, Service network design with resource constraints, Transportation Science, vol.50, issue.4, p.33, 2014.

T. Gabriel-crainic, W. Rei, M. Hewitt, and F. Maggioni, Partial benders decomposition strategies for two-stage stochastic integer programs, vol.37, 2016.

É. Dufour and G. Laporte, Julie Paquette and Marie-Ève Rancourt. Logistics service network design for humanitarian response in East Africa, Omega, vol.74, p.21, 2018.

. ?-selçuk-erengüç, C. Natalie, A. Simpson, and . Vakharia, Integrated production/distribution planning in supply chains: An invited review, European journal of operational research, vol.115, issue.2, p.22, 1999.

A. Erera, M. Hewitt, M. Savelsbergh, and Y. Zhang, Improved load plan design through integer programming based local search, Transportation Science, vol.47, issue.3, p.33, 2013.

M. Eskandarpour, P. Dejax, and O. Péton, A large neighborhood search heuristic for supply chain network design, Computers & Operations Research, vol.80, pp.23-37, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01068286

M. Esmaeilikia, B. Fahimnia, J. Sarkis, K. Govindan, A. Kumar et al., Tactical supply chain planning models with inherent flexibility: definition and review, Annals of Operations Research, vol.244, issue.2, p.22, 2016.

, Catherine Esnouf, Marie Russel and Nicolas Bricas. Food system sustainability: insights from dualine, vol.1, 2013.

R. Z. Behnam-fahimnia, R. Farahani, L. Marian, and . Luong, A review and critique on integrated production-distribution planning models and techniques, Journal of Manufacturing Systems, vol.32, issue.1, p.22, 2013.

H. Fazlollahtabar, I. Mahdavi, and A. Mohajeri, Applying fuzzy mathematical programming approach to optimize a multiple supply network in uncertain condition with comparative analysis, Applied Soft Computing, vol.13, issue.1, p.26, 2013.

M. Fischetti and A. Lodi, Local branching. Mathematical programming, vol.98, issue.1-3, p.31, 2003.

M. Fischetti, D. Salvagnin, and A. Zanette, A note on the selection of, Benders' cuts. Mathematical Programming, vol.124, issue.1-2, p.43, 2010.

P. Fontaine, T. Crainic, W. Rei, and O. Jabali, Multimodal scheduled service network design with resource management for twotier city logistics. CIRRELT, Centre interuniversitaire de recherche sur les réseaux d'entreprise, vol.34, p.29, 2017.

F. Lester-r and D. R. Fulkerson, Constructing maximal dynamic flows from static flows, Operations research, vol.6, issue.3, p.29, 1958.

L. R. Ford and . Fulkerson, Flows in networks, p.29, 1962.

A. Frangioni and B. Gendron, 0-1 reformulations of the multicommodity capacitated network design problem, Discrete Applied Mathematics, vol.157, issue.6, pp.1229-1241, 2009.

B. Gendron and . Crainic, Relaxations for multicommodity network design problems. Publication CRT-965, Centre de recherche sur les transports, vol.30, p.31, 1994.

B. Gendron and . Crainic, Bounding procedures for multicommodity capacitated network design problems. Publication crt-96-09, Centre de recherché sur les transports, vol.13, p.31, 1996.

B. Gendron, T. G. Crainic, and A. Frangioni, Multicommodity capacitated network design, Telecommunications network planning, p.29, 1999.

B. Gendron, S. Hanafi, and R. Todosijevi?, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, European Journal of Operational Research, vol.268, issue.1, p.32, 2018.

M. Arthur, G. W. Geoffrion, and . Graves, Multicommodity distribution system design by Benders decomposition, Management science, vol.20, issue.5, pp.822-844, 1974.

, Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design, Operations research, vol.51, issue.4, pp.655-667, 2003.

, Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design, Annals of Operations research, vol.131, issue.1-4, pp.109-133, 2004.

]. Hewitt, L. George, . Nemhauser, W. P. Martin, and . Savelsbergh, Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem, INFORMS Journal on Computing, vol.22, issue.2, p.32, 2010.

K. Holmberg and J. Hellstrand, Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound, Operations research, vol.46, issue.2, pp.247-259, 1998.

K. Holmberg and D. Yuan, A Lagrangian heuristic based branchand-bound approach for the capacitated network design problem, Operations Research, vol.48, issue.3, p.30, 2000.

A. Hugo and . Efstratios-n-pistikopoulos, Environmentally conscious long-range planning and design of supply chain networks, Journal of Cleaner Production, vol.13, issue.15, pp.1471-1491, 2005.

K. Anil, . Jain, C. Richard, and . Dubes, Algorithms for clustering data, vol.6, p.76, 1988.

E. Ahmad-i-jarrah, . Johnson, C. Lucas, and . Neubert, Large-scale, less-than-truckload service network design, Operations Research, vol.57, issue.3, p.32, 2009.

D. Kim, C. Barnhart, K. Ware, and G. Reinhardt, Multimodal express package delivery: A service network design application, Transportation Science, vol.33, issue.4, p.29, 1999.

D. Kim, M. Panos, and . Pardalos, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Operations Research Letters, vol.24, issue.4, p.51, 1999.

D. Kim, M. Panos, and . Pardalos, Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, Networks: An International Journal, vol.35, issue.3, p.51, 2000.

D. Kim, X. Pan, M. Panos, and . Pardalos, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, Computational Economics, vol.27, issue.2-3, p.51, 2006.

M. Georgios, L. Kopanos, . Puigjaner, C. Michael, and . Georgiadis, Simultaneous production and logistics operations planning in semicontinuous food industries, Omega, vol.40, issue.5, pp.634-650, 2012.

K. H. Byung-ki-lee, Y. Kang, and . Lee, Decomposition heuristic to minimize total cost in a multi-level supply chain network, Computers & Industrial Engineering, vol.54, issue.4, pp.945-959, 2008.

K. Hong, K. Lo, W. An, and . Lin, Ferry service network design under demand uncertainty, Transportation Research Part E: Logistics and Transportation Review, vol.59, p.29, 2013.

L. Thomas, R. Magnanti, and . Wong, Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria, Operations research, vol.29, issue.3, p.43, 1981.

L. Thomas, P. Magnanti, . Mireault, T. Richard, and . Wong, Tailoring Benders decomposition for uncapacitated network design, Netflow at Pisa, vol.38, pp.112-154, 1986.

J. Medina, Modèles et méthodes d'optimisation pour la mutualisation des chaînes logistiques, p.27, 2016.

T. Melo, S. Nickel, and F. Gama, Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning, Computers & Operations Research, vol.33, issue.1, p.23, 2006.

T. Melo, S. Nickel, and F. Saldanha-da-gama, Facility location and supply chain management-A review, European journal of operational research, vol.196, issue.2, p.21, 2009.

S. Mt-melo, F. Nickel, and . Saldanha-da-gama, A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon, International Journal of Production Economics, vol.136, issue.1, pp.218-230, 2012.

J. Mula and D. Peidro, Manuel Díaz-Madroñero and Eduardo Vicens. Mathematical programming models for supply chain production and transport planning, European Journal of Operational Research, vol.204, issue.3, p.22, 2010.

R. Rahmaniani, T. G. Crainic, M. Gendreau, and W. Rei, The Benders decomposition algorithm: A literature review, European Journal of Operational Research, vol.259, issue.3, pp.801-817, 2017.

W. Rei, J. Cordeau, M. Gendreau, and P. Soriano, Accelerating Benders decomposition by local branching, INFORMS Journal on Computing, vol.21, issue.2, p.43, 2009.

J. Inmaculada-rodríguez-martín and . Salazar-gonzález, A local branching heuristic for the capacitated fixed-charge network design problem, Computers & Operations Research, vol.37, issue.3, p.31, 2010.

, Comité National Routier, p.108, 2019.

M. Ruokokoski, J. Solyali, R. Cordeau, H. Jans, and . Süral, Efficient formulations and a branch-and-cut algorithm for a production-routing problem, p.27, 2010.

K. D. Georgios, M. Saharidis, S. Boile, and . Theofanis, Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems, Expert Systems with Applications, vol.38, issue.6, p.43, 2011.

T. Santoso, S. Ahmed, M. Goetschalckx, and A. Shapiro, A stochastic programming approach for supply chain network design under uncertainty, European Journal of Operational Research, vol.167, issue.1, pp.96-115, 2005.

V. Schmid, F. Karl, G. Doerner, and . Laporte, Rich routing problems arising in supply chain management, European Journal of Operational Research, vol.224, issue.3, p.22, 2013.

M. Skutella, An introduction to network flows over time, Research trends in combinatorial optimization, p.29, 2009.

V. Sridhar and J. S. Park, Benders-and-cut algorithm for fixed-charge capacitated network design problem, European Journal of Operational Research, vol.125, issue.3, pp.622-632, 2000.

K. Samir and . Srivastava, Network design for reverse logistics, Omega, vol.36, issue.4, p.21, 2008.

P. N. Thanh, N. Bostel, and O. Péton, A dynamic model for facility location in the design of complex supply chains. International journal of production economics, vol.113, p.23, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00308588

P. N. Thanh, O. Péton, and N. Bostel, A linear relaxation-based heuristic approach for logistics network design, Computers & Industrial Engineering, vol.59, issue.4, pp.964-975, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00530637

]. Tomlin, Minimum-cost multicommodity network flows, Operations Research, vol.14, issue.1, p.29, 1966.

N. Shah and C. C. Pantelides, Design of multi-echelon supply chain networks under demand uncertainty, Industrial & Engineering Chemistry Research, vol.40, issue.16, pp.3585-3604, 2001.

J. Carlos, M. Vidal, and . Goetschalckx, Strategic productiondistribution models: A critical review with emphasis on global supply chain models, European journal of operational research, vol.98, issue.1, p.22, 1997.

. Bibliography-;-fan, X. Wang, N. Lai, and . Shi, A multi-objective optimization for green supply chain network design, Decision Support Systems, vol.51, issue.2, pp.262-269, 2011.

N. Wieberneit, Service network design for freight transportation: a review, OR spectrum, vol.30, issue.1, pp.77-112, 2008.

W. Yeh, A hybrid heuristic algorithm for the multistage supply chain network problem, The International Journal of Advanced Manufacturing Technology, vol.26, issue.5-6, pp.675-685, 2005.

D. Alebachew, K. Yimer, and . Demirli, A genetic approach to twophase optimization of dynamic supply chain scheduling, Computers & Industrial Engineering, vol.58, issue.3, pp.411-422, 2010.

E. Zhu, T. G. Crainic, and M. Gendreau, Scheduled service network design for freight rail transportation, Operations research, vol.62, issue.2, p.51, 2014.