-. Letchford, Results for column generation with only elementary routes for m, p.139

. Letchford, Results for column generation with only elementary routes for VRPTW, p.143

. Letchford, Results for the construction of simple graph representations for, Like instances, p.171

L. Results, 89]-Like instances with wide time windows (?: instances not solved in 7200 seconds), p.173

J. Anez, T. D. , L. Barra, and B. Pérez, Dual graph representation of transport networks, Transportation Research Part B: Methodological, vol.30, issue.3, pp.209-216, 1996.
DOI : 10.1016/0191-2615(95)00024-0

R. Baldacci, A. Mingozzi, and R. Roberti, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, European Journal of Operational Research, vol.218, issue.1, pp.1-6, 2012.
DOI : 10.1016/j.ejor.2011.07.037

R. Baldacci, L. Bodin, and A. Mingozzi, The multiple disposal facilities and multiple inventory locations rollon???rolloff vehicle routing problem, Computers & Operations Research, vol.33, issue.9, pp.2667-2702, 2006.
DOI : 10.1016/j.cor.2005.02.023

F. Jonathan, G. Bard, G. Kontoravdis, and . Yu, A branch-and-cut procedure for the vehicle routing problem with time windows, Transportation Science, vol.36, issue.2, pp.250-269, 2002.

C. Barnhart, L. Ellis, . Johnson, L. George, . Nemhauser et al., Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316

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

N. Hamza-ben-ticha, D. Absi, A. Feillet, and . Quilliot, Adaptive large neighborhood search for the vehicle routing problem with time windows with a multigraph representation for the road network, 2017.

N. Hamza-ben-ticha, D. Absi, A. Feillet, and . Quilliot, Empirical analysis for the VRPTW with a multigraph representation for the road network, Computers & Operations Research, vol.88, 2017.
DOI : 10.1016/j.cor.2017.06.024

N. Hamza-ben-ticha, D. Absi, A. Feillet, and . Quilliot, A solution method for the multi-destination bi-objectives shortest path problem, CMP, vol.5, 2017.

N. Hamza-ben-ticha, D. Absi, A. Feillet, and . Quilliot, Vehicle routing problems with road-network information: State of the art, Networks, vol.16, 2018.
DOI : 10.1016/j.trc.2008.01.004

N. Hamza-ben-ticha, D. Absi, A. Feillet, T. Quilliot, and . Van-woensel, A branch-and-price algorithm for the vehicle routing problem with time windows on a road-network graph, 2017.

C. Bode and S. Irnich, Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem, Operations Research, vol.60, issue.5, pp.1167-1182, 2012.
DOI : 10.1287/opre.1120.1079

K. Braekers, K. Ramaekers, and I. Van-nieuwenhuyse, The vehicle routing problem: State of the art classification and review, Computers & Industrial Engineering, vol.99, pp.300-313, 2016.
DOI : 10.1016/j.cie.2015.12.007

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol.39, issue.1, pp.104-118, 2005.
DOI : 10.1287/trsc.1030.0056

O. Bräysy and M. Gendreau, Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation science, pp.119-139, 2005.

J. Brumbaugh-smith and D. Shier, An empirical investigation of some bicriterion shortest path algorithms, European Journal of Operational Research, vol.43, issue.2, pp.216-224, 1989.
DOI : 10.1016/0377-2217(89)90215-4

M. Caramia and F. Guerriero, A heuristic approach to long-haul freight transportation with multiple objective functions???, Omega, vol.37, issue.3, pp.600-614, 2009.
DOI : 10.1016/j.omega.2008.02.001

A. Chabrier, Vehicle Routing Problem with elementary shortest path based column generation, Computers & Operations Research, vol.33, issue.10, pp.2972-2990, 2006.
DOI : 10.1016/j.cor.2005.02.029

M. Chassaing, C. Duhamel, and P. Lacomme, Time-dependent vehicle routing problem with waiting times, pp.197-200, 2015.

G. Clarke, W. John, and . Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, vol.12, issue.4, pp.568-581, 1964.
DOI : 10.1287/opre.12.4.568

J. Carlos, N. Climaco, and E. Martins, A bicriterion shortest path algorithm, European Journal of Operational Research, vol.11, issue.4, pp.399-404, 1982.

