I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck, A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks, Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'11), pp.376-387, 2010.
DOI : 10.1007/978-3-642-20662-7_20

I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck, Hierarchical Hub Labelings for Shortest Paths, Proceedings of the 20th Annual European Symposium of Algorithms (ESA'12), pp.24-35, 2012.
DOI : 10.1007/978-3-642-33090-2_4

I. Abraham, A. Fiat, A. V. Goldberg, and R. Werneck, Highway Dimension, Shortest Paths, and Provably Efficient Algorithms, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10), SODA, pp.782-793, 2010.

R. Ahuja, J. Orlin, S. Pallottino, and M. G. , Dynamic shortest paths minimizing travel times and costs, Networks, vol.30, issue.4, pp.197-205, 2003.
DOI : 10.1002/net.10072

C. Artigues, M. Huguet, F. Gueye, F. Schettini, and L. Dezou, State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths, Transportation Research Part C: Emerging Technologies, vol.27, pp.233-259, 2013.
DOI : 10.1016/j.trc.2012.08.003

C. L. Barrett, K. R. Bisset, M. Holzer, G. Konjevod, M. Marathe et al., Engineering label-constrained shortest-path algorithms. The Shortest Path Problem: Ninth Dimacs Implementation Challenge, pp.309-327, 2009.

C. L. Barrett, K. R. Bisset, R. Jacob, G. Konjevod, and M. V. Marath, Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router, European Symposium on Algorithms (ESA), volume 2461 of Lecture Notes in Computer Science, pp.126-138, 2002.
DOI : 10.1007/3-540-45749-6_15

C. L. Barrett, R. Jacob, and M. Marathe, Formal-Language-Constrained Path Problems, SIAM Journal on Computing, vol.30, issue.3, pp.809-837, 2000.
DOI : 10.1137/S0097539798337716

H. Bast, Car or public transport -two worlds. Efficient Algorithms, pp.355-367, 2009.
DOI : 10.1007/978-3-642-03456-5_24

H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, C. Harrelson et al., Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns, Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10), pp.290-301
DOI : 10.1007/978-3-642-15775-2_25

H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes, In Transit to Constant Time Shortest-Path Queries in Road Networks, Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (Alenex'07), pp.46-59, 2007.
DOI : 10.1137/1.9781611972870.5

H. Bast, S. Funke, P. Sanders, and D. Schultes, Fast Routing in Road Networks with Transit Nodes, Science, vol.316, issue.5824, p.316566, 2007.
DOI : 10.1126/science.1137521

G. Batz, R. Geisberger, S. Neubauer, and P. Sanders, Time-Dependent Contraction Hierarchies and Approximation, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), pp.166-177, 2010.
DOI : 10.1007/978-3-642-13193-6_15

G. V. Batz, D. Delling, P. Sanders, and C. Vetter, Time-Dependent Contraction Hierarchies, Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09), ALENEX, pp.97-105
DOI : 10.1137/1.9781611972894.10

R. Bauer and D. Delling, SHARC, Journal of Experimental Algorithmics, vol.14, pp.2-4, 2009.
DOI : 10.1145/1498698.1537599

R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes et al., Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra???s Algorithm
DOI : 10.1007/978-3-540-68552-4_23

R. Bauer, D. Delling, and D. Wagner, Experimental study of speed up techniques for timetable information systems, Networks, vol.10, issue.1, pp.38-52, 2011.
DOI : 10.1002/net.20382

M. Beckmann, C. B. Mcguire, and C. B. Winsten, Studies in the Economics of Transportation, 1956.

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, 1956.
DOI : 10.1090/qam/102435

J. L. Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, vol.18, issue.9, pp.509-517, 1975.
DOI : 10.1145/361002.361007

G. Berbeglia, J. Cordeau, and G. Laporte, Dynamic pickup and delivery problems, European Journal of Operational Research, vol.202, issue.1, pp.8-15, 2010.
DOI : 10.1016/j.ejor.2009.04.024
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.900

A. Berger, D. Delling, A. Gebhardt, and M. Müller-hannemann, Accelerating timedependent multi-criteria timetable information is harder than expected Bergvinsdottir. The genetic algorithm for solving the dial-a-ride problem, Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09), volume 12 of ATMOS. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2004.

