R. Du and D. , 158 3.1. La solution, Contrainte temporelle supplémentaire

L. Lilas, Available from

. Mobility, Mobility carsharing. [Internet] Available from

. Citycarclub, City car club ? your monitoring solution Available from: http://www.citycarclub.info. 4 PRAXITELE

. Autolib, Mondial 2008 -des nouvelles d'autolib. [Internet] Available from

. Zipcar, Zipcar offers a new model for automobile transportation

. Communauto and . La-lettre-de-l-'autpartage, [Internet] Available from

. Benoît-r, Histore de l'autopartage. [Internet] Available from

H. Psaraftis, Dynamic vehicle routing: Status and prospects, Annals of Operations Research, vol.26, issue.10, pp.143-164, 1995.
DOI : 10.1007/BF02098286

URL : http://dspace.lib.ntua.gr/handle/123456789/11504

S. Ropke and D. Pisinger, A unified heuristic for a large class of Vehicle Routing Problems with Backhauls, European Journal of Operational Research, vol.171, issue.3, pp.750-775, 2006.
DOI : 10.1016/j.ejor.2004.09.004

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, 1979.

S. Anily and R. Hassin, The swapping problem, Networks, vol.117, issue.4, pp.419-433, 1992.
DOI : 10.1002/net.3230220408

P. Chalasani and R. Motwani, Approximating Capacitated Routing and Delivery Problems, SIAM Journal on Computing, vol.28, issue.6, pp.2133-2149, 1999.
DOI : 10.1137/S0097539795295468

S. Anily, M. Gendreau, and G. Laporte, The Swapping Problem on a Line, SIAM Journal on Computing, vol.29, issue.1, pp.327-335, 1999.
DOI : 10.1137/S0097539797323108

G. Erdo?an, J. Cordeau, and G. Laporte, A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem, Discrete Applied Mathematics, vol.158, issue.15, pp.2008-2052, 2008.
DOI : 10.1016/j.dam.2010.05.025

C. Bordenave, M. Gendreau, and G. Laporte, Heuristics for the mixed swapping problem, Computers & Operations Research, vol.37, issue.1, pp.108-114, 2010.
DOI : 10.1016/j.cor.2009.03.032

H. Hernández-pérez and J. Salazar-gonzález, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Discrete Applied Mathematics, vol.145, issue.1, pp.126-139, 2004.
DOI : 10.1016/j.dam.2003.09.013

E. Balas and M. Padberg, Set Partitioning: A survey, SIAM Review, vol.18, issue.4, pp.710-760, 1976.
DOI : 10.1137/1018115

H. Hernández-pérez and J. Salazar-gonzález, Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem, Transportation Science, vol.38, issue.2, pp.245-255, 2004.
DOI : 10.1287/trsc.1030.0086

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

D. Johnson, L. Mcgeoch, E. Aarts, and J. Lenstra, The traveling salesman problem: a case study in local optimization Local search in combinatorial optimization, pp.215-310, 1997.

H. Hernández-pérez, I. Rodriguez-martin, and J. Salazar-gonzález, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Computers & Operations Research, vol.36, issue.5, pp.1639-1645, 2009.
DOI : 10.1016/j.cor.2008.03.008

F. , L. S. Sun, J. Mei, and D. , Genetic algorithm for the one-commodity pickup-anddelivery traveling salesman problem, Computers and Industrial Engineering archive, vol.56, issue.4, pp.1642-1648, 2009.

S. Anily and J. Bramel, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Naval Research Logistics, vol.2, issue.6, pp.654-670, 1999.
DOI : 10.1002/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A

I. Gribkovskaia, Ø. Halskau, G. Laporte, and M. Vlcek, General solutions to the single vehicle routing problem with pickups and deliveries, European Journal of Operational Research, vol.180, issue.2, pp.568-584, 2007.
DOI : 10.1016/j.ejor.2006.05.009

J. Cordeau, G. Laporte, and A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows, Journal of the Operational Research Society, vol.52, issue.8, pp.928-936, 2001.
DOI : 10.1057/palgrave.jors.2601163