C. João, M. Clímaco, and . Pascoal, Multicriteria path and tree problems: discussion on exact algorithms and applications, International Transactions in Operational Research, vol.19, issue.12, pp.63-98, 2012.

Á. Corberán and G. Laporte, Arc routing: problems, methods, and applications, SIAM, vol.20, 2015.
DOI : 10.1137/1.9781611973679

A. Corberán and C. Prins, Recent results on arc routing problems: An annotated bibliography. Networks Vrp with time windows, The vehicle routing problem, pp.50-69, 2001.

J. Cordeau, M. Gendreau, and G. Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems, Networks, vol.30, issue.2, pp.105-119, 1997.
DOI : 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G

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, 2012.
DOI : 10.1287/trsc.1120.0449

H. William, C. , and I. Moon, Shortest paths in networks with vector weights, Journal of Optimization Theory and Applications, vol.46, issue.1, pp.79-86, 1985.

G. Cornuéjols, J. Fonlupt, and D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Mathematical Programming, vol.13, issue.1, pp.1-27, 1985.
DOI : 10.1007/BF01582008

S. Dabia, S. Ropke, T. Van-woensel, and T. Kok, 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

B. George, . Dantzig, H. John, and . Ramser, The truck dispatching problem, Management science, vol.6, issue.1, pp.80-91, 1959.

B. George, P. Dantzig, and . Wolfe, Decomposition principle for linear programs, Operations research, vol.8, issue.1, pp.101-111, 1960.

V. Bruno-de-backer, . Furnon, . Prosser, P. Kilby, and . Shaw, Local search in constraint programming: Application to the vehicle routing problem, Proc. CP- 97 Workshop Indust. Constraint-Directed Scheduling, pp.1-15, 1997.

L. Leizer-de, C. Pinto, N. Thomás-bornstein, and . Maculan, The tricriterion shortest path problem with at least two bottleneck objective functions, European Journal of Operational Research, vol.198, issue.2, pp.387-391, 2009.

D. Delling and D. Wagner, Time-dependent route planning. Robust and online large-scale optimization, pp.207-230, 2009.

S. Demeyer, J. Goedgebeur, P. Audenaert, M. Pickavet, and P. Demeester, Speeding up Martins??? algorithm for multiple objective shortest path problems, 4OR, vol.16, issue.4, pp.323-348, 2013.
DOI : 10.1145/115234.115368

G. Desaulniers, J. Desrosiers, and M. M. Solomon, Column generation, 2006.
DOI : 10.1007/b135457

G. Desaulniers, F. Lessard, and A. Hadjar, Tabu search, generalized kpath inequalities, and partial elementarity for the vehicle routing problem with time windows, 2006.

G. Desaulniers, B. Oli, S. Madsen, and . Ropke, The vehicle routing problem with time windows Vehicle routing: Problems, methods, and applications, pp.119-159, 2014.

M. Desrochers, J. Desrosiers, and M. Solomon, A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows, Operations Research, vol.40, issue.2, pp.342-354, 1992.
DOI : 10.1287/opre.40.2.342

J. Desrosiers, Y. Dumas, M. Marius, F. Solomon, and . Soumis, Time constrained routing and scheduling. Handbooks in operations research and management science, pp.35-139, 1995.

W. Edsger and . Dijkstra, A note on two problems in connexion with graphs. Numerische mathematik, pp.269-271, 1959.

V. Alberto, R. Donati, N. Montemanni, . Casagrande, E. Andrea et al., Time dependent vehicle routing problem with a multi ant colony system, European journal of operational research, vol.185, issue.3, pp.1174-1191, 2008.

M. Dror, Arc routing: theory, solutions and applications, 2012.
DOI : 10.1007/978-1-4615-4495-1

D. Olivier-du-merle, J. Villeneuve, P. Desrosiers, and . Hansen, Stabilized column generation, Discrete Mathematics, vol.194, issue.1-3, pp.229-237, 1999.
DOI : 10.1016/S0012-365X(98)00213-1