A. Bousquet, S. Constans, and E. F. Nour-eddin, On the adaptation of a labelsetting shortest path algorithm for one-way and two-way routing in multimodal urban transport networks, International Network Optimisation Conference, 2009.

L. S. Buriol, M. G. Resende, and M. Thorup, Speeding Up Dynamic Shortest-Path Algorithms, INFORMS Journal on Computing, vol.20, issue.2, pp.191-204, 2008.
DOI : 10.1287/ijoc.1070.0231
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.9245

I. Chabini, Discrete dynamic shortest path problems in transportation applications : Complexity and algorithms with optimal run time. Transportation research records, pp.170-175, 1998.

K. Cooke and E. Halsey, The shortest route through a network with time-dependent internodal transit times, Journal of Mathematical Analysis and Applications, vol.14, issue.3, pp.493-498, 1966.
DOI : 10.1016/0022-247X(66)90009-6

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

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, pp.29-46, 2007.
DOI : 10.1007/s10479-007-0170-8

G. B. Dantzig, Linear Programming and Extensions, 1962.
DOI : 10.1515/9781400884179

B. Dean, Continuous-time dynamic shortest path algorithms, 1999.

D. Delling, Time-Dependent SHARC-Routing, Algorithmica, vol.37, issue.3, pp.60-94, 2011.
DOI : 10.1007/s00453-009-9341-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.541.7598

D. Delling, J. Dibbelt, T. Pajor, D. Wagner, and R. F. Werneck, Computing Multimodal Journeys in Practice, Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), Lecture Nodes in Computer Science, 2013.
DOI : 10.1007/978-3-642-38527-8_24

D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck, Customizable Route Planning, Proceedings of the 19th International Symposium on Experimental Algorithms (SEA'11), pp.376-387, 2011.
DOI : 10.1007/978-3-642-20662-7_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.661.6474

D. Delling and G. Nannicini, Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks, Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08), volume 5369 of Lecture Nodes in Computer Science, pp.812-823
DOI : 10.1007/978-3-540-92182-0_71

D. Delling, T. Pajor, and D. Wagner, Accelerating Multi-modal Route Planning by Access-Nodes, Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), pp.587-598, 2009.
DOI : 10.1007/978-3-642-04128-0_53

D. Delling, T. Pajor, and D. Wagner, Engineering time-expanded graphs for faster timetable information. Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, pp.182-206, 2009.

D. Delling, T. Pajor, and R. Werneck, Round-based public transit routing, Proceedings of the 2012 Meeting on Algorithm Engineering and Experiments (ALENEX'12), ALENEX, pp.130-140, 2012.

D. Delling, P. Sanders, D. Schultes, and D. Wagner, Engineering Route Planning Algorithms, Algorithmics of Large and Complex Networks -Design, Analysis, and Simulation, pp.117-139, 2009.
DOI : 10.1007/978-3-540-39658-1_69

D. Delling, P. Sanders, D. Schultes, and D. Wagner, Highway hierarchies star The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pp.141-175, 2009.

D. Delling and D. Wagner, Landmark-Based Routing in Dynamic Graphs, Experimental Algorithms, vol.2, pp.52-65, 2007.
DOI : 10.1007/978-3-540-72845-0_5

D. Delling and D. Wagner, Pareto Paths with SHARC, Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), pp.125-136, 2009.
DOI : 10.1007/978-3-642-02011-7_13

D. Delling and D. Wagner, Time-Dependent Route Planning
DOI : 10.1007/978-3-642-05465-5_8

C. D. Mohring and . Zaroliagis, Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, Lecture Notes in Computer Science, vol.5868, pp.207-230, 2009.

C. Demetrescu, A. V. Goldberg, and D. S. Johnson, The Shortest Path Problem: Ninth Dimacs Implementation Challenge, DIMACS: Discrete Mathematics and Theoretical Computer Science Series, vol.74, 2009.

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.301-325, 1986.
DOI : 10.1080/01966324.1986.10737198

M. Diana and M. 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. Diana, M. M. Dessouky, N. Xia, J. Dibbelt, T. Pajor et al., A model for the fleet sizing of demand responsive transportation services with time windows, Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), Lecture Nodes of Computer Science, pp.651-666, 2006.
DOI : 10.1016/j.trb.2005.09.005

J. Dibbelt, T. Pajor, and D. Wagner, User-Constrained Multi-Modal Route Planning
DOI : 10.1137/1.9781611972924.12

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

