B. Frédérique, Hypothèse 1 : |Zc 1 | < |Zc 2 | Frédérique BANIEL 3

A. S. Alfa, S. S. Heragu, and M. Chen, A 3-OPT based simulated annealing algorithm for vehicle routing problems, Computers & Industrial Engineering, vol.21, issue.1-4, p.635639, 1991.
DOI : 10.1016/0360-8352(91)90165-3

K. Altinkemer and B. Gavish, Parallel Savings Based Heuristics for the Delivery Problem, Operations Research, vol.39, issue.3, p.456469, 1991.
DOI : 10.1287/opre.39.3.456

S. K. Amponsah and S. Salhi, The investigation of a class of capacited arc routing problems : the collection of garbage in developing countries, Waste management, vol.24, issue.7, p.711721, 2004.

E. Angelelli and M. G. Speranza, The application of a vehicle routing model to a waste-collection problem: two case studies, Journal of the Operational Research Society, vol.53, issue.9, p.944952, 2002.
DOI : 10.1057/palgrave.jors.2601402

P. Baise, Tournées de véhicules d'une société coopérative : algorithmes séquentiels et parallèles, 1996.

S. Baptista, R. C. Oliveira, and E. Zuquete, A period vehicle routing case study, European Journal of Operational Research, vol.139, issue.2, p.220229, 2002.
DOI : 10.1016/S0377-2217(01)00363-0

B. Baran and M. Schaerer, A multiobjective ant colony system for vehicle routing problem with time windows, Fom Proceeding : Applied Informatics, 2003.

J. Bautista, E. Fernández, and J. Pereira, Solving an urban waste collection problem using ants heuristics, Computers & Operations Research, vol.35, issue.9, p.30203033, 2008.
DOI : 10.1016/j.cor.2007.01.029

J. Bautista and J. Pereira, Ant Algorithms for Urban Waste Collection Routing, Lecture Notes in Computer Science, issue.3172, p.302309, 2004.
DOI : 10.1007/978-3-540-28646-2_28

J. E. Beasley, Route-rst cluster-second methods for vehicle routing, Omega, vol.11, issue.4, p.403408, 1983.

A. Beham, Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows, Lecture Notes in COmputer Science, vol.4739, p.829836, 2007.
DOI : 10.1007/978-3-540-75867-9_104

J. M. Belenguer, E. Benavent, P. Lacomme, and C. Prins, Lower and upper bounds for the mixed capacited arc routing problem, Computers and Operations Research, vol.33, p.33633383, 2006.

E. J. Beltrami and L. D. Bodin, Networks and vehicle routing for municipal waste collection, Networks, vol.1, issue.1, p.6594, 1974.
DOI : 10.1002/net.3230040106

J. Berger and M. Barkaoui, A hybrid genetic algorithm for the capacited vehicle routing problem, GECCO LNCS, vol.2723, p.646656, 2003.

J. Berger and M. Barkaoui, A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research, vol.31, issue.12, p.20372053, 2004.
DOI : 10.1016/S0305-0548(03)00163-1

L. D. Bodin, B. L. Golden, A. A. Assad, and M. O. Ball, Routing and scheduling of vehicles and crews : the state of the art, Computers and Operations Research, vol.10, issue.2, p.63211, 1983.

D. Bommesitty, M. Dessouky, and L. Jacobs, Scheduling collection of recyclable material at Northern Illinois University campus using a two-phase algorithm, Computers & Industrial Engineering, vol.35, issue.3-4, p.435438, 1998.
DOI : 10.1016/S0360-8352(98)00127-2

A. Van-breedam, An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints, 1994.

A. V. Breedam, Improvement heuristics for the Vehicle Routing Problem based on simulated annealing, European Journal of Operational Research, vol.86, issue.3, p.480490, 1995.
DOI : 10.1016/0377-2217(94)00064-J

O. Bräysy, A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows, INFORMS Journal on Computing, vol.15, issue.4, p.347368, 2003.
DOI : 10.1287/ijoc.15.4.347.24896

