Y. Adulyasak, J. F. Cordeau, and R. Jans, Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems, INFORMS Journal on Computing, vol.26, issue.1, pp.103-120, 2014.
DOI : 10.1287/ijoc.2013.0550

Y. Adulyasak, J. Cordeau, and R. Jans, Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem, Transportation Science, vol.48, issue.1, pp.20-45, 2014.
DOI : 10.1287/trsc.1120.0443

B. El-houssaine-aghezzaf, H. Raa, and . Van-landeghem, Modeling inventory routing problems in supply chains of high consumption products, European Journal of Operational Research, vol.169, issue.3, pp.1048-1063, 2006.
DOI : 10.1016/j.ejor.2005.02.008

A. Ahmadi, J. , 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

A. Ahmadi-javid and P. Hoseinpour, Incorporating location, inventory and price decisions into a supply chain distribution network design problem, Computers & Operations Research, vol.56, pp.110-119, 2015.
DOI : 10.1016/j.cor.2014.07.014

A. Ak and A. L. Erera, A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands, Transportation Science, vol.41, issue.2, pp.222-237, 2007.
DOI : 10.1287/trsc.1060.0180

J. Aldrich and .. R. , R.A. Fisher and the making of maximum likelihood 1912-1922, Statistical Science, vol.12, issue.3, pp.162-176, 1997.
DOI : 10.1214/ss/1030037906

M. Alinaghian and N. Shokouhi, Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search, Omega, vol.76, 1954.
DOI : 10.1016/j.omega.2017.05.002

M. Benjamin, Metaheuristics for the waste collection vehicle routing problem with time windows, School of Information Systems, Computing, vol.52, p.56, 2011.

E. Angelelli and M. G. Speranza, The periodic vehicle routing problem with intermediate facilities, European Journal of Operational Research, vol.137, issue.2, pp.233-247, 2002.
DOI : 10.1016/S0377-2217(01)00206-5

S. Anily and A. Federgruen, One Warehouse Multiple Retailer Systems with Vehicle Routing Costs, Management Science, vol.36, issue.1, pp.1497-1499, 1991.
DOI : 10.1287/mnsc.36.1.92

P. António and . Antunes, Location analysis helps manage solid waste in Central Portugal, Interfaces, vol.29, issue.4, pp.32-43, 1999.

C. Archetti, L. Bertazzi, A. Hertz, and M. G. Speranza, A Hybrid Heuristic for an Inventory Routing Problem, INFORMS Journal on Computing, vol.24, issue.1, pp.101-116, 2012.
DOI : 10.1287/ijoc.1100.0439

C. Archetti, L. Bertazzi, G. Laporte, and M. G. Speranza, A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem, Transportation Science, vol.41, issue.3, pp.382-391, 2007.
DOI : 10.1287/trsc.1060.0188

C. Archetti, L. Bertazzi, G. Paletta, and M. G. Speranza, Analysis of the maximum level policy in a production-distribution system, Computers & Operations Research, vol.38, issue.12, pp.1731-1746, 2011.
DOI : 10.1016/j.cor.2011.03.002

P. Avella, M. Boccia, and A. Sforza, Solving a fuel delivery problem by heuristic and exact approaches, European Journal of Operational Research, vol.152, issue.1, pp.170-179, 2004.
DOI : 10.1016/S0377-2217(02)00676-8

M. F. Badran and S. M. El-haggar, Optimization of municipal solid waste management in Port Said ??? Egypt, Waste Management, vol.26, issue.5, pp.534-545, 1922.
DOI : 10.1016/j.wasman.2005.05.005

R. Baldacci, M. Battarra, and D. Vigo, Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs, Networks, vol.106, issue.4, pp.178-189, 2009.
DOI : 10.1007/978-1-4613-1361-8

R. Baldacci and A. Mingozzi, A unified exact method for solving different classes of vehicle routing problems, Mathematical Programming, vol.106, issue.3, pp.347-380, 2009.
DOI : 10.1137/1.9780898718515.ch5