Y. Disser, M. Müller-hannemann, and M. Schnee, Multi-criteria Shortest Paths in Time-Dependent Train Networks, Proceedings of the 7th Workshop on Experimental Algorithms, pp.347-361, 2008.
DOI : 10.1007/978-3-540-68552-4_26

S. E. Dreyfus, An Appraisal of Some Shortest-Path Algorithms, Operations Research, vol.17, issue.3, pp.395-412, 1969.
DOI : 10.1287/opre.17.3.395

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

L. R. Ford, Network Flow Theory, 1956.

L. R. Ford and D. R. Fulkerson, Modern Heuristic Techniques for Combinatorial Problems, 1962.

M. Fredman and R. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987.
DOI : 10.1145/28869.28874

R. Geisberger, Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks, 2008.
DOI : 10.1007/978-3-540-68552-4_24

R. Geisberger, Contraction of Timetable Networks with Realistic Transfers, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), pp.71-82, 2010.
DOI : 10.1007/978-3-642-13193-6_7

R. Geisberger, M. Kobitzsch, and P. Sanders, Route Planning with Flexible Objective Functions, Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10), ALENEX, pp.124-137
DOI : 10.1137/1.9781611972900.12

R. Geisberger, P. Sanders, D. Schultes, and D. , Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), pp.319-333, 2008.
DOI : 10.1007/978-3-540-68552-4_24

R. Geisberger, P. Sanders, D. Schultes, and C. Vetter, Exact Routing in Large Road Networks Using Contraction Hierarchies, Transportation Science, vol.46, issue.3, pp.388-404, 2012.
DOI : 10.1287/trsc.1110.0401

M. Gendreau, An Introduction to Tabu Search. Handbook of Metaheuristics, pp.37-54, 2003.

F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