S. Anily, The vehicle-routing problem with delivery and back-haul options, Naval Research Logistics, vol.43, issue.3, pp.415-434, 1996.
DOI : 10.1002/(SICI)1520-6750(199604)43:3<415::AID-NAV7>3.0.CO;2-C

H. Min, The multiple vehicle routing problem with simultaneous delivery and pick-up points, Transportation Research Part A: General, vol.23, issue.5, pp.377-386, 1989.
DOI : 10.1016/0191-2607(89)90085-X

M. Anderberg, Cluster analysis for applications, 1973.

G. Nagy and S. Salhi, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, European Journal of Operational Research, vol.162, issue.1, pp.126-141, 2005.
DOI : 10.1016/j.ejor.2002.11.003

J. Chen and T. Wu, Vehicle routing problem with simultaneous deliveries and pickups, J Oper Res Soc, pp.579-587, 2006.

G. Dueck, New Optimization Heuristics, Journal of Computational Physics, vol.104, issue.1, pp.86-92, 1993.
DOI : 10.1006/jcph.1993.1010

N. Bianchessi and G. Righini, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Computers & Operations Research, vol.34, issue.2, pp.578-594, 2007.
DOI : 10.1016/j.cor.2005.03.014

F. Montané and R. Galvão, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Comput Oper Res, pp.595-619, 2006.

I. Deif and L. Bodin, Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling, Kidder A. Proceedings of the Babson conference on software uses in transportation and logistic management, 1984.

G. Clarke and J. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper Res, pp.568-581, 1964.

P. Toth and D. Vigo, A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls, European Journal of Operational Research, vol.113, issue.3, pp.528-543, 1999.
DOI : 10.1016/S0377-2217(98)00086-1

P. Toth, D. Vigo, P. Vrp-with-backhauls-toth, and D. Vigo, The vehicle routing problem, Philadelphia: SIAM, pp.195-224, 2002.
DOI : 10.1137/1.9780898718515

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

I. Osman and N. Wassan, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, Journal of Scheduling, vol.11, issue.4, pp.263-285, 2002.
DOI : 10.1002/jos.122

J. Brandão, A new tabu search algorithm for the vehicle routing problem with backhauls, European Journal of Operational Research, vol.173, issue.2, pp.540-555, 2006.
DOI : 10.1016/j.ejor.2005.01.042

S. Gélinas, M. Desrochers, and J. Desrosiers, A new branching strategy for time constrained routing problems with application to backhauling, Annals of Operations Research, vol.17, issue.1, pp.91-109, 1995.
DOI : 10.1007/BF02098283

J. Potvin, C. Duhamel, and F. Guertin, A genetic algorithm for vehicle routing with backhauling, Applied Intelligence, vol.41, issue.4, pp.341-351, 1996.
DOI : 10.1007/BF00132738

C. Duhamel, J. Potvin, and J. Rousseau, A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows, Transportation Science, vol.31, issue.1, pp.49-59, 1997.
DOI : 10.1287/trsc.31.1.49

S. Thangiah, J. Potvin, and T. Sun, Heuristic approaches to vehicle routing with backhauls and time windows. Computers & operations research, pp.1043-1057, 1996.

J. Chisman, The clustered traveling salesman problem, Computers & Operations Research, vol.2, issue.2, pp.115-119, 1975.
DOI : 10.1016/0305-0548(75)90015-5

M. Gendreau, A. Hertz, and G. Laporte, The Traveling Salesman Problem with Backhauls, Computers & Operations Research, vol.23, issue.5, pp.501-508, 1996.
DOI : 10.1016/0305-0548(95)00036-4

M. Gendreau, A. Hertz, and G. Laporte, New Insertion and Postoptimization Procedures for the Traveling Salesman Problem, Operations Research, vol.40, issue.6, pp.1086-1094, 1992.
DOI : 10.1287/opre.40.6.1086

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

H. Ghaziri and I. Osman, A neural network algorithm for the traveling salesman problem with backhauls, Computers & Industrial Engineering, vol.44, issue.2, pp.267-281, 2003.
DOI : 10.1016/S0360-8352(02)00179-1