R. Baldacci, A. Mingozzi, and R. Roberti, New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem, Operations Research, vol.59, issue.5, pp.1269-1283, 2011.
DOI : 10.1287/opre.1110.0975

M. Banerjea-brodeur, J. Cordeau, G. Laporte, and A. Lasry, Scheduling linen deliveries in a large hospital, Journal of the Operational Research Society, vol.49, issue.8, pp.777-780, 1998.
DOI : 10.1057/palgrave.jors.2600581

J. F. Bard, L. Huang, M. Dror, and P. Jaillet, A branch and cut algorithm for the VRP with satellite facilities, IIE Transactions, vol.26, issue.9, pp.821-834, 1998.
DOI : 10.1137/0405004

J. F. Bard, L. Huang, P. Jaillet, and M. Dror, A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities, Transportation Science, vol.32, issue.2, pp.189-203, 1998.
DOI : 10.1287/trsc.32.2.189

S. Belhaiza, P. Hansen, and G. Laporte, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Computers & Operations Research, vol.52, pp.269-281
DOI : 10.1016/j.cor.2013.08.010

S. Belhaiza, M. Rym, G. B. Hallah, and . Brahim, A new Hybrid Genetic Variable Neighborhood search heuristic for the Vehicle Routing Problem with Multiple Time Windows, 2017 IEEE Congress on Evolutionary Computation (CEC), pp.1319-1326
DOI : 10.1109/CEC.2017.7969457

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

P. Belotti, P. Bonami, M. Fischetti, A. Lodi, M. Monaci et al., On handling indicator constraints in mixed integer programming, Computational Optimization and Applications, vol.14, issue.4, pp.545-566, 2016.
DOI : 10.1007/s10115-007-0114-2

URL : http://www.dei.unipd.it/%7Esalvagni/pdf/indicator.pdf

E. J. Beltrami and L. D. Bodin, Networks and vehicle routing for municipal waste collection, Networks, vol.1, issue.1, pp.65-94, 1974.
DOI : 10.2140/pjm.1969.28.565

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

O. Berman and R. C. Larson, Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming, Transportation Science, vol.35, issue.2, pp.192-213, 2001.
DOI : 10.1287/trsc.35.2.192.10134

L. Bertazzi, G. Paletta, and G. Speranza, Deterministic Order-Up-To Level Policies in an Inventory Routing Problem, Transportation Science, vol.36, issue.1, pp.119-132, 2002.
DOI : 10.1287/trsc.36.1.119.573

D. J. Bertsimas, A vehicle routing problem with stochastic demand, jun 1992, p.97
DOI : 10.1287/opre.40.3.574

J. M. Bloemhof-ruwaard, M. Salomon, N. Luk, and . Van-wassenhove, The capacitated distribution and waste disposal problem, European Journal of Operational Research, vol.88, issue.3, pp.490-503, 1922.
DOI : 10.1016/0377-2217(94)00211-8

P. Bonami, A. Lodi, A. Tramontani, and S. Wiese, On mathematical programming with indicator constraints, Mathematical Programming, vol.86, issue.9, pp.191-223, 2015.
DOI : 10.1007/s101070050103

M. Boudia and C. Prins, A memetic algorithm with dynamic population management for an integrated production???distribution problem, European Journal of Operational Research, vol.195, issue.3, pp.703-715, 2009.
DOI : 10.1016/j.ejor.2007.07.034

J. Boukachour, . Dkhissi, T. Aeh-alaoui, and . Lamoudan, Un algorithme hybride pour la résolution du problème de collecte des déchets, Researchgate.Net, p.52

O. Bräysy and M. Gendreau, Vehicle routing problem with time windows, Part II : Metaheuristics. Transportation science, p.53, 2005.

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol.39, issue.1, pp.104-118, 2005.
DOI : 10.1287/trsc.1030.0056