O. Bräysy and M. Gendreau, Tabu Search heuristics for the Vehicle Routing Problem with Time Windows, Top, vol.31, issue.2, p.211237, 2002.
DOI : 10.1007/BF02579017

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part II: Metaheuristics, Transportation Science, vol.39, issue.1, p.119139, 2005.
DOI : 10.1287/trsc.1030.0057

B. Bullnheimer, R. F. Hartl, and C. Strauss, An improved ant system algorithm for the vehicle routing problem, Annals of Operations Research, vol.89, p.319328, 1999.

V. Cerny, Thermodynamical approach to the traveling salesman problem : an ecient simulation algorithm, Journal of Optimization Theory and Applications, vol.45, issue.1, p.4151, 1985.

N. B. Chang, H. Y. Lu, and Y. L. Wei, GIS Technology for Vehicle Routing and Scheduling in Solid Waste Collection Systems, Journal of Environmental Engineering, vol.123, issue.9, p.901910, 1997.
DOI : 10.1061/(ASCE)0733-9372(1997)123:9(901)

C. H. Chen, C. J. Ting, and P. C. Chang, Applying a Hybrid Ant Colony System to the Vehicle Routing Problem, ICCSA 2005, p.417426, 2005.
DOI : 10.1007/11424925_45

W. C. Chiang and R. A. , Simulated annealing metaheuristics for the vehicle routing problem with time windows, Annals of Operations Research, vol.19, issue.1, p.327, 1996.
DOI : 10.1007/BF02601637

N. Christodes, A. Mingozzi, and P. Toth, The vehicle routing problem, Combinatorial Optimization, p.315338, 1979.

G. Clarke and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations research, vol.12, p.568581, 1964.

C. A. Coello, An updated survey og g.g. based multiobjective optimization techniques. Rapport technique Lania-RD-98-08, 1998.

J. F. Cordeau and G. Laporte, The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol.1, issue.2, p.89101, 2002.
DOI : 10.1007/s10288-002-0009-8

J. F. Cordeau, G. Laporte, and A. Mercier, A unied tabu search heuristic for the vehicle routing problems with time windows, Journal Of the Operational Research Society, vol.52, p.928936, 2001.

G. B. Dantzig and J. H. Ramser, The Truck Dispatching Problem, Management Science, vol.6, issue.1, p.8091, 1959.
DOI : 10.1287/mnsc.6.1.80

C. Darwin, On the origin of species, John Murray, p.1859

G. Desaulniers, J. Desrosiers, A. Erdmann, M. M. Solomon, and F. Soumis, Vrp with pickup and delivery. The Vehicle Routing Problem, p.225242, 2002.
DOI : 10.1137/1.9780898718515.ch9

M. Desrochers and T. W. Verhoog, A matching based savings algorithm for the vehicle routing problem. Working paper G-89-04, p.954961, 1989.

C. Dhaenens-flipo, Optimisation combinatoire multi-onjectif : Apport des méthodes coopératives et contribution à l'extraction de connaissances. Habilitation à diriger des recherches de l, 2005.

H. Dickho, A typology of cutting and packing problems, European Journal of Operational Research, vol.44, p.145159, 1990.

M. Dorigo, Learning and natural algorithms, 1992.

M. Dorigo, V. Maniezzo, and A. Colorni, Positive feedback as a search strategy. rapport technique 910116, 1991.

M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.26, issue.1, p.2941, 1996.
DOI : 10.1109/3477.484436

M. Dror, Split delivery routing, Naval Research Logistics (NRL), vol.11, issue.1, p.383402, 1990.
DOI : 10.1002/nav.3800370304

M. Dror, Arc Routing : Theory, Solutions and Applications, 2000.
DOI : 10.1007/978-1-4615-4495-1

M. Ehrgott, Multicriteria optimization, Lectures Notes in Economics and Mathematical Systems, vol.491, 2000.
DOI : 10.1007/978-3-662-22199-0

M. Ehrgott and X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spectrum, vol.22, issue.4, p.425460, 2000.
DOI : 10.1007/s002910000046
URL : https://hal.archives-ouvertes.fr/hal-00462047

