K. Ravindra, T. L. Ahuja, J. Magnanti, and . Orlin, Network flows: theory, algorithms, and applications, 1993.

N. Ascheuer, J. Sven-o-krumke, and . Rambau, Online dial-a-ride problems: Minimizing the completion time, STACS 2000, pp.639-650, 2000.

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.

M. Blom, W. E. Sven-o-krumke, L. De-paepe, and . Stougie, The online TSP against fair adversaries, INFORMS Journal on Computing, vol.13, issue.2, pp.138-148, 2001.

A. Borodin and R. El-yaniv, Online computation and competitive analysis, 2005.

J. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.153, issue.1, pp.29-46, 2007.

S. Deleplanque and A. Quilliot, Transfers in the on-demand transportation: the DARPT Diala-Ride Problem with transfers allowed, Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA), number 2013, pp.185-205, 2013.

A. Fabri and P. Recht, Online dial-a-ride problem with time windows: an exact algorithm using status vectors, Operations Research Proceedings, pp.445-450, 2006.

S. Olariu, An optimal greedy heuristic to color interval graphs, Information Processing Letters, vol.37, issue.1, pp.21-25, 1991.

E. Royer, J. Bom, M. Dhome, and B. Thuilot, Maxime Lhuillier, and François Marmoiton. Outdoor autonomous navigation using monocular vision, IEEE/RSJ International Conference on, pp.1253-1258, 2005.

E. Royer, F. Marmoiton, S. Alizon, D. Ramadasan, M. Slade et al., Retour d'expérience après plus de 1000 km en navette sans conducteur guidée par vision. RFIA2016, 2016.

Z. Yan, Informatique de Modélisation et de leurs Applications, 2016.