K. Buhrkal, A. Larsen, and S. Ropke, The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context, Procedia - Social and Behavioral Sciences, vol.39, pp.241-254, 2012.
DOI : 10.1016/j.sbspro.2012.03.105

A. Campbell, L. Clarke, A. Kleywegt, and M. Savelsbergh, The Inventory Routing Problem, Fleet Management and Logistics, pp.95-113, 1998.
DOI : 10.1007/978-1-4615-5755-5_4

A. M. Campbell and M. W. Savelsbergh, A Decomposition Approach for the Inventory-Routing Problem, Transportation Science, vol.38, issue.4, pp.488-502, 2004.
DOI : 10.1287/trsc.1030.0054

A. M. Campbell and J. H. Wilson, Forty years of periodic vehicle routing, Networks, vol.40, issue.1, pp.2-15, 1950.
DOI : 10.1016/j.cor.2012.07.018

A. Chabrier, Vehicle Routing Problem with elementary shortest path based column generation, Computers & Operations Research, vol.33, issue.10, pp.2972-2990, 2006.
DOI : 10.1016/j.cor.2005.02.029

P. Chandra, A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements, Journal of the Operational Research Society, vol.44, issue.7, pp.681-692, 1993.
DOI : 10.1057/jors.1993.117

P. Chandra and M. L. Fisher, Coordination of production and distribution planning, European Journal of Operational Research, vol.72, issue.3, pp.503-517, 1994.
DOI : 10.1016/0377-2217(94)90419-7

T. William-chien, A. Balakrishnan, and R. T. Wong, An Integrated Inventory Allocation and Vehicle Routing Problem, Transportation Science, vol.23, issue.2, pp.67-76, 1989.
DOI : 10.1287/trsc.23.2.67

E. Choi and D. Tcha, A column generation approach to the heterogeneous fleet vehicle routing problem, Computers & Operations Research, vol.34, issue.7, pp.2080-2095, 2007.
DOI : 10.1016/j.cor.2005.08.002

M. Christiansen and M. Christiansen, Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem, Transportation Science, vol.33, issue.1, p.52, 1999.
DOI : 10.1287/trsc.33.1.3

M. Christiansen and B. Nygreen, A method for solving ship routing problemswith inventory constraints, Annals of Operations Research, vol.81, pp.357-378, 1998.
DOI : 10.1023/A:1018921527269

M. Christiansen and B. Nygreen, Modelling path flows for a combined ship routingand inventory management problem, Annals of Operations Research, vol.82, pp.391-412, 1998.
DOI : 10.1023/A:1018979107222

G. D. Claassen and T. H. Hendriks, An application of Special Ordered Sets to a periodic milk collection problem, European Journal of Operational Research, vol.180, issue.2, pp.754-769, 2007.
DOI : 10.1016/j.ejor.2006.03.042

L. C. Coelho, J. F. Cordeau, and G. Laporte, The inventory-routing problem with transshipment, Computers & Operations Research, vol.39, issue.11, pp.2537-2548, 2012.
DOI : 10.1016/j.cor.2011.12.020

L. C. Coelho, J. F. Cordeau, and G. Laporte, Consistency in multi-vehicle inventory-routing. Transportation Research Part C : Emerging Technologies, pp.270-287, 2012.
DOI : 10.1016/j.trc.2012.03.007

C. Leandro, G. Coelho, and . Laporte, A branch-and-cut algorithm for the multi-product multivehicle inventory-routing problem, International Journal of Production Research, vol.51, issue.54, pp.23-247156

C. Leandro, G. Coelho, and . Laporte, The exact solution of several classes of inventory-routing problems, Computers and Operations Research, vol.40, issue.51, pp.558-565, 2013.

W. Cook and J. Rich, A parallel cutting-plane algorithm for the vehicle routing problem with time windows, Computational and Applied Mathematics Department, p.78, 1999.

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

J. F. Benoit-crevier, G. Cordeau, and . Laporte, The multi-depot vehicle routing problem with inter-depot routes, European Journal of Operational Research, vol.176, issue.2, pp.756-773, 2007.
DOI : 10.1016/j.ejor.2005.08.015