T. Kohonen, Self-organized formation of topologically correct feature maps, Biological Cybernetics, vol.13, issue.1, pp.59-69, 1995.
DOI : 10.1007/BF00337288

M. Gendreau, G. Laporte, and D. Vigo, Heuristics for the traveling salesman problem with pickup and delivery. Computers & operations research, pp.699-714, 1999.

N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Research report, vol.388, 1976.

R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi, An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections, Networks, vol.47, issue.1, pp.26-41, 2003.
DOI : 10.1002/net.10079

G. Frederickson, M. Hecht, and C. Kim, Approximation Algorithms for Some Routing Problems, SIAM Journal on Computing, vol.7, issue.2, pp.178-193, 1978.
DOI : 10.1137/0207017

G. Frederickson, Nonpreemptive Ensemble Motion Planning on a Tree, Journal of Algorithms, vol.15, issue.1, pp.29-60, 1993.
DOI : 10.1006/jagm.1993.1029

M. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research, vol.1, issue.1, pp.285-305, 1985.
DOI : 10.1007/BF02022044

Y. Dumas, J. Desrosiers, and F. Soumis, The pickup and delivery problem with time windows, European Journal of Operational Research, vol.54, issue.1, pp.7-22, 1991.
DOI : 10.1016/0377-2217(91)90319-Q

M. Savelsbergh and M. Sol, Drive: Dynamic Routing of Independent Vehicles, Operations Research, vol.46, issue.4, pp.474-490, 1998.
DOI : 10.1287/opre.46.4.474

H. Xu, Z. Chen, S. Rajagopal, and S. Arunapuram, Solving a Practical Pickup and Delivery Problem, Transportation Science, vol.37, issue.3, pp.347-364, 2003.
DOI : 10.1287/trsc.37.3.347.16044

S. Ropke and J. Cordeau, Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transportation science, pp.267-286, 2009.

J. Cordeau, A Branch-and-Cut Algorithm for the Dial-a-Ride Problem, Operations Research, vol.54, issue.3, pp.573-586, 2006.
DOI : 10.1287/opre.1060.0283

R. Battiti and G. Tecchiolli, The Reactive Tabu Search, ORSA Journal on Computing, vol.6, issue.2, pp.126-140, 1994.
DOI : 10.1287/ijoc.6.2.126

W. Nanry and J. Barnes, Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B: Methodological, vol.34, issue.2, pp.107-121, 2000.
DOI : 10.1016/S0191-2615(99)00016-8

D. Stein, An Asymptotic, Probabilistic Analysis of a Routing Problem, Mathematics of Operations Research, vol.3, issue.2, pp.89-101, 1978.
DOI : 10.1287/moor.3.2.89

H. Psaraftis, Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem, Transportation Research Part B: Methodological, vol.17, issue.2, pp.133-145, 1983.
DOI : 10.1016/0191-2615(83)90041-3

H. Psaraftis, An exact algorithm for the single-vehicle, many-to-many dial-a-ride problem with time windows. Transportation science, pp.351-357, 1983.

J. Desrosiers, Y. Dumas, and F. Soumis, A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows, American Journal of Mathematical and Management Sciences, vol.10, issue.4, pp.3-4301, 1986.
DOI : 10.1080/01966324.1986.10737198

B. Kalantari, A. Hill, and S. Arora, An algorithm for the traveling salesman problem with pickup and delivery customers, European Journal of Operational Research, vol.22, issue.3, pp.377-386, 1985.
DOI : 10.1016/0377-2217(85)90257-7

J. Little, K. Murty, D. Sweeney, and C. Karel, An Algorithm for the Traveling Salesman Problem, Operations Research, vol.11, issue.6, pp.972-989, 1963.
DOI : 10.1287/opre.11.6.972

K. Ruland and E. Rodin, The pickup and delivery problem: Faces and branch-and-cut algorithm, Computers & Mathematics with Applications, vol.33, issue.12, pp.1-33, 1997.
DOI : 10.1016/S0898-1221(97)00090-4

D. Bruggen, L. Lenstra, J. Schuur, and P. , Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows, Transportation Science, vol.27, issue.3, pp.298-311, 1993.
DOI : 10.1287/trsc.27.3.298

