R. K. Ahuja, D. S. Hochbaum, and J. B. Orlin, Solving the Convex Cost Integer Dual Network Flow Problem, Management Science, vol.49, issue.7, pp.950-964, 2003.
DOI : 10.1287/mnsc.49.7.950.16384

M. M. Akbar, M. S. Rahman, M. Kaykobad, E. G. Manning, and G. C. Shoja, Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls, Computers & Operations Research, vol.33, issue.5, pp.1259-1273, 2004.
DOI : 10.1016/j.cor.2004.09.016

R. Baldacci, L. Bodin, and A. Mingozzi, The multiple disposal facilities and multiple inventory locations rollon???rolloff vehicle routing problem, Computers & Operations Research, vol.33, issue.9, pp.2667-2702, 2006.
DOI : 10.1016/j.cor.2005.02.023

J. E. Beasley and N. Christofides, An algorithm for the resource constrained shortest path problem, Networks, vol.17, issue.4, pp.379-394, 1989.
DOI : 10.1002/net.3230190402

R. Bent and P. Van-henteryck, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Computers & Operations Research
DOI : 10.1016/j.cor.2004.08.001

M. Bielli, A. Boulmakoul, and H. Mouncif, Object modeling and path computation for multimodal travel systems, European Journal of Operational Research, vol.175, issue.3, pp.1705-1730, 2006.
DOI : 10.1016/j.ejor.2005.02.036

A. Colorni, M. Dorigo, F. Maffioli, V. Maniezzo, G. Righini et al., Heuristics from Nature for Hard Combinatorial Optimization Problems, International Transactions in Operational Research, vol.2, issue.3, pp.1-21, 1996.
DOI : 10.1088/0954-898X/1/1/007

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

J. 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, pp.89-101, 2003.
DOI : 10.1007/s10288-002-0009-8

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

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

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

G. Desaulniers, J. Desrosiers, A. Erdmann, M. M. Solomon, and F. Soumis, 9. VRP with Pickup and Delivery, The Vehicle Routing Problem, pp.225-242, 2002.
DOI : 10.1137/1.9780898718515.ch9

M. Desrochers and F. Soumis, A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows, INFOR: Information Systems and Operational Research, vol.26, issue.3, pp.191-212, 1988.
DOI : 10.1080/03155986.1988.11732063

J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis, Time constrained routing and scheduling
DOI : 10.1016/s0927-0507(05)80106-9

Y. Dumas, J. Desrosiers, and F. Soumis, Large scale multi-vehicle dial-aride systems, GERAD, Ecole des Hautes Etudes Commerciales, pp.89-119, 1989.

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. Ehrgott and X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spectrum, vol.22, issue.4, pp.425-460, 2000.
DOI : 10.1007/s002910000046
URL : https://hal.archives-ouvertes.fr/hal-00462047

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.35, issue.3, pp.216-229, 2004.
DOI : 10.1002/net.20033

F. Guerriero and R. Musmanno, Label Correcting Methods to Solve Multicriteria Shortest Path Problems, Journal of Optimization Theory and Applications, vol.20, issue.3, pp.589-613, 2001.
DOI : 10.1023/A:1012602011914

G. Gutin and A. P. Punnen, The Traveling Salesman Problem and its variations, 2002.
DOI : 10.1007/b101971

M. Hifi, M. Michrafy, and A. Sbihi, A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem, Computational Optimization and Applications, vol.21, issue.3, pp.271-285, 2006.
DOI : 10.1007/s10589-005-3057-0
URL : https://hal.archives-ouvertes.fr/hal-00125573

M. E. Horn, Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems, Transportation Research Part A: Policy and Practice, vol.36, issue.2, pp.167-188, 2002.
DOI : 10.1016/S0965-8564(00)00043-4

M. E. Horn, An extended model and procedural framework for planning multi-modal passenger journeys, Transportation Research Part B: Methodological, vol.37, issue.7, pp.641-660, 2003.
DOI : 10.1016/S0191-2615(02)00043-7

S. Irnich and G. Desaulniers, Shortest Path Problems with Resource Constraints, Column generation, pp.33-66, 2005.
DOI : 10.1007/0-387-25486-2_2

J. J. Jaw, A. R. Odoni, H. N. Psaraftis, and N. H. 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

R. M. Jørgensen, J. Larsen, and K. B. Bergvinsdottir, Solving the dial-aride problem using genetic algorithms

D. Josselin and C. Genre-grandpierre, Des transportsàtransports`transportsà la demande pour répondre aux nouvelles formes de mobilité

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack problems, 2004.
DOI : 10.1007/978-3-540-24777-7

H. Li and A. Lim, A metaheuristic for the pickup and delivery problem with time windows, ICTAI 2001, pp.160-170, 2001.

Q. Lu and M. M. Dessouky, An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem, Transportation Science, vol.38, issue.4, pp.503-514, 2004.
DOI : 10.1287/trsc.1030.0040

O. B. Madsen, H. R. Ravn, and J. M. 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

E. Melachrinoudisa, A. B. Ilhan, and H. Min, A dial-a-ride problem for client transportation in a health-care organization, Computers & Operations Research, vol.34, issue.3, pp.742-759, 2007.
DOI : 10.1016/j.cor.2005.03.024

B. Rekiek, A. Delchambre, and H. A. Saleh, Handicapped Person Transportation: An application of the Grouping Genetic Algorithm, Engineering Applications of Artificial Intelligence, vol.19, issue.5, pp.511-520, 2006.
DOI : 10.1016/j.engappai.2005.12.013

S. Ropke, Heuristic and exact algorithms for vehicle routing problems, 2005.

S. Ropke, J. Cordeau, and G. Laporte, Models and branch-and-cut algorithm for pick-up and delivery problems with time windows

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

M. W. 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

A. Sbihi, Les méthodes hybrides en optimisation combinatoire : algorithmes exacts et heuristiques, 2003.

T. Sexton and L. D. 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. D. 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

A. J. Skriver and K. A. Andersen, A label correcting approach for solving bicriterion shortest-path problems, Computers & Operations Research, vol.27, issue.6, pp.507-524, 2000.
DOI : 10.1016/S0305-0548(99)00037-4

P. Toth and D. Vigo, Fast local search algorithms for the handicapped capacity or time window constraints. An arc from a service of the request i (i + or i ? ) to a service of the request j (j + or j ? ) has to be used in a valid sequence arranging requests i and j. Six such sequences exist