L. Frédérique, B. D. Bibliographie52-]-d, A. V. Eisenstein, and . Iyer, Garbage collection in chicago : a dynamic scheduling model, Management Science, vol.43, p.922933, 1997.

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

M. L. Fisher and R. Jaikumar, A decomposition algorithm for large-scale vehicle routing, Working Paper Dept. of Decision Sciences, 1978.

M. L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks, vol.21, issue.2, p.109124, 1981.
DOI : 10.1002/net.3230110205

P. Francis, K. Smilowitz, and M. Tzur, The Period Vehicle Routing Problem with Service Choice, Transportation Science, vol.40, issue.4, p.439454, 2006.
DOI : 10.1287/trsc.1050.0140

L. M. Gambardella, E. Taillard, and G. Agazzi, A multiple ant colony system for vehicle routing problems with time windows, New ideas in optimization, p.6376, 1999.

T. J. Gaskell, Bases for vehicle eet scheduling, Operational Research Quarterly, vol.18, p.281295, 1967.

M. Gendreau, A. Hertz, and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, vol.40, issue.10, p.12761290, 1994.
DOI : 10.1287/mnsc.40.10.1276

M. Gendreau, G. Laporte, and J. Y. Potvin, Metaheuristics for the vehicle routing problem, Les Cahiers du GERAD, pp.98-52, 1998.

M. Gendreau, G. Laporte, and R. Séguin, New Insertion and Postoptimization Procedures for the Traveling Salesman Problem, Operations Research, vol.40, issue.6, p.143155, 1992.
DOI : 10.1287/opre.40.6.1086

M. Gendreau, G. Laporte, and R. Séguin, Stochastic vehicle routing, European Journal of Operational Research, vol.88, issue.1, p.312, 1996.
DOI : 10.1016/0377-2217(95)00050-X

B. E. Gillett and L. R. Miller, A Heuristic Algorithm for the Vehicle-Dispatch Problem, Operations Research, vol.22, issue.2, p.340349, 1974.
DOI : 10.1287/opre.22.2.340

F. Glover, Future paths for integer programming and links to articial intelligence, Computers and Operations Research, vol.13, p.533549, 1986.

D. E. Goldberg, Genetic algorithms in search, optimization, and machine learning, 1989.

B. Golden, S. Raghavan, and E. Wasil, The Vehicle Routing Problem, 2007.

B. L. Golden and A. A. Assad, Vehicle routing : Methods and studies, 1988.

B. L. Golden, A. A. Assad, L. Levy, and F. G. Gheysens, The eet size and mix vehicle routing problem, Computers and Operations Research, vol.11, issue.1, p.4966, 1984.

L. Frédérique, B. A. Bibliographie70, S. Haghani, and . Jung, A dynamic vehicle routing problem with time-dependent travels times, Computers and Operations Research, vol.32, p.29592986, 2005.

J. I. Van-hermet and J. A. Poutré, Dynamic routing problems with fruitful regions : Models and evolutionary computation. Parallel Problem Solving from Nature VIII, p.690699, 2004.

H. Housroum, Une approche génétique pour la résolution du problème vrptw dynamique, Thèse élaborée à l'Université d'Artois, 2005.

J. H. Holland, Adaptation in natural and articial system, 1975.

S. Ichoua, M. Gendreau, and J. Y. Potvin, Exploiting knowledge about future demands for realtime vehicle dispatching, Transportation Science, vol.40, p.211215, 2006.

G. K. Janssens, Fleet size determination for waste oil collection in the province of antwerp, Yugoslav Journal of Operational Research, vol.3, p.103113, 1993.

N. Jozefowiez, Modélisation et résolution approchée de problèmes de tournées multi-objectif

N. Jozefowiez, F. Semet, and E. Talbi, Multi-objective vehicle routing problems, European Journal of Operational Research, vol.189, issue.2, p.293309, 2008.
DOI : 10.1016/j.ejor.2007.05.055
URL : https://hal.archives-ouvertes.fr/hal-00831915

N. Jozefowiez, F. Semet, and E. G. Talbi, Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing, Lectures Notes in Computer Science, vol.3871, pp.131-142, 2006.
DOI : 10.1007/11740698_12

