K. A. Andersen and A. J. Skriver, A label correcting approach for solving bicriterion shortest-path problems, pp.507-524, 2000.

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

J. Brumbaugh and D. Shier, An empirical investigation of some bicriterion shortest path algorithms, European Journal of Operational Research, vol.43, issue.2, pp.216-224, 1989.
DOI : 10.1016/0377-2217(89)90215-4

I. Chabini, Discrete dynamic shortest path problems in transportation applications, Transportation Research Record, vol.8, pp.170-175, 1998.
DOI : 10.3141/1645-21
URL : http://www.its.uci.edu/~yangi/papers/Chabini.1998.TRR.1645.pdf

J. N. Clmaco and E. Q. Martins, On the determination of the nondominated paths in a multiobjective network problem, Operations Research, vol.40, pp.255-258, 1981.

L. Kenneth, E. Cooke, and . 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.

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

J. L. Santos and E. Q. Martins, An algorithm for the quickest path problem, Operations Research Letters, vol.20, pp.195-198, 1997.

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

R. Geisberger, P. Sanders, D. Schultes, and D. Delling, Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks, Experimental Algorithms, pp.319-333, 2008.
DOI : 10.1007/978-3-540-68552-4_24

V. Andrew, H. Goldberg, R. F. Kaplan, and . Werneck, Reach for a*: Efficient point-to-point shortest path algorithms, Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX), pp.129-143, 2006.

T. Grbener, A. Berro, and Y. Duthen, Time dependent multiobjective best path for multimodal urban routing, Electronic Notes in Discrete Mathematics, vol.36, pp.487-494, 2010.
DOI : 10.1016/j.endm.2010.05.062

H. W. Hamacher, S. Ruzika, and S. A. Tjandra, Algorithms for timedependent bicriteria shortest path problems. Discrete Optimization, pp.238-254, 2006.
DOI : 10.1016/j.disopt.2006.05.006
URL : https://doi.org/10.1016/j.disopt.2006.05.006

P. Hansen, Bicriterion Path Problems, Lecture Notes in Economics and Mathematical Systems, vol.177, pp.109-127, 1980.
DOI : 10.1007/978-3-642-48782-8_9

J. M. Journe and J. H. Meijers, Ship routeing for optimum performance, Transactions IME, 1980.

E. Kanoulas, Y. Du-ane, T. Xia, and D. Zhang, Finding fastest paths on a road network with speed patterns. Data Engineering, 2006.
DOI : 10.1109/icde.2006.71
URL : http://daisy.cs.uiuc.edu/hector/kanoulas_icde06.pdf

D. 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

M. Michael, M. M. Kostreva, and . Wicek, Time dependency in multiple objective dynamic programming, Journal of Mathematical Analysis and Applications, vol.173, issue.1, pp.289-307, 1991.

X. Gandibleux and M. Ehrgott, Multiple Criteria Optimization. State of the Art Annotated Bibliographic Surveys, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00470381

L. Mandow, J. L. Perez-de, and L. Cruz, A new approach to multiobjective a* search, Proceedings of the XIX International Joint Conference on Artificial Intelligence, 2005.

E. Q. Martins, On a multicriteria shortest path problem, European Journal of Operational Research, vol.16, issue.2, pp.236-245, 1984.
DOI : 10.1016/0377-2217(84)90077-8

J. Mote, I. Murthy, D. L. Olson, A. Veneti, C. Konstantopoulos et al., A parametric approach to solving bicriterion shortest path problems, European Journal of Operational Research, vol.53, issue.1, pp.81-92, 1991.
DOI : 10.1016/0377-2217(91)90094-C

P. Vincke, Problmes multicritres, p.425439, 1974.