A. Arigliano, G. Ghiani, A. Grieco, and E. Guerriero, Time dependent traveling salesman problem with time windows: Properties and an exact algorithm, 2015.

N. Boland, M. Hewitt, D. M. Vu, and M. Savelsbergh, Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks, International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.254-262, 2017.

N. Chiabaut, M. Kung, M. Menendez, and L. Leclercq, Perimeter control as an alternative to dedicated bus lanes: A case study, Transportation Research Record, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02004367

J. Coldefy, Optimodlyon ou la mise en synergie des acteurs publics et privés pour une gestion optimale de lintermodalité, pp.2268-3798, 2016.

J. Cordeau, G. Ghiani, and E. Guerriero, Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem, Transportation Science, vol.48, issue.1, pp.46-58, 2014.

A. V. Donati, R. Montemanni, N. Casagrande, A. E. Rizzoli, and L. M. Gambardella, Time dependent vehicle routing problem with a multi ant colony system, European Journal of Operational Research, vol.185, issue.3, pp.1174-1191, 2008.

L. C. Edie, Discussion of traffic stream measurements and definitions, 1963.

M. A. Figliozzi, The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics, Transportation Research Part E: Logistics and Transportation Review, vol.48, issue.3, pp.616-636, 2012.

B. Fleischmann, M. Gietz, and S. Gnutzmann, Time-varying travel times in vehicle routing, Transportation Science, vol.38, issue.2, pp.160-173, 2004.

M. Gendreau, G. Ghiani, and E. Guerriero, Time-dependent routing problems: A review, Computers & Operations Research, vol.64, pp.189-197, 2015.

L. Gouveia and S. Voß, A classification of formulations for the (time-dependent) traveling salesman problem, European Journal of Operational Research, vol.83, issue.1, p.238, 1995.

R. M. Karp, Reducibility among combinatorial problems, Complexity of computer computations, pp.85-103, 1972.

J. A. Laval and L. Leclercq, Microscopic modeling of the relaxation phenomenon using a macroscopic lane-changing model, Transportation Research Part B: Methodological, vol.42, issue.6, pp.511-522, 2008.

L. Leclercq, Bounded acceleration close to fixed and moving bottlenecks, Transportation Research Part B: Methodological, vol.41, issue.3, pp.309-319, 2007.

L. Leclercq, N. Chiabaut, and B. Trinquier, Macroscopic fundamental diagrams: A crosscomparison of estimation methods, Transportation Research Part B: Methodological, vol.62, pp.1-12, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01349913

C. Malandraki and M. S. Daskin, Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms, Transportation Science, vol.26, issue.3, pp.185-200, 1992.

P. A. Melgarejo, P. Laborie, and C. Solnon, A time-dependent no-overlap constraint: Application to urban delivery problems, Integration of AI and OR Techniques in Constraint Programming -12th International Conference, vol.9075, pp.1-17, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01163394

G. F. Newell, A simplified car-following theory: a lower order model, Transportation Research Part B: Methodological, vol.36, issue.3, pp.195-205, 2002.

U. Pferschy and R. Stan?k, Generating subtour elimination constraints for the tsp from pure integer solutions, Central European journal of operations research, vol.25, issue.1, pp.231-260, 2017.

D. M. Vu, M. Hewitt, N. Boland, and M. Savelsbergh, Solving time dependent traveling salesman problems with time windows, 2018.