A. Landrieu, Y. Mati, and Z. Binder, A tabu search heuristic for the single vehicle pickup and delivery problem with time windows, Journal of Intelligent Manufacturing, vol.12, issue.5/6, pp.497-508, 2001.
DOI : 10.1023/A:1012204504849

J. Pacheco, Heurístico para los problemas de rutas con carga y descarga en sistemas LIFO, Qüestiió, vol.21, pp.153-175, 1997.

F. Carrabs, J. Cordeau, and G. Laporte, Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading, INFORMS Journal on Computing, vol.19, issue.4, pp.618-632, 2006.
DOI : 10.1287/ijoc.1060.0202

J. Cordeau, M. Iori, G. Laporte, and J. Salazar-gonzález, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading, Networks, vol.37, issue.1, pp.46-59, 2010.
DOI : 10.1002/net.20312

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, issue.6, pp.579-594, 2003.
DOI : 10.1016/S0191-2615(02)00045-0

T. Sexton and L. Bodin, Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling, Transportation Science, vol.19, issue.4, pp.378-410, 1985.
DOI : 10.1287/trsc.19.4.378

T. Sexton and L. Bodin, Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing, Transportation Science, vol.19, issue.4, pp.411-435, 1985.
DOI : 10.1287/trsc.19.4.411

J. Jaw, A. Odoni, H. Psaraftis, and N. Wilson, A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transportation Research Part B: Methodological, vol.20, issue.3, pp.243-257, 1986.
DOI : 10.1016/0191-2615(86)90020-2

F. Cullen, J. Jarvis, and H. Ratliff, Set partitioning based heuristics for interactive routing, Networks, vol.25, issue.2, pp.125-143, 1981.
DOI : 10.1002/net.3230110206

S. Roy, L. Chapleau, J. Ferland, G. Lapalme, and J. Rousseau, The construction of routes and schedules for the transportation of the handicapped. Working paper, 1983.

L. Bodin and T. Sexton, The Multi-Vehicle Subscriber Dial-a-Ride Problem, TIMS Studies in the Management Sciences, vol.22, pp.73-86, 1986.

S. Ropke, J. Cordeau, and G. Laporte, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, vol.46, issue.4, pp.258-272, 2007.
DOI : 10.1002/net.20177

C. Cortés, M. Matamala, and C. Contardo, The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method, European Journal of Operational Research, vol.200, issue.3, pp.711-724, 2010.
DOI : 10.1016/j.ejor.2009.01.022

S. Mitrovic-minic and G. Laporte, The Pickup And Delivery Problem With Time Windows And Transshipment, INFOR: Information Systems and Operational Research, vol.44, issue.3, pp.217-227, 2006.
DOI : 10.1080/03155986.2006.11732749

W. Powell, B. Bouzaiene-ayari, H. Simao, C. Barnhart, and G. Laporte, Dynamic models for freight transportation Handbooks in Operations Research and Management Science: Transportation, pp.285-365, 2007.

W. Powell, An operational planning model for the dynamic vehicle allocation problem with uncertain demands, Transportation Research Part B: Methodological, vol.21, issue.3, pp.217-232, 1987.
DOI : 10.1016/0191-2615(87)90005-1

W. Powell, Y. Sheffi, K. Nickerson, K. Butterbaugh, and S. Atherton, Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and Operations, Interfaces, vol.18, issue.1, pp.21-41, 1988.
DOI : 10.1287/inte.18.1.21

J. Yang, P. Jaillet, and M. H. , On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information, Transportation Research Record: Journal of the Transportation Research Board, vol.1667, pp.107-113, 1998.
DOI : 10.3141/1667-13

D. Tjokroamidjojo, E. Kutanoglu, and G. Taylor, Quantifying the value of advance load information in truckload trucking, Transportation Research Part E: Logistics and Transportation Review, vol.42, issue.4, pp.340-357, 2006.
DOI : 10.1016/j.tre.2005.01.001

M. Mes, M. Van-der-heijden, and A. Van-harten, Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems, European Journal of Operational Research, vol.181, issue.1, pp.59-75, 2007.
DOI : 10.1016/j.ejor.2006.02.051