A. V. Goldberg and C. Harrelson, Computing the shortest path: A* search meets graph theory, Proceedings of the Symposium on Discrete Algorithms (SODA'05), pp.156-165, 2005.

A. V. Goldberg and R. F. Werneck, Computing point-to-point shortest paths from external memory, Proceedings of the 7th Workshop on Algorithm Engineering and Experiments and the 2th Workshop on Analytic Algorithmics and Combinatorics (ALENEX /ANALCO '05)

L. Häme and H. Hakula, Dynamic journeying under uncertainty, European Journal of Operational Research, vol.225, issue.3, pp.455-471, 2013.
DOI : 10.1016/j.ejor.2012.10.027

P. E. Hart, N. J. Nilsson, and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

M. Holzer, Engineering Planar-Separator and Shortest-Path Algorithms, 2008.
DOI : 10.1145/1498698.1571635
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.4950

M. Holzer, F. Schulz, and D. Wagner, Engineering Multi-Level Overlay Graphs for Shortest-Path Queries, ACM Journal of Experimental Algorithmics, vol.13, issue.25, pp.1-26, 2008.
DOI : 10.1137/1.9781611972863.15

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2007.
DOI : 10.1145/568438.568455

Y. Huang, N. Jing, and E. , Effective graph clustering for path queries in digital map databases, Proceedings of the fifth international conference on Information and knowledge management , CIKM '96, pp.215-222, 1996.
DOI : 10.1145/238355.238497

M. Huguet, D. Kirchler, P. Parent, and R. W. Calvo, Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem, Electronic Notes in Discrete Mathematics, vol.41, pp.431-437, 2013.
DOI : 10.1016/j.endm.2013.05.122
URL : https://hal.archives-ouvertes.fr/hal-00957644

T. Ikeda, M. Hsu, H. Imai, S. Nishimura, H. Shimoura et al., A fast algorithm for finding better routes by AI search techniques, Proceedings of VNIS'94, 1994 Vehicle Navigation and Information Systems Conference, pp.291-296, 1994.
DOI : 10.1109/VNIS.1994.396824

I. Ioachim, J. Desrosiers, Y. Dumas, M. M. Solomon, and D. Villeneuve, A Request Clustering Algorithm for Door-to-Door Handicapped Transportation, Transportation Science, vol.29, issue.1, pp.63-78, 1995.
DOI : 10.1287/trsc.29.1.63

R. Jacob, M. V. Marathe, K. Nagel, J. Jaw, A. Odoni et al., A computational study of routing algorithms for realistic transportation networks A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, ACM Journal of Experimental Algorithmics Transportation Research Part B: Methodological, vol.4, issue.23, pp.243-257, 1986.

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

S. Jung and S. Pramanik, An efficient path computation model for hierarchically structured topographical road maps, IEEE Transactions on Knowledge and Data Engineering, vol.14, issue.5, pp.1029-1046, 2002.
DOI : 10.1109/TKDE.2002.1033772

E. Kaufman and R. L. Smith, FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION???, I V H S Journal, vol.253, issue.1, pp.1-11, 1993.
DOI : 10.1145/79147.214078

B. S. Kerner, Introduction to Modern Traffic Flow Theory and Control, 2009.
DOI : 10.1007/978-3-642-02605-8

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, pp.3-42, 1956.
DOI : 10.1515/9781400882618-002

N. Labadie, R. Mansini, J. Melechovsk´ymelechovsk´y, and R. W. Calvo, The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search, European Journal of Operational Research, vol.220, issue.1
DOI : 10.1016/j.ejor.2012.01.030

U. Lauther, An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. Geoinformation und Mobilität -von der Forschung zur praktischen Anwendung, pp.219-230, 2004.

A. Lozano and G. Storchi, Shortest viable path algorithm in multimodal networks, Transportation Research Part A: Policy and Practice, vol.35, issue.3, pp.225-241, 2001.
DOI : 10.1016/S0965-8564(99)00056-7

Q. Lu and M. M. Dessouky, A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows, European Journal of Operational Research, vol.175, issue.2, pp.672-687, 2006.
DOI : 10.1016/j.ejor.2005.05.012

O. B. Madsen, H. F. 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

J. Maue, P. Sanders, and D. Matijevic, Goal-directed shortest-path queries using precomputed cluster distances, ACM Journal of Experimental Algorithmics, vol.14, 2009.

A. O. Mendelzon and P. T. Wood, Finding Regular Simple Paths in Graph Databases, SIAM Journal on Computing, vol.24, issue.6, pp.1235-1258, 1995.
DOI : 10.1137/S009753979122370X

C. E. Miller, A. W. Tucker, and R. A. Zemlin, Integer Programming Formulation of Traveling Salesman Problems, Journal of the ACM, vol.7, issue.4, pp.326-329, 1960.
DOI : 10.1145/321043.321046

A. Moore, An intoductory tutorial on kd-trees, 1991.

E. Moore, The Shortest Path Through a Maze, Proceedings of an International Symposium on the Theory of Switching, pp.285-292, 1959.

H. Moritz, Geodetic Reference System, Journal of Geodesy, vol.66, issue.2, pp.187-192, 1980.

M. Müller-hannemann and M. Schnee, Finding All Attractive Train Connections by Multi-criteria Pareto Search, International Dagstuhl Workshop on Algorithmic Methods for Railway Optimization, pp.246-263, 2007.
DOI : 10.1007/978-3-540-74247-0_13

G. Nannicini, Point-to-point shortest paths on dynamic time-dependent road networks, 4OR, vol.37, issue.3, 2009.
DOI : 10.1007/s10288-010-0121-0
URL : https://hal.archives-ouvertes.fr/pastel-00005275

G. Nannicini, D. Delling, L. Liberti, and D. Schultes, Bidirectional A ????????? Search for Time-Dependent Fast Paths, Proceedings of the 7th Conference on Experimental Algorithms (WEA'08), pp.334-346, 2008.
DOI : 10.1007/978-3-540-68552-4_25

G. Nannicini, D. Delling, and D. Schultes, Bidirectional A* search on time-dependent road networks, Networks, vol.10, issue.2, pp.240-251, 2012.
DOI : 10.1002/net.20438

G. Nannicini and L. Liberti, Shortest paths on dynamic graphs, International Transactions in Operational Research, vol.1, issue.1, pp.551-563, 2008.
DOI : 10.1111/j.1475-3995.2008.00649.x

A. Orda and R. Rom, Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length, Journal of the ACM, vol.37, issue.3, pp.607-625, 1990.
DOI : 10.1145/79147.214078

J. Paquette, J. Cordeau, G. Laporte, and M. M. , Combining multicriteria analysis and tabu search for dial-a-ride problems, Transportation Research Part B: Methodological, vol.52, issue.4, p.2012
DOI : 10.1016/j.trb.2013.02.007

S. N. Parragh, K. F. Doerner, and R. F. Hartl, A survey on pickup and delivery problems, Journal f??r Betriebswirtschaft, vol.1667, issue.2, pp.81-117, 2008.
DOI : 10.1007/s11301-008-0036-4

S. N. Parragh, K. F. Doerner, and R. F. Hartl, Variable neighborhood search for the dial-a-ride problem, Computers & Operations Research, vol.37, issue.6, pp.1129-1138, 2010.
DOI : 10.1016/j.cor.2009.10.003

S. N. Parragh and V. Schmid, Hybrid column generation and large neighborhood search for the dial-a-ride problem, Computers & Operations Research, vol.40, issue.1, pp.490-497, 2012.
DOI : 10.1016/j.cor.2012.08.004

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, Efficient models for timetable information in public transportation systems, Journal of Experimental Algorithmics, vol.12, pp.2-4, 2007.
DOI : 10.1145/1227161.1227166

M. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.
DOI : 10.1147/rd.32.0114

M. Rice and V. J. Tsotras, Graph indexing of road networks for shortest path queries with label restrictions, Proceedings of the VLDB endowment, pp.69-80, 2010.
DOI : 10.14778/1921071.1921074

J. Romeuf, Shortest path under rational constraint, Information Processing Letters, vol.28, issue.5, pp.245-248, 1988.
DOI : 10.1016/0020-0190(88)90198-6

P. Sanders and D. Schultes, Highway Hierarchies Hasten Exact Shortest Path Queries
DOI : 10.1007/11561071_51

P. Sanders and D. Schultes, Engineering Highway Hierarchies, Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06), pp.804-816
DOI : 10.1007/11841036_71

P. Sanders and D. Schultes, Robust, almost constant time shortest-path queries in road networks, 9th DI- MACS Implementation Challenge -Shortest Paths, pp.193-218, 2006.

G. Sauvanet, Recherche de chemins multiobjectifs pour la conception et la realisation d'une centrale de mobilité destinée aux cyclistes, 2011.

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

D. Schultes, Route planning in road networks, 2008.

F. Schulz, Timetable Information and Shortest Paths, 2005.

F. Schulz, D. Wagner, and C. Zaroliagis, Using Multi-level Graphs for Timetable Information in Railway Systems, Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments (ALENEX'02), volume 2409 of Lecture Notes in Computer Science, pp.43-59
DOI : 10.1007/3-540-45643-0_4

R. Sedgewick and J. S. Vitter, Shortest paths in euclidean graphs, Algorithmica, vol.11, issue.4, pp.31-48, 1986.
DOI : 10.1007/BF01840435

T. R. Sexton and Y. M. Choi, Pickup and Delivery of Partial Loads with ???Soft??? Time Windows, American Journal of Mathematical and Management Sciences, vol.12, issue.3-4, pp.3-4369, 1986.
DOI : 10.1080/01966324.1986.10737200

H. D. Sherali, A. G. Hobeika, and S. Kangwalklai, Time-Dependent, Label-Constrained Shortest Path Problems with Applications, Transportation Science, vol.37, issue.3, pp.278-293, 2003.
DOI : 10.1287/trsc.37.3.278.16042

H. D. Sherali, C. Jeenanunta, and A. G. Hobeika, The approach-dependent, time-dependent, label-constrained shortest path problem, Networks, vol.125, issue.2, pp.57-67, 2006.
DOI : 10.1002/net.20120

M. Sipser, Introduction to the Theory of Computation. Course Technology Ptr, 2012.

E. Taillard, Parallel iterative search methods for vehicle routing problems, Networks, vol.12, issue.8, pp.661-673, 1993.
DOI : 10.1002/net.3230230804

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

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, pp.333-346, 2003.
DOI : 10.1287/ijoc.15.4.333.24890

M. Treiber, A. Kesting, and C. Thiemann, Traffic Flow Dynamics
DOI : 10.1007/978-3-642-32460-4

D. Wagner and T. Willhalm, Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs, Proceedings of the 11th Annual European Symbosium on Algorithms (ESA'03), pp.776-787, 2003.
DOI : 10.1007/978-3-540-39658-1_69

R. , W. Calvo, and A. Colorni, An effective and fast heuristic for the Dial-a-Ride problem, pp.61-73, 2006.

M. Yannakakis, Graph-theoretic methods in database theory, Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '90
DOI : 10.1145/298514.298576