B. D. Backer, V. Furnon, P. Prosser, P. Kilby, and P. Shaw, Local search in constraint programming: Application to the vehicle routing problem, Proc. CP-97 Workshop Indust. ConstraintDirected Scheduling, pp.1-15, 1997.

G. B. Dantzig and J. H. Ramser, The truck dispatching problem, Management Science, vol.6, issue.1, pp.80-91, 1959.

, of MOS-SIAM series on optimization, Vehicle Routing: Problems, Methods, and Applications, vol.18, 2014.

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.
URL : https://hal.archives-ouvertes.fr/hal-00109003

D. S. Lai, O. C. Demirag, and J. M. 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.

H. Ben-ticha, N. Absi, D. Feillet, and A. Quilliot, Empirical analysis for the vrptw with a multigraph representation for the road network, Computers & Operations Research, vol.88, pp.103-116, 2017.
URL : https://hal.archives-ouvertes.fr/emse-01558173

H. Ben-ticha, N. Absi, D. Feillet, and A. Quilliot, Vehicle routing problems with road-network information: State of the art, Networks, vol.72, issue.3, pp.393-406, 2018.
URL : https://hal.archives-ouvertes.fr/emse-01684038

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.

C. Orloff, A fundamental problem in vehicle routing, Networks, vol.4, issue.1, pp.35-64, 1974.

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.

G. Cornuéjols, J. Fonlupt, and D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Mathematical programming, vol.33, issue.1, pp.1-27, 1985.

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

H. Ben-ticha, N. Absi, D. Feillet, A. Quilliot, and T. Van-woensel, A branch-and-price algorithm for the vehicle routing problem with time windows on a road network
URL : https://hal.archives-ouvertes.fr/hal-01842350

R. Baldacci, L. D. 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.

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.

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

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.

G. Desaulniers, O. B. Madsen, and S. Ropke, The vehicle routing problem with time windows, Vehicle Routing: Problems, Methods, and Applications, vol.18, pp.119-159, 2014.

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.

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.

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.

O. Bräysy and M. Gendreau, Vehicle routing problem with time windows, part II: Metaheuristics, Transportation Science, vol.39, issue.1, pp.119-139, 2005.

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.

P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, International conference on principles and practice of constraint programming, pp.417-431, 1998.

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

G. Clarke and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, vol.12, issue.4, pp.568-581, 1964.

S. Irnich and G. Desaulniers, Shortest path problems with resource constraints, Column Generation, pp.33-65, 2005.

M. W. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research, vol.4, issue.1, pp.285-305, 1985.

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.