K. Gutenschwager, C. Niklaus, and S. Vob, Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem, Transportation Science, vol.38, issue.4, pp.434-446, 2004.
DOI : 10.1287/trsc.1030.0066

M. Swihart and J. Papastavrou, A stochastic and dynamic model for the single-vehicle pick-up and delivery problem, European Journal of Operational Research, vol.114, issue.3, pp.447-464, 1999.
DOI : 10.1016/S0377-2217(98)00260-4

H. Waisanen, D. Shah, and M. Dahleh, A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints, IEEE Transactions on Automatic Control, vol.53, issue.6, pp.1419-1433, 2008.
DOI : 10.1109/TAC.2008.925849

H. Waisanen, D. Shah, and M. Dahleh, Fundamental performance limits for multi stage vehicle routing problems, 2009.

S. Mitrovic-minic and G. Laporte, Waiting strategies for the dynamic pickup and delivery problem with time windows, Transportation Research Part B: Methodological, vol.38, issue.7, pp.635-655, 2004.
DOI : 10.1016/j.trb.2003.09.002

M. Gendreau, F. Guertin, J. Potvin, and R. Seguin, Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation research, Part C, vol.14, issue.3, pp.157-174, 2006.

J. Branke, M. Middendorf, G. Noeth, and M. Dessouky, Waiting Strategies for Dynamic Vehicle Routing, Transportation Science, vol.39, issue.3, pp.298-312, 2005.
DOI : 10.1287/trsc.1040.0095

C. Saez, C. Cortés, and A. Nunez, Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering, Computers & Operations Research, vol.35, issue.11, pp.3412-3438, 2008.
DOI : 10.1016/j.cor.2007.01.025

G. Ghiani, E. Manni, A. Quaranta, and C. Triki, Anticipatory algorithms for same-day courier dispatching, Transportation Research Part E: Logistics and Transportation Review, vol.45, issue.1, pp.96-106, 2009.
DOI : 10.1016/j.tre.2008.08.003

P. Hentenryck, . Van, and R. Bent, Online stochastic combinatorial optimization, Operations Research, vol.52, pp.977-987, 2004.

J. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.174, issue.1, pp.29-46, 2007.
DOI : 10.1007/s10479-007-0170-8

H. Psaraftis, A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem, Transportation Science, vol.14, issue.2, pp.130-154, 1980.
DOI : 10.1287/trsc.14.2.130

O. Madsen, H. Ravn, and J. Rygaard, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Annals of Operations Research, vol.12, issue.1, pp.193-208, 1995.
DOI : 10.1007/BF02031946

M. Horn, Fleet scheduling and dispatching for demand-responsive passenger services, Transportation Research Part C: Emerging Technologies, vol.10, issue.1, pp.35-63, 2002.
DOI : 10.1016/S0968-090X(01)00003-1

A. Attanasio, J. Cordeau, G. Ghiani, and G. Laporte, Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem, Parallel Computing, vol.30, issue.3, pp.377-387, 2004.
DOI : 10.1016/j.parco.2003.12.001

L. Coslovich, R. Pesenti, and W. Ukovich, A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem, European Journal of Operational Research, vol.175, issue.3, pp.1605-1615, 2006.
DOI : 10.1016/j.ejor.2005.02.038

A. Beaudry, G. Laporte, T. Melo, and S. Nickel, Dynamic transportation of patients in hospitals, OR Spectrum, vol.5, issue.1, pp.1-31, 2008.
DOI : 10.1007/s00291-008-0135-6

Z. Xiang, C. Chu, and H. Chen, The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, European Journal of Operational Research, vol.185, issue.2, pp.534-551, 2008.
DOI : 10.1016/j.ejor.2007.01.007

J. Cordeau, G. Laporte, J. Potvin, and M. Savelsbergh, Transportation on demand In: Transportation, editor. Handbooks in Operations Research and Management Science, pp.429-466, 2007.

J. Desrosiers, Y. Dumas, and F. Soumis, The multiple vehicle dial-a-ride problem. Computer- Aided Transit Scheduling, Lecture Notes in Economics and Mathematical System, vol.308, pp.15-27, 1988.