B. I. Kim, S. Kim, and S. Sahoo, Waste collection vehicle routing problem with time windows, Computers & Operations Research, vol.33, issue.12, p.36243642, 2006.
DOI : 10.1016/j.cor.2005.02.045

J. D. Kim, H. S. Choi, and D. H. Lee, Vehicle Routing in a Refuse Collection System: a Case Study, 2007 International Conference on Computational Science and its Applications (ICCSA 2007), p.467473, 2007.
DOI : 10.1109/ICCSA.2007.12

G. A. Kinderwater and M. W. Savelsbergh, Vehicle routing : Handling edge exchanges, Local Search in Combinatorial Optimization, p.337360, 1997.

K. and S. Korfmacher, Solid Waste Collection Systems in Developing Urban Areas of South Africa: an Overview and Case Study, Waste Management & Research, vol.2, issue.4, p.477494, 1997.
DOI : 10.1177/0734242X9701500504

P. A. Koushki, U. Duaij, and W. , Collection and transportation cost of household solid waste in Kuwait, Waste Management, vol.24, issue.9, p.957964, 2004.
DOI : 10.1016/j.wasman.2004.03.013

S. O. Krumke, W. E. De-paepe, D. Poensgen, M. Lipmann, A. Marchetti-spaccamela et al., On minimizing the maximum ow time in the online dial-a-ride problem, 2006.

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

L. Frédérique, B. Bibliographie-]-n, and . Labadi, Problèmes d'optimisation en tournées sur les arcs, Thèse à l'université de technologie de Troyes, 2003.

P. Lacomme, C. Prins, and W. Ramdane-chérif, A genetic algorithm for the capacited arc routing problem and its extension, Applications of evolutionnary computing, p.473483, 2001.

P. Lacomme, C. Prins, and W. Ramdane-chérif, Evolutionary algorithms for periodic arc routing problems, European Journal of Operational Research, vol.165, issue.2, p.535553, 2005.
DOI : 10.1016/j.ejor.2004.04.021
URL : https://hal.archives-ouvertes.fr/inria-00104119

P. Lacomme, C. Prins, and M. Sevaux, A genetic algorithm for a bi-objective capacited arc routing problem, Computers and Operations Research, issue.33, p.34733493, 2006.

G. Laporte and F. V. Louveaux, Solving Stochastic Routing Problems with the Integer L-Shaped Method, Fleet Management and Logistics, p.159167, 1998.
DOI : 10.1007/978-1-4615-5755-5_7

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

G. Laporte and F. Semet, Classical and modern heuristics for the vehicle routing problem, International Transactions in Operational Research, vol.21, issue.4-5, 2005.
DOI : 10.2307/2584478

A. Larsen, The dynamic vehicle routing problem. LYNGBY, IMM-PhD, 2000.

A. Larsen, O. B. Madsen, and M. M. Solomon, Classication of dynamic vehicle routing systems, Dynamic Fleet Management : Concept, Systems, Algorithms and Case Studies, 2007.

J. K. Lenstra and A. H. Kan, Complexity of vehicle routing and scheduling problems, Networks, vol.12, issue.2, p.221227, 1981.
DOI : 10.1002/net.3230110211

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

C. Liu, T. C. Chang, and L. F. Huang, Multi-objective heuristics for the vehicle routing problem, International Journal of Operations Research, vol.3, issue.3, p.173181, 2006.

R. Á. Valdés, E. Benavent, V. Campos, A. Corberán, E. Mota et al., A computerized system for urban garbage collection, Topology, vol.1, p.89105, 1993.

R. Minciardi, M. Paolucci, and E. Trasforini, A new procedure to plan routing and scheduling of vehicles for solid waste collection at a metropolitan scale, 2003.

N. Mladenovié and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, p.10971100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2

R. H. Mole and S. Jameson, A sequential route-building algorithm employing a generalized saving criterion, Operational Research Quarterly, vol.27, issue.2, p.503511, 1976.

