, Cplex optimization studio 12.6.3

. Openstreetmap-database,

, Tomtom traffic index

H. Abeledo, R. Fukasawa, A. Pessoa, and E. Uchoa, The time dependent traveling salesman problem: polyhedra and algorithm, Mathematical Programming Computation, vol.43, issue.1, pp.27-55, 2013.
DOI : 10.1002/(SICI)1520-6750(199609)43:6<797::AID-NAV2>3.0.CO;2-#
URL : http://www.optimization-online.org/DB_FILE/2010/12/2872.pdf

B. Ahn and J. Shin, Vehicle-routeing with Time Windows and Time-varying Congestion, Journal of the Operational Research Society, vol.42, issue.5, pp.393-400, 1991.
DOI : 10.1057/jors.1991.81

J. Albiach, D. Sanchis, and . Soler, An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation, European Journal of Operational Research, vol.189, issue.3, pp.789-802, 2008.
DOI : 10.1016/j.ejor.2006.09.099

L. S. Kang, A. M. Zhou, and Z. Y. Yan, Solving dynamic tsp with evolutionary approach in real time, Proceedings of the Congress on Evolutionary Computation, 2003.

L. David, . Applegate, E. Robert, V. Bixby, . Chvatal et al., The traveling salesman problem: a computational study, 2011.

. Arigliano, E. Ghiani, and . Guerriero, Time Dependent Traveling Salesman Problem With Time Windows: Properties and an Exact Algorithm, 2014.
DOI : 10.1016/j.dam.2018.09.017

P. Baptiste, P. Laborie, C. L. Pape, and W. Nuijten, Constraint-Based Scheduling and Planning, Handbook of Constraint Programming, chapter 22, pp.759-798, 2006.
DOI : 10.1016/S1574-6526(06)80026-X

P. Baptiste, P. Laborie, C. L. Pape, and W. Nuijten, Handbook of Constraint Programming Constraint-Based Scheduling and Planning, pp.759-798, 2006.

. Ph, C. L. Baptiste, and . Pape, Disjunctive constraints for manufacturing scheduling: Principles and extensions, Proc. 3rd International Conference on Computer Integrated Manufacturing, 1995.

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint-based scheduling: applying constraint programming to scheduling problems, 2012.
DOI : 10.1007/978-1-4615-1479-4
URL : https://hal.archives-ouvertes.fr/inria-00123562

R. Bartak, Guide to constraint programming. http://kti.ms. mff.cuni.cz/ ~ bartak/constraints/propagation.html. [Online; accessed 20, 2012.

T. Baudel, L. Dablanc, P. Aguiar-melgarejo, and J. Ashton, Optimizing urban freight deliveries: From designing and testing a prototype system to addressing real life challenges. Transportation Research Procedia, Tenth International Conference on City Logistics, pp.170-180, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01255153

J. Beasley, Adapting the savings algorithm for varying inter-customer travel times, Omega, vol.9, issue.6, pp.658-659, 1981.
DOI : 10.1016/0305-0483(81)90055-4

P. Benchimol, W. J. Van-hoeve, J. Regin, L. Rousseau, and M. Rueher, Improved filtering for weighted circuit constraints, Constraints, vol.26, issue.4, pp.205-233, 2012.
DOI : 10.1145/322154.322161
URL : https://hal.archives-ouvertes.fr/hal-01099501

J. Bentner, G. Bauer, M. Gustav, I. Obermair, J. Morgenstern et al., Optimization of the time-dependent traveling salesman problem with Monte Carlo methods, Physical Review E, vol.90, issue.3, 2001.
DOI : 10.1016/0377-2217(94)00299-1

W. C. Benton and A. V. Hill, Modelling intra-city time-dependent travel speeds for vehicle scheduling problems, Journal of the Operational Research Society, 1992.

A. Bhaskar, A methodology (cuprite) for urban network travel time estimation by integrating multisource data, 2009.

J. Bront, Integer Programming approaches to the Time Dependent Travelling Salesman Problem, 2012.