E. Danna and C. Pape, Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows, Column Generation, pp.99-129, 2005.
DOI : 10.1007/0-387-25486-2_4

B. George, P. Dantzig, N. J. Wolfe, and . Feb, Decomposition Principle for Linear Programs DECOMPOSITION PRINCIPLE FOR LINEAR PROGRAMSt, p.41, 2014.

M. Laure-delignette-muller and C. Dutang, fitdistrplus : An R Package for Fitting Distributions, Journal of Statistical Software, vol.64, issue.4, pp.1-34, 2015.

G. Desaulniers, F. Lessard, and A. Hadjar, -Path Inequalities for the Vehicle Routing Problem with Time Windows, Transportation Science, vol.42, issue.3, pp.387-404, 2008.
DOI : 10.1287/trsc.1070.0223

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

M. Dror and M. Ball, Inventory/routing: Reduction from an annual to a short-period problem, Naval Research Logistics, vol.14, issue.6, pp.891-905, 1987.
DOI : 10.1002/1520-6750(198712)34:6<891::AID-NAV3220340613>3.0.CO;2-J

M. Dror, M. Ball, and B. Golden, A computational comparison of algorithms for the inventory routing problem, Annals of Operations Research, vol.14, issue.1, pp.1-23, 1985.
DOI : 10.1007/BF02022035

M. Dror and L. Levy, A vehicle routing improvement algorithm comparison of a ???greedy??? and a matching implementation for inventory routing, Computers & Operations Research, vol.13, issue.1, pp.33-45, 1951.
DOI : 10.1016/0305-0548(86)90062-6

A. Nasser and . El-sherbeny, Vehicle routing with time windows : An overview of exact, heuristic and metaheuristic methods, Journal of King Saud University -Science, vol.22, issue.3, pp.123-131, 2010.

M. Elbek, W. Sanne, and . Hlk, A variable neighborhood search for the multi-period collection of recyclable materials, European Journal of Operational Research, vol.249, issue.2, pp.540-550, 2016.
DOI : 10.1016/j.ejor.2015.08.035

J. Euchi and H. Chabchoub, A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem, Logistics Research, vol.195, issue.1, pp.3-11, 2010.
DOI : 10.1007/978-1-4615-5755-5_2

C. Fallahi, R. W. Prins, and . Calvo, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Computers & Operations Research, vol.35, issue.5, pp.1725-1741, 2008.
DOI : 10.1016/j.cor.2006.10.006

D. Favaretto, E. Moretti, and P. Pellegrini, Ant colony system for a VRP with multiple time windows and multiple visits, Journal of Interdisciplinary Mathematics, vol.35, issue.1, pp.263-284, 2007.
DOI : 10.1287/opre.35.2.254

URL : https://iris.unive.it/bitstream/10278/25480/1/JouIntMath10%282%29_2007.pdf

A. Federgruen and P. Zipkin, A Combined Vehicle Routing and Inventory Allocation Problem, Operations Research, vol.32, issue.5, pp.1019-1037, 1984.
DOI : 10.1287/opre.32.5.1019

G. Fleury, P. Lacomme, and C. Prins, Evolutionary Algorithms for Stochastic Arc Routing Problems, pp.501-512, 2004.
DOI : 10.1007/978-3-540-24653-4_51

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

L. R. Ford, Network Flow Theory. rand.org, p.63, 1956.

V. Gaur and M. L. Fisher, A Periodic Inventory Routing Problem at a Supermarket Chain, Operations Research, vol.52, issue.6, pp.813-822, 2004.
DOI : 10.1287/opre.1040.0150

URL : http://pubsonline.informs.org/doi/pdf/10.1287/opre.1040.0150

M. Geiger and M. Sevaux, On the use of reference points for the biobjective Inventory Routing Problem, Metaheuristics International Conference, pp.1-9
URL : https://hal.archives-ouvertes.fr/hal-00649665