R. Montemanni, L. M. Gambardella, A. E. Rizzoli, and A. V. Donati, Ant Colony System for a Dynamic Vehicle Routing Problem, Journal of Combinatorial Optimization, vol.46, issue.4, p.327343, 2005.
DOI : 10.1007/s10878-005-4922-6

M. C. Mourao and M. T. Almeida, Lower-bounding and heuristic methods for a refuse collection vehicle routing problem, European Journal of Operational Research, vol.121, issue.2, p.420434, 2000.
DOI : 10.1016/S0377-2217(99)00045-4

M. Mourgaya and F. Vanderbeck, Problème de tournées de véhicules multipériodiques : classication et heuristique pour la planication tactique, RAIRO Operations Research, vol.40, p.169194, 2006.

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

B. M. Ombuki-berman, A. Runka, and F. T. Hanshar, Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms, 2007.

H. L. Ong, T. N. Goh, and K. L. Poh, A computerised vehicle routing system for refuse collection, Advances in Engineering Software (1978), vol.12, issue.2, p.5458, 1990.
DOI : 10.1016/0141-1195(90)90019-3

I. Or, Travelling salesman type combinatorial problems and their relation to the logistics of blood banking, 1976.

I. H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, vol.15, issue.4, p.421451, 1993.
DOI : 10.1007/BF02023004

I. H. Osman and G. Laporte, Metaheuristics: A bibliography, Annals of Operations Research, vol.2, issue.5, p.513623, 1996.
DOI : 10.1007/BF02125421

M. Padberg and G. Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, SIAM Review, vol.33, issue.1, p.60100, 1991.
DOI : 10.1137/1033004

V. Pareto, Cours d'économie politique. Rouge, p.1896

D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Computers & Operations Research, vol.34, issue.8, p.187191, 2007.
DOI : 10.1016/j.cor.2005.09.012

M. Polacek, K. F. Doerner, R. F. Hartl, and V. Maniezzo, A variable neighborhood search for the capacited arc rouitng problem with intermediate facilities, 2005.

J. Y. Potvin and J. M. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, European Journal of Operational Research, vol.66, issue.3, p.331340, 1993.
DOI : 10.1016/0377-2217(93)90221-8

C. Prins, A simple and ejective evolutionary algorithm for the vehicle routing problem, Computer and Operations Research, vol.31, 2004.

J. Privé, J. Renaud, F. Boctor, and G. Laporte, Solving a vehicle-routing problem arising in soft-drink distribution, Journal of the Operational Research Society, vol.152, issue.9, p.10451052, 2006.
DOI : 10.1016/S0377-2217(02)00669-0

J. Privé, J. Renaud, F. Boctor, and G. Laporte, Solving a vehicle-routing problem arising in soft-drink distribution, Journal of the Operational Research Society, vol.152, issue.9, p.10451052, 2006.
DOI : 10.1016/S0377-2217(02)00669-0

Q. Jun, J. Wang, and B. J. Zheng, A Hybrid Multi-objective Algorithm for Dynamic Vehicle Routing Problems, Lecture Notes in Computer Science, vol.5103, p.674681, 2008.
DOI : 10.1007/978-3-540-69389-5_75

W. Ramdane-chérif, Problèmes d'optimisation en tournées sur les arcs, Thèse soutenue à l'université de technologie de Troyes, 2002.

W. Ramdane-chérif, EVOLUTIONARY ALGORITHMS FOR CAPACITATED ARC ROUTING PROBLEMS WITH TIME WINDOWS, 12th IFAC Symposium on Information Control Problems in Manufacturing -INCOM, 2006.
DOI : 10.3182/20060517-3-FR-2903.00174

C. Rego and C. , Using tabu search for solving a dynamic multiterminal truck dispatching problem, European Journal of Operational Research, vol.83, p.411429, 1995.

J. Renaud, F. F. Boctor, and L. Gilbert, An improved petal heuristic for the vehicle routing problem, Journal of the Operational Research Society, vol.47, p.11561167, 1996.

Y. Rochat and E. Taillard, Probabilistic diversication and intensication in local search for vehicle routing, Journal of Heuristics, vol.1, p.147167, 1995.