R. Eglese, W. Maden, and A. Slater, A Road Timetable to aid vehicle routing and scheduling, Computers & Operations Research, vol.33, issue.12, pp.3508-3519, 2006.
DOI : 10.1016/j.cor.2005.03.029

J. Fabian-ehmke, A. M. Campbell, W. Barrett, and . Thomas, Data-driven approaches for emissions-minimized paths in urban areas, Computers & Operations Research, vol.67, pp.34-47, 2016.
DOI : 10.1016/j.cor.2015.08.013

J. Fabian-ehmke, A. M. Campbell, W. Barrett, and . Thomas, Vehicle routing to minimize time-dependent emissions in urban areas, European Journal of Operational Research, vol.251, issue.2, pp.478-494, 2016.
DOI : 10.1016/j.ejor.2015.11.034

M. Ehrgott and X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization Arif Volkan Vural, and Arnold Reisman. The vehicle routing problem: A taxonomic review, OR-Spektrum Computers & Industrial Engineering, vol.22, issue.574, pp.425-4601472, 2000.

D. Feillet, A tutorial on column generation and branch-and-price for vehicle routing problems, 4OR, vol.34, issue.1, pp.407-424, 2010.
DOI : 10.1007/BF01585555
URL : https://hal.archives-ouvertes.fr/emse-00505959

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.35, issue.3, pp.216-229, 2004.
DOI : 10.1002/net.20033

M. Fisher, Vehicle routing. Handbooks in operations research and management science, pp.1-33, 1995.

B. Fleischmann, A cutting plane procedure for the travelling salesman problem on road networks, European Journal of Operational Research, vol.21, issue.3, pp.307-317, 1985.
DOI : 10.1016/0377-2217(85)90151-1

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

W. Robert and . Floyd, Algorithm 97: shortest path, Communications of the ACM, vol.5, issue.6, p.345, 1962.

R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi-de-aragão, M. Reis et al., Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem, Mathematical Programming, vol.44, issue.3, pp.491-511, 2006.
DOI : 10.1287/ijoc.7.1.1

X. Gandibleux, F. Beugnies, and S. Randriamasy, Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function, 4OR, vol.4, issue.1, pp.47-59, 2006.
DOI : 10.1007/s10288-005-0074-x
URL : https://hal.archives-ouvertes.fr/hal-00462028

T. Garaix, C. Artigues, D. Feillet, and D. Josselin, Vehicle routing problems with alternative paths: An application to on-demand transportation, European Journal of Operational Research, vol.204, issue.1, pp.62-75, 2010.
DOI : 10.1016/j.ejor.2009.10.002
URL : https://hal.archives-ouvertes.fr/hal-00109003

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

M. Gendreau, A. Hertz, and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, vol.40, issue.10, pp.1276-1290, 1994.
DOI : 10.1287/mnsc.40.10.1276

K. Ghoseiri and B. Nadjari, An ant colony optimization algorithm for the bi-objective shortest path problem, Applied Soft Computing, vol.10, issue.4, pp.1237-1246, 2010.
DOI : 10.1016/j.asoc.2009.09.014

B. L. Golden, S. Raghavan, and E. A. , The vehicle routing problem: latest advances and new challenges, 2008.
DOI : 10.1007/978-0-387-77778-8

F. Guerriero and R. Musmanno, Label Correcting Methods to Solve Multicriteria Shortest Path Problems, Journal of Optimization Theory and Applications, vol.20, issue.3, pp.589-613, 2001.
DOI : 10.1287/mnsc.20.5.814

P. Hansen, Bicriterion Path Problems, Multiple criteria decision making theory and application, pp.109-127, 1980.
DOI : 10.1007/978-3-642-48782-8_9

E. Peter, . Hart, J. Nils, B. Nilsson, and . Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.

M. Hesse and J. Rodrigue, The transport geography of logistics and freight distribution, Journal of Transport Geography, vol.12, issue.3, pp.171-184, 2004.
DOI : 10.1016/j.jtrangeo.2003.12.004

B. Huang, L. Yao, and K. Raguraman, Bi-level GA and GIS for Multi-objective TSP Route Planning, Transportation Planning and Technology, vol.6, issue.2, pp.105-124, 2006.
DOI : 10.1137/0801031