M. J. Geiger and M. Sevaux, The Biobjective Inventory Routing Problem ??? Problem Solution and Decision Support, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol.189, issue.3, pp.6701-365, 2011.
DOI : 10.1016/j.ejor.2007.02.061

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

C. Gencer, I. Top, and . Aydogan, A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: Passenger pickup algorithm, Applied Mathematics and Computation, vol.181, issue.2, pp.1552-1567, 2006.
DOI : 10.1016/j.amc.2006.02.043

G. Ghiani, D. Laganà, E. Manni, R. Musmanno, and D. Vigo, Operations research in solid waste management: A survey of strategic and tactical issues, Computers & Operations Research, vol.44, issue.21, pp.22-32, 2014.
DOI : 10.1016/j.cor.2013.10.006

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

B. Golden, A. Assad, L. Levy, and F. Gheysens, The fleet size and mix vehicle routing problem, Computers & Operations Research, vol.11, issue.1, pp.49-66, 1984.
DOI : 10.1016/0305-0548(84)90007-8

L. Bruce, E. A. Golden, and . Wasil, OR Practice?Computerized Vehicle Routing in the Soft Drink Industry, Operations Research, vol.35, issue.1, pp.6-17, 1987.

V. Hemmelmayr, K. F. Doerner, R. F. Hartl, and M. W. Savelsbergh, Delivery strategies for blood products supplies, OR Spectrum, vol.29, issue.4, pp.707-725, 2009.
DOI : 10.1007/s00291-008-0134-7

G. H. Huang, B. W. Baetz, and G. G. Patry, Trash-Flow Allocation: Planning Under Uncertainty, Interfaces, vol.28, issue.6, pp.36-55, 1998.
DOI : 10.1287/inte.28.6.36

L. Huang, Inventory routing problem with satellite facilities, p.56, 1997.

. Shan-huen, P. Huang, and . Lin, A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty, Transportation Research Part E : Logistics and Transportation Review, vol.46, issue.5, pp.598-611, 2010.

L. M. Hvattum, L. Arne, and G. Laporte, Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems, INFORMS Journal on Computing, vol.21, issue.2, pp.268-285, 2009.
DOI : 10.1287/ijoc.1080.0291

L. M. Hvattum and A. Løkketangen, Using scenario trees and progressive hedging for??stochastic inventory routing problems, Journal of Heuristics, vol.16, issue.6, pp.527-557, 2009.
DOI : 10.1007/BF00247208

S. Hwang, Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, p.52, 2005.

S. Irnich and D. Villeneuve, ??? 3, INFORMS Journal on Computing, vol.18, issue.3, pp.391-406, 2006.
DOI : 10.1287/ijoc.1040.0117

M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger, Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows, Operations Research, vol.56, issue.2, pp.497-511, 2008.
DOI : 10.1287/opre.1070.0449

B. Jose, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, European Journal Of Operational Research, vol.195, issue.3, pp.716-728, 2009.

A. Juan, J. Faulin, S. Grasman, D. Riera, J. Marull et al., Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands, Transportation Research Part C: Emerging Technologies, vol.19, issue.5, pp.751-765, 2011.
DOI : 10.1016/j.trc.2010.09.007

B. Kallehauge, J. Larsen, and O. Madsen, Lagrangian duality applied to the vehicle routing problem with time windows, Computers & Operations Research, vol.33, issue.5, pp.1464-1487, 2006.
DOI : 10.1016/j.cor.2004.11.002

L. Kandiller, B. Eliiyi, and . Tasar, A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution, pp.149-155, 2017.
DOI : 10.1016/0377-2217(94)00189-J

. Byung-in, S. Kim, S. Kim, and . Sahoo, Waste collection vehicle routing problem with time windows, Computers & Operations Research, vol.33, issue.52, pp.3624-3642, 2006.

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

URL : http://www.cs.virginia.edu/cs432/documents/sa-1983.pdf