H. Cambazard and B. Penz, A Constraint Programming Approach for the Traveling Purchaser Problem, Principles and Practice of Constraint Programming, pp.735-749, 2012.
DOI : 10.1007/978-3-642-33558-7_53
URL : https://hal.archives-ouvertes.fr/hal-00790829

Y. Caseau and F. Laburthe, Solving small tsps with constraints, ICLP, p.104, 1997.

C. J. Eyckelhof and M. Snoek, Ant systems for a dynamic tsp -ants caught in a traffic jam, 2002.
DOI : 10.1007/3-540-45724-0_8

W. Cook, Concorde tsp solverOnline; accessed 27, 2016.

J. Cordeau, G. Ghiani, and E. Guerriero, Properties and Branch-and-Cut Algorithm for the Time-Dependent Traveling Salesman Problem, 2012.

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1990.

S. Dabia and S. Ropke, Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows, Transportation Science, vol.47, issue.3, pp.380-396, 2013.
DOI : 10.1287/trsc.1120.0445
URL : http://orbit.dtu.dk/en/publications/branch-and-price-for-the-timedependent-vehicle-routing-problem-with-time-windows(a32598e4-8e97-49eb-944a-21af86c752f5).html

D. Delling, P. Sanders, D. Schultes, and D. Wagner, Engineering Route Planning Algorithms, Algorithmics of Large and Complex Networks, 2009.
DOI : 10.1007/978-3-540-39658-1_69
URL : http://i11www.ira.uka.de/extra/publications/dssw-erpa-09.pdf

E. Demir, T. Bekta¸sbekta¸s, and G. Laporte, A comparative analysis of several vehicle emission models for road freight transportation, Transportation Research Part D: Transport and Environment, vol.16, issue.5, pp.347-357, 2011.
DOI : 10.1016/j.trd.2011.01.011

, Académie des technologies. Le transport de marchandises, 2009.

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.
DOI : 10.1016/j.ejor.2006.06.047

E. Stuart and . Dreyfus, An appraisal of some shortest-path algorithms, Operations research, vol.17, issue.3, pp.395-412, 1969.

J. Fabian-ehmke, A. M. Campbell, and B. W. Thomas, Vehicle Routing to Minimize Time-Dependent Emissions in Urban Areas, European Journal of Operational Research, 2015.

J. Fabian-ehmke, A. Steinert, and D. C. Mattfeld, Advanced routing for city logistics service providers based on time-dependent travel times, Journal of Computational Science, vol.3, issue.4, pp.193-205, 2012.
DOI : 10.1016/j.jocs.2012.01.006

J. G. Fages and X. Lorca, Improving the asymmetric tsp by considering graph structure. arxiv preprint arxiv:1206, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00707510

M. A. and F. , 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.
DOI : 10.1016/j.tre.2011.11.006

B. Fleischmann, M. Gietz, and S. Gnutzmann, Time-Varying Travel Times in Vehicle Routing, Transportation Science, vol.38, issue.2, pp.160-173, 2004.
DOI : 10.1287/trsc.1030.0062

F. Focacci, P. Laborie, and W. Nuijten, Solving scheduling problems with setup times and alternative resources, Proc. Fifth International Conference on Artificial Intelligence Planning and Scheduling, AIPS'00, pp.92-101, 2000.

F. Focacci, W. Laborie, and . Nuijten, Solving Scheduling Problems with Setup Times and Alternative Resources, AIPS Proceedings, 2000.

R. Kenneth, . Fox, . Gavish, C. Stephen, and . Graves, An n-Constraint Formulation of the ( Time-Dependent ) Traveling Salesman Problem, Operations Research, vol.28, issue.4, pp.1018-1021, 1980.

F. Furini, C. A. Persiani, and P. Toth, The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace, Transportation Research Part B: Methodological, vol.90, 2015.
DOI : 10.1016/j.trb.2016.04.009
URL : https://hal.archives-ouvertes.fr/hal-01492016

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

G. Ghiani and E. Guerriero, A Note on the Ichoua et al ( 2003 ) Travel Time Model, Transportation Science, 2013.
DOI : 10.1287/trsc.2013.0491

D. Godard, P. Laborie, and W. Nuijten, Randomized large neighborhood search for cumulative scheduling, ICAPS, pp.81-89, 2005.