Y. Huang, L. Zhao, T. Van-woensel, and J. Gross, Time-dependent vehicle routing problem with path flexibility, Transportation Research Part B: Methodological, vol.95, pp.169-195, 2017.
DOI : 10.1016/j.trb.2016.10.013

F. Huarng, L. Pulat, and . Shih, A computational comparison of some bicriterion shortest path algorithms, Journal of the Chinese Institute of Industrial Engineers, vol.13, issue.2, pp.121-125, 1996.

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

S. Irnich and G. Desaulniers, Shortest Path Problems with Resource Constraints, Column Generation, vol.6730, pp.33-65, 2005.
DOI : 10.1007/0-387-25486-2_2

S. Irnich and D. Villeneuve, ??? 3, INFORMS Journal on Computing, vol.18, issue.3, pp.391-406, 2006.
DOI : 10.1287/ijoc.1040.0117

O. Jabali, A. Woensel, and . Kok, Analysis of travel times and co2 emissions in time-dependent vehicle routing [77] Mads Jepsen, Bjørn Petersen, Simon Spoorendonk, and David Pisinger. A non-robust branch-and-cut-and-price algorithm for the vehicle routing problem with time windows, Oper. Res. Forthcoming, vol.21, issue.6, pp.1060-1074, 2006.

B. Kallehauge, Formulations and exact algorithms for the vehicle routing problem with time windows, Computers & Operations Research, vol.35, issue.7, pp.2307-2330, 2008.
DOI : 10.1016/j.cor.2006.11.006

B. Kallehauge, J. Larsen, B. Oli, and . Madsen, Lagrangian duality applied to the vehicle routing problem with time windows, Computers & Operations Research, vol.33, issue.5, pp.1464-1487, 2006.
DOI : 10.1016/j.cor.2004.11.002

E. David, . Kaufman, L. Robert, and . Smith, Fastest paths in time-dependent networks for intelligent vehicle-highway systems application, Journal of Intelligent Transportation Systems, vol.1, issue.1, pp.1-11, 1993.

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

T. Oanh-tran, V. Kim, and . Nguyen, Seung Il Moon, and Choong Seon Hong. Finding realistic shortest path in road networks with lane changing and turn restriction, Network Operations and Management Symposium (APNOMS), 2016 18th Asia- Pacific, pp.1-4, 2016.

N. Kohl, J. Desrosiers, B. Oli, . Madsen, M. Marius et al., 2-Path Cuts for the Vehicle Routing Problem with Time Windows, Transportation Science, vol.33, issue.1, pp.101-116, 1999.
DOI : 10.1287/trsc.33.1.101

. Adrianus-leendert-kok, W. Elias, . Hans, M. Johannes, 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.

S. David, . Lai, . Ozgun-caliskan-demirag, M. Janny, and . Leung, A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph, Transportation Research Part E: Logistics and Transportation Review, vol.86, pp.32-52, 2016.

Z. Lang, E. Yao, W. Hu, and Z. Pan, A Vehicle Routing Problem Solution Considering Alternative Stop Points, Procedia - Social and Behavioral Sciences, vol.138, pp.584-591, 2014.
DOI : 10.1016/j.sbspro.2014.07.242

G. Laporte, Fifty Years of Vehicle Routing, Transportation Science, vol.43, issue.4, pp.408-416, 2009.
DOI : 10.1287/trsc.1090.0301

G. Laporte, F. Louveaux, and H. Mercure, 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

N. Adam, . Letchford, D. Saeideh, A. Nasiri, and . Oukil, Pricing routines for vehicle routing with time windows on road networks, Computers & Operations Research, vol.51, pp.331-337, 2014.

N. Adam, . Letchford, D. Saeideh, D. O. Nasiri, and . Theis, Compact formulations of the steiner traveling salesman problem and related problems, European Journal of Operational Research, vol.228, issue.1, pp.83-92, 2013.

N. Adam, A. Letchford, and . Oukil, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Computers & Operations Research, vol.36, issue.7, pp.2320-2327, 2009.