R. A. Russell and W. Igo, An assignment routing problem, Networks, vol.21, issue.1, p.117, 1979.
DOI : 10.1002/net.3230090102

A. Schrijver, On the history of combinatorial optimization (till 1960) Handbook of Discrete Optimization, p.168, 2005.

P. Shaw, Using constraint and local search methods to solve routing problems, CP-98, Fourth international conference on principles and practice of constraint programming, Lecture notes in computer science, p.417431, 1998.

L. H. Shih and H. C. Chang, A routing and scheduling system for infectious waste collection, Environmental Modeling and Assessment, vol.6, p.261269, 2001.

M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, p.254265, 1987.
DOI : 10.1287/opre.35.2.254

T. Stützle, Local search algorithms for combinatorial problems -analysis, algorithms and new applications. DISKI -Dissertationen zur Künstliken Intelligenz, 1999.

E. Taillard, Parallel iterative search methods for vehicle routing problems. Networks, p.661673, 2005.

E. G. Talbi, A taxonomy of hybrid metaheuristics, Journal of Heuristics, vol.8, issue.5, p.541564, 2002.

K. C. Tan, Y. H. Chew, and L. H. Lee, A hybrid multiobjective genetic algorithms for vehicle routing problem with time windows, Computational Optimization and Applications, vol.34, p.115151, 2006.

X. Tan, X. Luo, W. N. Chen, and J. Zhang, Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows (VRPTW), Proceedings of the 2005 International Conference CIMCA-IAWTIC 05, 2005.
DOI : 10.1007/11816102_4

C. D. Tarantilis and C. T. Kiranoudis, Boneroute : an adaptative memory-based maethod for eective eet management, Annals of operations Research, vol.115, issue.1, p.227241, 2002.

J. Teixeira, A. P. Antunes, and J. P. De-sousa, Recyclable waste collection planning??????a case study, European Journal of Operational Research, vol.158, issue.3, p.543554, 2004.
DOI : 10.1016/S0377-2217(03)00379-5

P. M. Thompson and H. N. Psaraftis, Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems, Operations Research, vol.41, issue.5, p.935946, 1993.
DOI : 10.1287/opre.41.5.935

P. Toth and D. Vigo, The vehicle routing problem, Society for Industrial and Applied Mathematics Philadelphia, 2001.
DOI : 10.1137/1.9780898718515
URL : https://hal.archives-ouvertes.fr/hal-01223571

P. Toth and D. Vigo, The Granular Tabu Search and Its Application to the Vehicle-Routing Problem, INFORMS Journal on Computing, vol.15, issue.4, p.333346, 2003.
DOI : 10.1287/ijoc.15.4.333.24890

D. V. Tung and A. Pinnoi, Vehicle routing???scheduling for waste collection in Hanoi, European Journal of Operational Research, vol.125, issue.3, p.449468, 2000.
DOI : 10.1016/S0377-2217(99)00408-7

G. Verfaillie and N. Jussien, Constraint Solving in Uncertain and Dynamic Environments: A Survey, Constraints, vol.10, issue.5, p.253281, 2005.
DOI : 10.1007/s10601-005-2239-9
URL : https://hal.archives-ouvertes.fr/hal-00293900

S. Voss, S. Martello, I. H. Osman, and C. , Meta-heuristics -advance and trends in local search paradigms for optimization, 1999.

P. Wark and J. Holt, A repeated matching heuristic for the vehicle routing problem, Operational Research Society, vol.45, p.11561167, 1994.

H. Xu, W. Fan, T. Wei, and L. Yu, An Or-opt NSGA-II algorithm for multi-objective Vehicle Routing Problem with Time Windows, 2008 IEEE International Conference on Automation Science and Engineering, 2008.
DOI : 10.1109/COASE.2008.4626505

P. C. Yellow, A computational modication to the savings method of vehicle scheduling, Operational Research Quarterly, vol.12, p.281283, 1970.

L. Zeng, H. L. Ong, and K. M. Ng, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, Asia-Pacific Journal of Operational Research, vol.22, issue.01, p.84104, 2005.
DOI : 10.1142/S0217595905000479