L. Gouveia and S. Voss, A classification of formulations for the (time-dependent) traveling salesman problem, European Journal of Operational Research, vol.83, issue.1, pp.69-82, 1995.
DOI : 10.1016/0377-2217(93)E0238-S

H. Hashimoto, M. Yagiura, and T. Ibaraki, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization, pp.434-456, 2008.
DOI : 10.1016/j.disopt.2007.05.004
URL : https://doi.org/10.1016/j.disopt.2007.05.004

H. N. Psaraftis, Dynamic vehicle routing problems, Vehicles Routing: Methods and Studies, 1988.

S. Ichoua, M. Gendreau, and J. Potvin, Vehicle dispatching with time-dependent travel times, European Journal of Operational Research, vol.144, issue.2, 2003.
DOI : 10.1016/S0377-2217(02)00147-9

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, 1993.
DOI : 10.1145/79147.214078

E. Kelareva, K. Tierney, and P. Kilby, CP methods for scheduling and routing with??time-dependent task costs, EURO Journal on Computational Optimization, vol.1, issue.1, pp.147-194, 2014.
DOI : 10.5815/ijigsp.2010.01.02

S. Astrid, . Kenyon, P. David, and . Morton, Stochastic vehicle routing with random travel times, Transportation Science, vol.37, issue.1, pp.69-82, 2003.

E. W. Kok, J. M. Hans, and . Schutten, Vehicle routing under time-dependent travel times: The impact of congestion avoidance, Computers & Operations Research, vol.39, issue.5, pp.910-918, 2012.
DOI : 10.1016/j.cor.2011.05.027
URL : http://www.utwente.nl/mb/ompl/staff/Ex-colleagues/Kok/vehicle_routing_under_time_dep.pdf

R. Kumar and Z. Luo, Optimizing the operation sequence of a chip placement machine using TSP model, IEEE Transactions on Electronics Packaging Manufacturing, vol.26, issue.1, pp.14-21, 2003.
DOI : 10.1109/TEPM.2003.813002

P. Laborie, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Artificial Intelligence, vol.143, issue.2, pp.151-188, 2003.
DOI : 10.1016/S0004-3702(02)00362-4
URL : https://doi.org/10.1016/s0004-3702(02)00362-4

P. Laborie and D. Godard, Self-adapting large neighborhood search: Application to single-mode scheduling problems, Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pp.276-284, 2007.

P. Laborie and J. Rogerie, Reasoning with Conditional Time-Intervals, FLAIRS Conference, pp.555-560, 2008.

P. Laborie, J. Rogerie, P. Shaw, and P. Vilím, Reasoning with Conditional Time-Intervals. Part II: an Algebraical Model for Resources, FLAIRS Conference, 2009.

G. Laporte and F. Louveaux, The Vehicle Routing Problem with Stochastic Travel Times, Transportation Science, vol.26, issue.3, pp.161-170, 1992.
DOI : 10.1287/trsc.26.3.161

A. Larsen, B. Oli, and . Madsen, The dynamic vehicle routing problem, 2000.

, Constraint Networks: Techniques and Algorithms

I. Wiley, , 2009.

S. Ji-youn-lee, T. H. Shin, B. Park, and . Zhang, Solving traveling salesman problems with dna molecules encoding numerical values, BioSystems, vol.78, issue.1, pp.39-47, 2004.

F. Li, B. Golden, and E. Wasil, Solving the Time Dependent Traveling Salesman Problem, The Next Wave in Computing, Optimization, and Decision Technologies, pp.163-182, 2005.
DOI : 10.1007/0-387-23529-9_12

W. Maden, D. Eglese, and . Black, Vehicle routing and scheduling with time-varying data: A case study, Journal of the Operational Research Society, vol.61, issue.3, pp.515-522, 2009.
DOI : 10.1016/j.ejor.2007.03.012

J. Mairy, P. Van-hentenryck, and Y. Deville, Optimal and efficient filtering algorithms for table constraints, Constraints, vol.171, issue.8???9, pp.77-120, 2014.
DOI : 10.1016/j.artint.2007.04.001

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.
DOI : 10.1287/trsc.26.3.185