Ç. Koç, T. Bektas, O. Jabali, and G. Laporte, Thirty years of heterogeneous vehicle routing, pp.2016-53

N. Kohl, J. Desrosiers, B. G. Oli, and M. M. Madsen, 2-Path Cuts for the Vehicle Routing Problem with Time Windows, Transportation Science, vol.33, issue.1, pp.101-116, 1999.
DOI : 10.1287/trsc.33.1.101

A. N. Kolmogorov, Sulla determinazione emperica di una legge di distribuizione, pp.83-91, 1933.

T. Kulcar, Optimizing solid waste collection in Brussels, European Journal of Operational Research, vol.90, issue.1, pp.71-77, 1996.
DOI : 10.1016/0377-2217(94)00311-4

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

J. Larsen, Parallelization of the vehicle routing problem with time windows. Optimization, pp.294-78, 1999.

Y. Lee, K. Kim, K. Kang, and . Kim, A heuristic for vehicle fleet mix problem using tabu search and set partitioning, Journal of the Operational Research Society, vol.176, issue.6, pp.833-841, 2008.
DOI : 10.1057/palgrave.jors.2601344

J. Liu and Y. He, A Clustering-Based Multiple Ant Colony System for the Waste Collection Vehicle Routing Problems, 2012 Fifth International Symposium on Computational Intelligence and Design, pp.182-185, 2012.
DOI : 10.1109/ISCID.2012.197

S. Liu, A hybrid population heuristic for the heterogeneous vehicle routing problems, Transportation Research Part E: Logistics and Transportation Review, vol.54, pp.67-78
DOI : 10.1016/j.tre.2013.03.010

I. Markov, S. Varone, and M. Bierlaire, Vehicle Routing for a Complex Waste Collection Problem, 14th Swiss Transport Research Conference, pp.1-25, 2014.

G. Marsaglia and T. A. Bray, A Convenient Method for Generating Normal Variables, SIAM Review, vol.6, issue.3, pp.260-264, 1964.
DOI : 10.1137/1006063

I. Mathlouthi, M. Gendreau, and J. Potvin, Mixed integer linear programming for a multi-attribute technician routing and scheduling problem, INFOR: Information Systems and Operational Research, vol.56, issue.1, pp.1-17
DOI : 10.1023/A:1011377929184

J. E. Mendoza, B. Castanier, C. Guéret, A. L. Medaglia, and N. Velasco, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, Computers & Operations Research, vol.37, issue.11, pp.1886-1898, 2010.
DOI : 10.1016/j.cor.2009.06.015

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

D. Mester, O. Bräysy, and W. Dullaert, A multi-parametric evolution strategies algorithm for vehicle routing problems, Expert Systems with Applications, vol.32, issue.2, pp.508-517, 2007.
DOI : 10.1016/j.eswa.2005.12.014

A. S. Minkoff, A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching, Operations Research, vol.41, issue.1, pp.77-90, 1993.
DOI : 10.1287/opre.41.1.77

P. L. Miranda, R. Morabito, and D. Ferreira, Optimization model for a production, inventory, distribution and routing problem in small furniture companies, TOP, vol.98, issue.1, pp.1-38, 2017.
DOI : 10.1016/S0377-2217(97)80080-X

Z. Naji-azimi and M. Salari, A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem, Applied Mathematical Modelling, vol.37, issue.6, pp.4316-4324
DOI : 10.1016/j.apm.2012.09.027

J. A. Nelder and R. Mead, A Simplex Method for Function Minimization, The Computer Journal, vol.7, issue.4, pp.308-313, 1965.
DOI : 10.1093/comjnl/7.4.308

T. Nuortio, J. Kytöjoki, H. Niska, and O. Bräysy, Improved route planning and scheduling of waste collection and transport, Expert Systems with Applications, vol.30, issue.2, pp.223-232, 2006.
DOI : 10.1016/j.eswa.2005.07.009

B. Ombuki-berman, Waste collection vehicle routing problem with time windows using multiobjective genetic algorithms, Proceedings of the Third, vol.52, p.56, 2007.

