R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, pp.164-165, 1993.

M. Alivand, A. A. Alesheikh, and M. R. Malek, New method for finding optimal path in dynamic networks, World Applied Science Journal, vol.3, pp.25-33, 2008.

H. R. Bajgan and R. Z. Farahani, Using colony system and neighborhood search for dynamic vehicle routing problem, American Journal of Operational Research, vol.2, issue.4, pp.31-44, 2012.

S. Balev, F. Guinand, and Y. Pigné, Maintaining Shortest Paths in Dynamic Graphs, proceedings of the International Conference on Non?Convex Programming: Local and Global Approaches Theory, Algorithms and Applications (NCP'O7), 2007.
URL : https://hal.archives-ouvertes.fr/hal-00457788

D. J. Bertsimas, Probabilistic combinatorial optimization problems, 1988.

N. Boria, V. Paschos, and . Th, Optimization in dynamic environments, Cahier du LAMSADE 314, 2011.

C. J. Ould-cheikh, A. S. Nakechbandi, and M. , Route Planning in a Weakly Dynamic Undirected Graph, 1st International IEEE Conference on Advanced Logistics and Transport (ICALT'2013), 2013.

C. Demetrescu and G. F. Italiano, A new approach to dynamic all pairs shortest paths, Journal ACM, issue.6, pp.968-992, 2004.

D. Fulkerson, Expected critical path lengths in PERT networks, Operations Research, vol.10, pp.808-817, 1962.

P. Jaillet, Probabilistic traveling salesman problems, 1985.

O. Joly, La Structuration des Réseaux de Circulation Maritime, 1999.

O. Merk, The Competitiveness of Global Port-Cities: the Case of the Seine Axis, 2011.
URL : https://hal.archives-ouvertes.fr/halshs-00699198

M. Nakechbandi and J. Colin, Routing and Rerouting in Territorial Systems Modeled by Weakly Dynamics Graphs, Ould Cheikh A. S, issue.13, 2013.

T. Notteboom, Recent traffic dynamics in the European container port system, Port Technology International, p.58, 2013.