C. Malandraki, B. Robert, and . Dial, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, European Journal of Operational Research, vol.90, issue.1, pp.45-55, 1996.
DOI : 10.1016/0377-2217(94)00299-1

P. Aguiar-penélope-melgarejo, C. Laborie, and . Solnon, A Time-Dependent No-Overlap Constraint : Application to Urban Delivery Problems, pp.1-17, 2015.

J. Menana and S. Demassey, Sequencing and Counting with the multicost-regular Constraint, International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, pp.178-192, 2009.
DOI : 10.1007/978-3-642-82118-9
URL : https://hal.archives-ouvertes.fr/hal-00394434

J. Ochiai and H. Kanoh, Solving Real-World Delivery Problem using Improved Max-Min Ant System with Local Optimal Solutions in Wide Area Road Network, International Journal of Artificial Intelligence & Applications, vol.5, issue.3, pp.21-36, 2014.
DOI : 10.5121/ijaia.2014.5302

A. Orda and R. Rom, Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length, Journal of the ACM, vol.37, issue.3, pp.607-625, 1990.
DOI : 10.1145/79147.214078

J. Picard and M. Queyranne, The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling, Operations Research, vol.26, issue.1, 1978.
DOI : 10.1287/opre.26.1.86

N. Policella, F. Stephen, A. Smith, A. Cesta, and . Oddi, Generating robust schedules through temporal flexibility, ICAPS, pp.209-218, 2004.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, CP, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41

J. Régin, A filtering algorithm for constraints of difference in csps, AAAI, pp.362-367, 1994.

G. Reinelt and . Tsplib95, , 2016.

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

D. Soler, E. Albiach, and . Martinez, A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows, Operations Research Letters, vol.37, issue.1, pp.37-42, 2009.
DOI : 10.1016/j.orl.2008.07.007

M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.
DOI : 10.1287/opre.35.2.254

G. Stecco, J. Cordeau, and E. Moretti, A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times, Computers & Operations Research, vol.35, issue.8, pp.2635-2655, 2008.
DOI : 10.1016/j.cor.2006.12.021

G. Stecco, J. Cordeau, and E. Moretti, A tabu search heuristic for a sequence-dependent and??time-dependent scheduling problem on a single machine, Journal of Scheduling, vol.23, issue.1, pp.3-16, 2009.
DOI : 10.1016/j.cor.2006.12.021

W. Van-hoeve and I. Katriel, Global constraints, 2006.

T. Van-woensel, L. Kerbache, H. Peremans, and N. Vandaele, Vehicle routing with dynamic travel times: A queueing approach, European Journal of Operational Research, vol.186, issue.3, pp.990-1007, 2008.
DOI : 10.1016/j.ejor.2007.03.012
URL : https://hal.archives-ouvertes.fr/hal-00465127

P. Vilím, P. Laborie, and P. Shaw, Failure-Directed Search for Constraint-Based Scheduling, International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, pp.437-453, 2015.
DOI : 10.1007/978-3-319-18008-3_30

D. Waltz, Understanding line drawings of scenes with shadows In The Psychology of Computer Vision, pp.19-91, 1975.

T. Van-woensel, L. Kerbache, H. Peremans, and N. Vandaele, A Queueing Framework for Routing Problems with Time-dependent Travel Times, Journal of Mathematical Modelling and Algorithms, vol.4, issue.2, pp.151-173, 2006.
DOI : 10.1007/s10288-005-0085-7
URL : https://hal.archives-ouvertes.fr/hal-00465130

L. Wynter, M. Barry, Y. Trager, Y. Yu, S. Kararianakis et al., Traffic estimation and prediction for urban road networks, application to grandlyon, ITS World Congress, 2015.

K. Zaidi, M. Milojevic, V. Rakocevic, and M. Rajarajan, Data-centric Rogue Node Detection in VANETs, 2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications, pp.398-405, 2014.
DOI : 10.1109/TrustCom.2014.51

X. L. Hu, Z. C. Huang, and S. D. Chen, Dynamic traveling salesman problem based on evolutionary computation, Congress on Evolutionary Computation(CEC'01, 2001.