. Amores,

. Arcgis, , p.94

, Geofabrik, p.44

, Geojson, p.94

. Mobianalyst,

. Neptune, , p.118

, OpenStreetMap, p.93

, GTFS

I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck, Alternative routes in road networks, J. Exp. Algorithmics, 2013.

N. Agatz, A. Erera, M. Savelsbergh, and X. Wang, Optimization for dynamic ride-sharing : A review, European Journal of Operational Research, vol.223, issue.2, pp.295-303, 2012.

K. Aissat and A. Oulamara, Proceedings, chapter The Round-Trip Ridesharing Problem with Relay Stations, p.17, 2015.

K. Aissat and S. Varone, Enterprise Information Systems, p.17

, Revised Selected Papers, chapter Carpooling as Complement to Multi-modal Transportation, p.18, 2015.

H. Aljazzar and S. L. , A heuristic search algorithm for finding the k shortest paths, Artificial Intelligence, vol.175, issue.18, p.27, 2011.

C. Artigues, M. Huguet, F. Gueye, F. Schettini, and L. Dezou, State-based accelerations and bidirectional search for biobjective multi-modal shortest paths, Seventh Triennial Symposium on Transportation Analysis, vol.27, pp.233-259, 2013.

R. Bader, J. Dees, R. Geisberger, and P. Sanders, Alternative route graphs in road networks, Proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS'11, pp.21-32, 2011.

C. Barrett, K. Bisset, M. Holzer, G. Konjevod, M. Marathe et al., Engineering Label-Constrained Shortest-Path Algorithms, vol.5034, p.15, 2008.

C. Barrett, R. Jacob, and M. Marathe, Formal-language-constrained path problems, SIAM J. Comput, vol.30, issue.3, pp.809-837, 2000.

H. Bast, M. Brodesser, and S. Storandt, Result diversity for multi-modal route planning, ATMOS -13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, vol.33, pp.123-136, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00871740

R. Bauer and D. Delling, Sharc : Fast and robust unidirectional routing

, J. Exp. Algorithmics, vol.14, p.13, 2009.

R. Bellman, The theory of dynamic programming, DTIC Document, vol.8, 1954.

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, pp.87-90, 1958.

A. Bit-monnot, C. Artigues, M. Huguet, and M. Killijian, Carpooling : the 2 synchronization points shortest paths problem, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), page 12 p, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00843628

A. Bousquet, S. Constans, and E. Nour-eddin, On the adaptation of a label-setting shortest path algorithm for one-way and two-way routing in multimodal urban transport networks. INOC, p.16, 2009.

Y. Chen, M. G. Bell, and K. Bogenberger, Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system, IEEE Transactions on Intelligent Transportation Systems, vol.8, issue.1, pp.14-20, 2007.

N. Chomsky, Three models for the description of language. Information Theory, IRE Transactions on, vol.2, issue.3, p.121, 1956.

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

B. C. Dean, Shortest paths in fifo time-dependent networks : Theory and algorithms, p.14, 2004.

D. Delling, T. Pajor, and D. Wagner, Robust and Online Large-Scale Optimization : Models and Techniques for Transportation Systems, chapter Engineering Time-Expanded Graphs for Faster Timetable InformationFinding the K Shor, p.14, 2009.

D. Delling, T. Pajor, and R. F. Werneck, Round-based public transit routing, Transportation Science, vol.49, issue.3, pp.591-604, 2015.

W. Edsger and . Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, issue.1, pp.269-271, 1959.

D. Eppstein, Finding the k shortest paths, p.22, 1994.

D. Eppstein, Finding the k shortest paths, SIAM Journal on Computing, vol.28, issue.2, pp.652-673, 1998.

F. Lester-randolph, Network flow theory, vol.8, 1956.

G. N. Frederickson, An optimal algorithm for selection in a min-heap. Information and Computation, vol.104, p.27, 1993.

V. Andrew, C. Goldberg, and . Harrelson, Computing the shortest path : A* search meets graph theory, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '05, p.12, 2005.

T. Gräbener, Calcul d'itinéraire multimodal et multiobjectif en milieu urbain. These, Université des Sciences Sociales -Toulouse I, p.19, 2010.

F. Gueye, Algorithmes de recherche d'itinéraires en transport multimodal, 2010.

P. Hart, N. Nilsson, and B. Raphael, A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on, vol.4, issue.2, pp.100-107, 1968.

M. Huguet, D. Kirchler, P. Parent, and R. W. Calvo, Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem, International Network Optimization Conference (INOC), vol.41, pp.431-437, 2013.
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, Vehicle Navigation and Information Systems Conference, p.11, 1994.

M. Víctor, A. Jiménez, and . Marzal, Algorithm Engineering : 3rd International Workshop, WAE'99 London, Proceedings, chapter Computing the K Shortest Paths : A New Algorithm and an Experimental Comparison, p.29, 1999.

M. Víctor, A. Jiménez, and . Marzal, A lazy version of eppstein's k shortest paths algorithm, In : WEA, p.27, 2003.

D. Kirchler, L. Liberti, T. Pajor, and R. W. Calvo, Unialt for regular language contrained shortest paths on a multi-modal transportation network, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, vol.20, pp.64-75, 2011.

U. Lauther, An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background, Geoinformation und Mobilitätvon der Forschung zur praktischen Anwendung, vol.22, p.13, 2004.

E. L. Lawler, A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem, Management Science, vol.18, issue.7, pp.401-405, 1972.

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.

E. Martins, On a multicriteria shortest path problem

, European Journal of Operational Research, vol.16, issue.2, p.19, 1984.

E. F. Moore, The shortest path trough a maze, vol.7, 1957.

G. Nannicini, D. Delling, D. Schultes, and L. Liberti, Bidirectional a* search on time-dependent road networks, Networks, vol.59, issue.2, pp.240-251, 2012.

T. A. Nicholson, Finding the shortest route between two points in a network, The Computer Journal, vol.9, issue.3, pp.275-280, 1966.

A. Paraskevopoulos and C. Zaroliagis, Improved alternative route planning, ATMOS -13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems -2013, vol.33, pp.108-122, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00871739

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, Efficient models for timetable information in public transportation systems, J. Exp

, Algorithmics, vol.12, issue.2, p.14, 2008.

P. Sanders and D. Schultes, Highway hierarchies hasten exact shortest path queries, Proceedings of the 13th annual European conference on Algorithms, ESA'05, pp.568-579, 2005.

P. Sanders and D. Schultes, Engineering highway hierarchies, Proceedings of the 14th conference on Annual European Symposium, vol.14, pp.804-816, 2006.

P. Sanders and D. Schultes, Engineering highway hierarchies, J. Exp

, Algorithmics, vol.17, issue.1, p.13, 2012.

G. Sauvanet, Recherche de chemins multiobjectifs pour la conception et la réalisation d'une cent These, vol.20, 2011.

F. Schulz, D. Wagner, and K. Weihe, Dijkstra's algorithm on-line : an empirical case study from public railroad transport, J. Exp. Algorithmics, vol.5, p.13, 2000.

D. Wagner and T. Willhalm, Geometric speed-up techniques for finding shortest paths in large sparse graphs, Algorithms -ESA 2003, vol.2832, p.13, 2003.

D. Wagner, T. Willhalm, and C. Zaroliagis, Geometric containers for efficient shortest-path computation, J. Exp. Algorithmics, p.13, 2005.

J. Y. Yen, Finding the k shortest loopless paths in a network, Management Science, vol.17, issue.11, pp.712-716, 1971.