J. Baugh, G. Kakivaya, and J. Stone, INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALING, Engineering Optimization, vol.6, issue.2, pp.91-123, 1998.
DOI : 10.1016/0305-0548(83)90030-8

P. Toth and D. Vigo, Heuristic Algorithms for the Handicapped Persons Transportation Problem, Transportation Science, vol.31, issue.1, pp.60-71, 1997.
DOI : 10.1287/trsc.31.1.60

S. Hart, The modeling and solution of a class of dial-a-ride problems using simulated annealing, Control and Cybernetics, vol.25, pp.131-157, 1996.

P. Toth and D. Vigo, Fast Local Search Algorithms for the Handicapped Persons Transportation Problem, Meta-Heuristics: Theory and Applications, pp.677-690, 1996.
DOI : 10.1007/978-1-4613-1361-8_41

S. Kikuchi and J. Rhee, Scheduling Method for Demand???Responsive Transportation System, Journal of Transportation Engineering, vol.115, issue.6, pp.630-645, 1989.
DOI : 10.1061/(ASCE)0733-947X(1989)115:6(630)

J. Potvin and J. Rousseau, Constraint-directed search for the advanced request dial-a-ride problem with service quality constraint. Computer Science and Operations Research: New Developments in Their Interfaces, pp.457-474, 1992.

M. Diana and M. Dessouky, A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows, Transportation Research Part B: Methodological, vol.38, issue.6, pp.539-557, 2004.
DOI : 10.1016/j.trb.2003.07.001

M. Dessouky, M. Rahimi, and M. Weidner, Jointly optimizing cost, service, and environmental performance in demand-responsive transit scheduling, Transportation Research Part D: Transport and Environment, vol.8, issue.6, pp.433-465, 2003.
DOI : 10.1016/S1361-9209(03)00043-9

L. Fu, Scheduling dial-a-ride paratransit under time-varying, stochastic congestion, Transportation Research Part B: Methodological, vol.36, issue.6, pp.485-506, 2002.
DOI : 10.1016/S0191-2615(01)00014-5

A. Campbell and M. Savelsbergh, Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems, Transportation Science, vol.38, issue.3, pp.369-378, 2004.
DOI : 10.1287/trsc.1030.0046

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

M. Dessouky and D. J. , A new regret insertion heuristic for solving largescale dial-a-ride problems with time windows, Transportation research Part B, vol.38, pp.539-557, 2004.

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

R. Jorgensen, J. Larsen, and K. Bergvinsdottir, Solving the Dial-a-Ride problem using genetic algorithms, Journal of the Operational Research Society, vol.20, issue.3, pp.1321-1331, 2007.
DOI : 10.1016/0191-2615(86)90020-2

J. Beasley, Route first???Cluster second methods for vehicle routing, Omega, vol.11, issue.4, pp.403-411, 1983.
DOI : 10.1016/0305-0483(83)90033-6

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.
DOI : 10.1016/S0305-0548(03)00158-8

P. Lacomme, C. Prins, and W. Ramdane-chérif, A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions, Proceedings of the EvoWorkshops on Applications of Evolutionary Computing, pp.473-483, 2001.
DOI : 10.1007/3-540-45365-2_49

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

P. Lacomme, C. Prins, and W. Ramdane-chérif, Competitive memetic algorithms for arc routing problems. Annals of Operations Research, pp.159-85, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00119814

P. Lacomme, C. Prins, and M. Sevaux, Multi-objective capacitated arc routing problem Evolutionary multi-criterion optimization. Lecture Notes in Computer Science ed, pp.550-64, 2003.

C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon, A memetic approach for the capacitated location routing problem, 2008.

S. Merz and P. , 134 Evolutionary local search for the minimum energy broadcast problem, Proceedings of the Eighth European Conference on Evolutionary Computation in Combinatorial Optimization, pp.61-72, 2008.

C. Artigues, P. Michelon, and S. Reusser, Insertion techniques for static and dynamic resource-constrained project scheduling, European Journal of Operational Research, vol.149, issue.2, pp.249-267, 2003.
DOI : 10.1016/S0377-2217(02)00758-0