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

J. C. Beck and L. Perron, Discrepancy-bounded depth first search, CPAIOR, pp.8-10, 2000.

D. Bergman, A. Ciré, W. Van-hoeve, and J. N. Hooker, Decision Diagrams for Optimization. Artificial Intelligence : Foundations, Theory, and Algorithms, 2016.

N. Boland, M. Hewitt, D. Vu, and M. Savelsbergh, Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks, CPAIOR, pp.254-262, 2017.

E. Burns, K. Rose, and W. Ruml, Best-first search for bounded-depth trees, Proceedings of SOCS. AAAI, 2011.

G. Carpaneto and P. Toth, Primal-dual algrorithms for the assignment problem, Discrete Applied Mathematics, vol.18, issue.2, pp.137-153, 1987.

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. Cordeau, G. Ghiani, and E. Guerriero, Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem, Transportation Science, vol.48, 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, EJOR, vol.185, issue.3, pp.1174-1191, 2008.

H. Kanoh and J. Ochiai, Solving time-dependent traveling salesman problems using ant colony optimization based on predicted traffic, DCAI, vol.151, pp.25-32, 2012.

A. Stentz, G. Ayorkor-korsah, and B. Dias, The dynamic hungarian algorithm for the assignment problem with changing costs, 2007.

M. Gendreau, G. Ghiani, and E. Guerriero, Timedependent 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, vol.83, pp.69-82, 1995.

, LLC Gurobi Optimization : Gurobi optimizer reference manual, 2018.

W. D. Harvey and M. L. Ginsberg, Limited discrepancy search, IJCAI, 1995.

M. Held and R. M. Karp, A dynamic programming approach to sequencing problems, Proceedings of the 1961 16th ACM National Meeting, ACM, vol.204, pp.71-201, 1961.

S. Ichoua, M. Gendreau, and J. Potvin, Vehicle dispatching with time-dependent travel times. EJOR, vol.144, pp.379-396, 2003.

D. E. Kaufman and R. L. Smith, Fastest paths in timedependent networks for intelligent vehicle-highway systems application, Journal of Intelligent Transportation Systems, vol.1, pp.1-11, 1993.

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 cross-comparison 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.

C. Malandraki and R. B. , Dial : A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, vol.90, pp.45-55, 1996.

P. Melgarejo and P. Laborie, Solnon : A timedependent no-overlap constraint : Application to urban delivery problems, CPAIOR, volume 9075 de LNCS, pp.1-17, 2015.

A. Montero, I. Méndez-díaz, and J. Miranda, Bront : An integer programming approach for the time-dependent traveling salesman problem with time windows, Computers & Operations Research, vol.88, pp.280-289, 2017.

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

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

R. Roberti and P. Toth, Models and algorithms for the asymmetric traveling salesman problem : an experimental comparison, EURO J. Transportation and Logistics, vol.1, issue.1-2, pp.113-133, 2012.

J. Salotti, S. Fenet, R. Billot, and N. , El Faouzi et C. Solnon : Comparison of traffic forecasting methods in urban and suburban context, 2018.

J. Schneider, The time-dependent traveling salesman problem, Physica A : Statistical Mechanics and its Applications, vol.314, issue.1, pp.151-155, 2002.

G. Stecco, J. Cordeau, and E. Moretti, A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, J. Scheduling, vol.12, issue.1, pp.3-16, 2009.

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