Q. Li, Y. Bi-yu-chen, . Wang, H. William, and . Lam, A Hybrid Link-Node Approach for Finding Shortest Paths in Road Networks with Turn Restrictions, Transactions in GIS, vol.198, issue.6, pp.915-929, 2015.
DOI : 10.1016/j.ejor.2008.08.018

X. Li, P. Tian, C. Stephen, and . Leung, Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm, International Journal of Production Economics, vol.125, issue.1, pp.137-145, 2010.
DOI : 10.1016/j.ijpe.2010.01.013

J. Lysgaard, Reachability cuts for the vehicle routing problem with time windows, European Journal of Operational Research, vol.175, issue.1, pp.210-223, 2006.
DOI : 10.1016/j.ejor.2005.04.022

E. Q. and V. Martins, An algorithm for ranking paths that may contain cycles, European Journal of Operational Research, vol.18, issue.1, pp.123-130, 1984.
DOI : 10.1016/0377-2217(84)90269-8

E. Q. and V. Martins, On a multicriteria shortest path problem, European Journal of Operational Research, vol.16, issue.2, pp.236-245, 1984.
DOI : 10.1016/0377-2217(84)90077-8

E. Q. , V. Martins, M. Margarida-braz, J. Pascoal, and . Santos, Deviation algorithms for ranking shortest paths, International Journal of Foundations of Computer Science, vol.10, issue.03, pp.247-261, 1999.

E. Q. , V. Martins, and J. Santos, The labeling algorithm for the multiobjective shortest path problem, 1999.

J. Mote, I. Murthy, L. David, and . Olson, A parametric approach to solving bicriterion shortest path problems, European Journal of Operational Research, vol.53, issue.1, pp.81-92, 1991.
DOI : 10.1016/0377-2217(91)90094-C

M. Müller-hannemann and K. Weihe, On the cardinality of the Pareto set in bicriteria shortest path problems, Annals of Operations Research, vol.35, issue.1, pp.269-286, 2006.
DOI : 10.1007/s002910000046

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

C. Orloff, A fundamental problem in vehicle routing, Networks, vol.21, issue.1, pp.35-64, 1974.
DOI : 10.1002/net.3230040105

J. Manuel, P. , and J. Santos, Labeling methods for the general case of the multi-objective shortest path problem?a computational study, Computational Intelligence and Decision Making, pp.489-502, 2013.

J. Maria, A. Pangilinan, K. Gerrit, and . Janssens, Evolutionary algorithms for the multiobjective shortest path problem, World Academy of Science, Engineering and Technology International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, vol.1, issue.1, pp.7-12, 2007.

S. Pelletier, O. Jabali, and G. Laporte, 50th Anniversary Invited Article???Goods Distribution with Electric Vehicles: Review and Research Perspectives, Transportation Science, vol.50, issue.1, pp.3-22, 2016.
DOI : 10.1287/trsc.2015.0646

D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Computers & Operations Research, vol.34, issue.8, pp.2403-2435, 2007.
DOI : 10.1016/j.cor.2005.09.012

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.
DOI : 10.1016/S0305-0548(03)00158-8

J. Qian and R. Eglese, Finding least fuel emission paths in a network with time-varying speeds, Networks, vol.154, issue.1, pp.96-106, 2014.
DOI : 10.1016/j.dam.2006.04.009

J. Qian and R. Eglese, Fuel emissions optimization in vehicle routing problems with time-varying speeds, European Journal of Operational Research, vol.248, issue.3, pp.840-848, 2016.
DOI : 10.1016/j.ejor.2015.09.009

A. Raith, Speed-up of labelling algorithms for biobjective shortest path problems, Proceedings of the 45th annual conference of the ORSNZ, pp.313-322, 2010.

A. Raith and M. Ehrgott, A comparison of solution strategies for biobjective shortest path problems, Computers & Operations Research, vol.36, issue.4, pp.1299-1331, 2009.
DOI : 10.1016/j.cor.2008.02.002
URL : https://hal.archives-ouvertes.fr/hal-00466664

L. Blander-reinhardt, M. Kehlet-jepsen, and D. Pisinger, The Edge Set Cost of the Vehicle Routing Problem with Time Windows, Transportation Science, vol.50, issue.2, pp.694-707, 2015.
DOI : 10.1287/trsc.2015.0620