I. Hassan-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

D. J. Papageorgiou, G. L. Nemhauser, J. Sokol, M. Seok-cheon, and A. B. Keha, MIRPLib ??? A library of maritime inventory routing problem instances: Survey, core model, and benchmark results, European Journal of Operational Research, vol.235, issue.2, pp.350-366, 2014.
DOI : 10.1016/j.ejor.2013.12.013

D. Pecin, C. Contardo, G. Desaulniers, and E. Uchoa, New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows, INFORMS Journal on Computing, vol.29, issue.3, pp.489-502, 2017.
DOI : 10.1287/ijoc.2016.0744

J. A. Persson and M. Göthe-lundgren, Shipment planning at oil refineries using column generation and valid inequalities, European Journal of Operational Research, vol.163, issue.3, pp.631-652, 2005.
DOI : 10.1016/j.ejor.2004.02.008

G. Pesant, On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem, European Journal of Operational Research, vol.117, issue.2, pp.253-263, 1999.
DOI : 10.1016/S0377-2217(98)00248-3

G. Pesant, . Gendreau, J. Potvin, and . Rousseau, An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows, Transportation Science, vol.32, issue.1, pp.12-29, 1998.
DOI : 10.1287/trsc.32.1.12

A. Pessoa, E. Uchoa, and M. Aragão, A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem, Networks, vol.106, issue.4, pp.167-177, 2009.
DOI : 10.1002/net.20330

W. W. Qu, J. H. Bookbinder, and P. Iyogun, An integrated inventory???transportation system with modified periodic policy for multiple products, European Journal of Operational Research, vol.115, issue.2, pp.254-269, 1999.
DOI : 10.1016/S0377-2217(98)00301-4

B. Raa and E. Aghezzaf, A practical solution approach for the cyclic inventory routing problem, European Journal of Operational Research, vol.192, issue.2, pp.429-441, 2009.
DOI : 10.1016/j.ejor.2007.09.032

H. R. , D. Lourenço, and R. Ribeiro, Inventory-Routing Model, for a Multi-Period Problem with Stochastic and Deterministic Demand, p.56, 2003.

M. Reed, A. Yiannakou, and R. Evering, An ant colony algorithm for the multi-compartment vehicle routing problem, Applied Soft Computing, vol.15, pp.169-176, 2014.
DOI : 10.1016/j.asoc.2013.10.017

URL : http://opus.bath.ac.uk/37663/1/reed_asoc_a.pdf

J. Renaud, F. F. Boctor, and G. Laporte, An Improved Petal Heuristic for the Vehicle Routeing Problem, Journal of the Operational Research Society, vol.47, issue.2, pp.329-336, 1996.
DOI : 10.1057/jors.1996.29

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

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

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, pp.455-472, 2006.
DOI : 10.1287/trsc.1050.0135

A. Runka, B. Ombuki-berman, and M. Ventresca, A search space analysis for the waste collection vehicle routing problem with time windows, Proceedings of the 11th Annual conference on Genetic and evolutionary computation, GECCO '09, pp.1813-1814, 2009.
DOI : 10.1145/1569901.1570175

S. Sahoo, S. Kim, B. I. Kim, B. Kraas, and A. Popov, Routing Optimization for Waste Management, Interfaces, vol.35, issue.1, pp.24-36, 2005.
DOI : 10.1287/inte.1040.0109

M. W. Savelsbergh, The Vehicle Routing Problem with Time Windows: Minimizing Route Duration, ORSA Journal on Computing, vol.4, issue.2, pp.91-94, 1991.
DOI : 10.1287/ijoc.4.2.146

URL : https://pure.tue.nl/ws/files/1661516/345296.pdf

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, pp.139-171, 2000.
DOI : 10.1006/jcph.1999.6413

F. Sevilla and C. De-blas, Vehicle routing problem with time windows and intermediate facilities, p.52, 2003.

P. Shaw, A new local search algorithm providing high quality solutions to vehicle routing problems . APES Group, pp.1-12, 1997.

N. Siswanto, Mathematical Model for Maritime Inventory Routing Problem with Multiple Time Windows. ieomsociety.org, pp.2767-2773, 2016.

N. Smirnov, Table for Estimating the Goodness of Fit of Empirical Distributions, The Annals of Mathematical Statistics, vol.19, issue.2, pp.279-281, 1948.
DOI : 10.1214/aoms/1177730256

M. Marius and . Solomon, Algorithms for and Scheduling Problems the Vehicle Routing With Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.

O. Solyali and H. Süral, A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem, Transportation Science, vol.45, issue.3, pp.335-345, 2011.
DOI : 10.1287/trsc.1100.0354

O. Solyal?, J. Cordeau, and G. Laporte, Robust Inventory Routing Under Demand Uncertainty, Transportation Science, vol.46, issue.3, pp.327-340, 2012.
DOI : 10.1287/trsc.1110.0387

M. Speranza and W. Ukovich, An algorithm for optimal shipments with given frequencies, Naval Research Logistics, vol.43, issue.5, pp.655-671, 1951.
DOI : 10.1002/(SICI)1520-6750(199608)43:5<655::AID-NAV4>3.0.CO;2-4

E. D. Taillard, A heuristic column generation method for the heterogeneous fleet VRP, RAIRO - Operations Research, vol.33, issue.1, pp.1-14, 1999.
DOI : 10.1051/ro:1999101

J. Teixeira, A. Pais-antunes, J. Pinho, and . Sousa, Recyclable waste collection planning??????a case study, European Journal of Operational Research, vol.158, issue.3, pp.543-554, 2004.
DOI : 10.1016/S0377-2217(03)00379-5

A. Frank and . Tillman, The Multiple Terminal Delivery Problem with Probabilistic Demands.pdf, aug 1969, p.52

A. Frank and . Tillman, The Multiple Terminal Delivery Problem with Probabilistic Demands.pdf, aug 1969, p.97

A. Frank, T. M. Tillman, and . Cain, An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem, Management Science, vol.18, issue.11, pp.664-682, 1972.

A. Frank, R. W. Tillman, and . Hering, A study of a look-ahead procedure for solving the multiterminal delivery problem, Transportation Research, vol.5, issue.3, pp.225-229, 1971.

T. Vidal, T. Gabriel-crainic, M. Gendreau, and C. Prins, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Computers & Operations Research, vol.40, issue.1, pp.475-489
DOI : 10.1016/j.cor.2012.07.018

N. Wassan and I. Osman, Tabu search variants for the mix fleet vehicle routing problem, Journal of the Operational Research Society, vol.53, issue.7, pp.768-782, 2002.
DOI : 10.1057/palgrave.jors.2601344

M. Woch and P. Lebkowski, Sequential simulated annealing for the vehicle routing problem with time windows. Decision Making in Manufacturing and Services, pp.87-100, 2009.

H. Yaman, Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem, Mathematical Programming, vol.8, issue.2, pp.365-390, 2006.
DOI : 10.1007/BFb0121103

J. S-yeomans, G. Huang, and R. Yoogalingam, Combining Simulation with Evolutionary Algorithms for Optimal Planning Under Uncertainty: An Application to Municipal Solid Waste Management Planning in the Reginonal Municipality of Hamilton-Wentworth, Journal of Environmental Informatics, vol.2, issue.1, pp.11-30, 2003.
DOI : 10.3808/jei.200300014

J. Scott and Y. , Solid waste planning under uncertainty using evolutionary simulationoptimization, Socio-Economic Planning Sciences, vol.41, issue.1, pp.38-60, 2007.

J. Scott and Y. , Efficient generation of alternative perspectives in public environmental policy formulation : Applying co-evolutionary simulation-optimization to municipal solid waste management, Central European Journal of Operations Research, vol.19, issue.4, pp.391-413, 1922.