G. Righini and M. Salani, Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273, 2006.
DOI : 10.1016/j.disopt.2006.05.007

G. Righini and M. Salani, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, vol.3, issue.3, pp.155-170, 2008.
DOI : 10.1002/net.20212

J. Rodrigue, C. Comtois, and B. Slack, The geography of transport systems, Routledge, 2009.

S. Ropke and J. Cordeau, Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.43, issue.3, pp.267-286, 2009.
DOI : 10.1287/trsc.1090.0272

S. Ropke and D. Pisinger, An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.40, issue.4, pp.455-472, 2006.
DOI : 10.1287/trsc.1050.0135

L. M. Rousseau, M. Gendreau, and D. Feillet, Interior point stabilization for column generation, Operations Research Letters, vol.35, issue.5, pp.660-668, 2007.
DOI : 10.1016/j.orl.2006.11.004
URL : https://hal.archives-ouvertes.fr/hal-01311478

D. Schultes, Tiger road networks for 9th dimacs implementation challenge?shortest path, 2005.

P. Serafini, Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems, Recent advances and historical development of vector optimization, pp.222-232, 1987.
DOI : 10.1007/978-3-642-46618-2_15

M. Setak, A. Shakeri, and . Patoghi, A time dependent pollution routing problem in multi-graph, International Journal of Engineering-Transactions B: Applications, vol.30, issue.2, p.234, 2017.

M. Setak, M. Habibi, H. Karimi, and M. Abedzadeh, A time-dependent vehicle routing problem in multigraph with FIFO property, Journal of Manufacturing Systems, vol.35, issue.35, pp.37-45, 2015.
DOI : 10.1016/j.jmsy.2014.11.016

P. Shaw, A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, 1997.

J. Anders and . Skriver, A classification of bicriterion shortest path (bsp) algorithms, Asia Pacific Journal of Operational Research, vol.17, issue.2, pp.199-212, 2000.

M. Marius and . Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations research, vol.35, issue.2, pp.254-265, 1987.

S. Bradley, C. C. Stewart, and I. White, Multiobjective a, Journal of the ACM (JACM), vol.38, issue.4, pp.775-814, 1991.

P. Toth and D. Vigo, Vehicle routing: problems, methods, and applications, 2014.
DOI : 10.1137/1.9781611973594

P. Toth and D. Vigo, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Discrete Applied Mathematics, vol.123, issue.1-3, pp.487-512, 2002.
DOI : 10.1016/S0166-218X(01)00351-1

G. Tsaggouris and C. Zaroliagis, Multiobjective optimization: Improved fptas for shortest paths and non-linear objectives with applications. Theory of Computing Systems, pp.162-186, 2009.

C. Tung, T. , and K. L. Chew, A multicriteria Pareto-optimal path algorithm, European Journal of Operational Research, vol.62, issue.2, pp.203-209, 1992.
DOI : 10.1016/0377-2217(92)90248-8

T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, Heuristics for multi-attribute vehicle routing problems: A survey and synthesis, European Journal of Operational Research, vol.231, issue.1, pp.1-21, 2013.
DOI : 10.1016/j.ejor.2013.02.053

H. Wang and Y. Lee, Two-stage particle swarm optimization algorithm for the time dependent alternative vehicle routing problem, Journal of Applied & Computational Mathematics, vol.3, issue.4, pp.1-9, 2014.

L. Wen, B. Çatay, and R. Eglese, Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge, European Journal of Operational Research, vol.236, issue.3, pp.915-923, 2014.
DOI : 10.1016/j.ejor.2013.10.044

L. Wen and R. Eglese, Minimum cost VRP with time-dependent speed data and congestion charge, Computers & Operations Research, vol.56, pp.41-50, 2015.
DOI : 10.1016/j.cor.2014.10.007

S. Winter, Modeling costs of turns in route planning, GeoInformatica, vol.6, issue.4, pp.345-361, 2002.
DOI : 10.1023/A:1020853410145

G. Konstantinos, . Zografos, N. Konstantinos, and . Androutsopoulos, A decision support system for integrated hazardous materials routing and emergency response decisions. Transportation Research Part C: Emerging Technologies, pp.684-703, 2008.