R. Austriatech, Annex: Electric fleets in urban logistics, project ENCLOSE, pp.2015-2022, 2010.

R. Baldacci, E. Bartolini, A. Mingozzi, and R. Roberti, An exact solution framework for a broad class of vehicle routing problems, Computational Management Science, vol.35, issue.4, pp.229-268, 2010.
DOI : 10.1007/s10287-009-0118-3

R. Baldacci, M. Battarra, and D. Vigo, Routing a Heterogeneous Fleet of Vehicles, Operations Research/Computer Science Interfaces, vol.43, pp.3-27, 2008.
DOI : 10.1007/978-0-387-77778-8_1

T. Bektas and G. Laporte, The Pollution-Routing Problem, Transportation Research Part B: Methodological, vol.45, issue.8, pp.1232-1250, 2011.
DOI : 10.1016/j.trb.2011.02.004

O. Bräysy, W. Dullaert, G. Hasle, D. I. Mester, and M. Gendreau, An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows, Transportation Science, vol.42, issue.3, pp.371-386, 2008.
DOI : 10.1287/trsc.1070.0217

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, vol.39, issue.1, pp.119-139, 2005.
DOI : 10.1287/trsc.1030.0057

O. Bräysy, P. Porkka, W. Dullaert, P. P. Repoussis, and C. D. Tarantilis, A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows, Expert Systems with Applications, vol.36, issue.4, pp.8460-8475, 2008.
DOI : 10.1016/j.eswa.2008.10.040

C. Koç, T. Bektas, O. Jabali, and G. Laporte, The fleet size and mix pollution-routing problem, Transportation Research Part B: Methodological, vol.70, issue.0, pp.239-254, 2014.
DOI : 10.1016/j.trb.2014.09.008

G. Clarke 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

R. G. Conrad, A. Miguel, and . Figliozzi, The recharging vehicle routing problem, Proceedings Industrial Engineering Research Conference, 2011.

J. Cordeau, G. Laporte, and A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows, Journal of the Operational Research Society, vol.52, issue.8, pp.928-936, 2001.
DOI : 10.1057/palgrave.jors.2601163

. Crevier, J. Benoit, G. Cordeau, and . Laporte, The multi-depot vehicle routing problem with inter-depot routes, European Journal of Operational Research, vol.176, issue.2, pp.756-773, 2007.
DOI : 10.1016/j.ejor.2005.08.015

R. Dekker and J. Bloemhof, Operations Research for green logistics ??? An overview of aspects, issues, contributions and challenges, European Journal of Operational Research, vol.219, issue.3, pp.671-679, 2011.
DOI : 10.1016/j.ejor.2011.11.010

. Dell-'amico, M. Mauro, C. Monaci, D. Pagani, and . Vigo, Heuristic approaches for the fleet size and mix vehicle routing problem with time windows, Transportation Science, vol.41, 2007.

G. Desaulniers, F. Errico, S. Irnich, and M. Schneider, Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows, Operations Research, vol.64, issue.6, 2014.
DOI : 10.1287/opre.2016.1535

G. Desaulniers, F. Lessard, and A. Hadjar, -Path Inequalities for the Vehicle Routing Problem with Time Windows, Transportation Science, vol.42, issue.3, pp.387-404, 2008.
DOI : 10.1287/trsc.1070.0223
URL : https://hal.archives-ouvertes.fr/hal-01353974

J. Desrosiers and M. Lübbecke, Branch-price-and-cut algorithms. Wiley Encyclopedia of Operations Research and Management Science (EORMS), 2010.
DOI : 10.1002/9780470400531.eorms0118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.7693

D. Gaspero, A. Luca, and . Schaerf, Multi-neighbourhood Local Search with Application to Course Timetabling, Practice and Theory of Automated Timetabling IV, pp.262-275, 2002.
DOI : 10.1007/978-3-540-45157-0_17

W. Dullaert, G. K. Janssens, K. Sörensen, and B. Vernimmen, New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows, Journal of the Operational Research Society, vol.53, issue.11, pp.1232-1238, 2002.
DOI : 10.1057/palgrave.jors.2601422

S. Erdo?ganerdo?gan and E. Miller-hooks, A Green Vehicle Routing Problem, Select Papers from the 19th International Symposium on Transportation and Traffic Theory, pp.100-114, 2012.
DOI : 10.1016/j.tre.2011.08.001

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

D. Goeke and M. Schneider, Routing a mixed fleet of electric and conventional vehicles, European Journal of Operational Research, vol.245, issue.1, pp.81-99, 2015.
DOI : 10.1016/j.ejor.2015.01.049

B. Golden, A. Assad, L. Levy, and F. Gheysens, The fleet size and mix vehicle routing problem, Computers & Operations Research, vol.11, issue.1, pp.49-66, 1984.
DOI : 10.1016/0305-0548(84)90007-8

J. P. Hart and A. W. Shogan, Semi-greedy heuristics: An empirical study, Operations Research Letters, vol.6, issue.3, pp.107-114, 1987.
DOI : 10.1016/0167-6377(87)90021-6

G. Hiermann, M. Prandtstetter, A. Rendl, J. Puchinger, and G. R. , Metaheuristics for solving a multimodal home-healthcare scheduling problem, Central European Journal of Operations Research, vol.3, issue.3, pp.89-113, 2015.
DOI : 10.1007/s10100-013-0305-8
URL : https://hal.archives-ouvertes.fr/hal-01224625

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

G. A. Kindervater, W. P. Martin, and . Savelsbergh, Vehicle routing: Handling edge exchanges, Local Search in Combinatorial Optimization, pp.337-360, 1997.

. Liu, S. Fuh-hwa, and . Shen, The fleet size and mix vehicle routing problem with time windows, Journal of the Operational Research Society, vol.50, issue.7, pp.721-732, 1999.
DOI : 10.1057/palgrave.jors.2600763

Y. Nagata, O. Bräysy, and W. Dullaert, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research, vol.37, issue.4, pp.724-737, 2010.
DOI : 10.1016/j.cor.2009.06.022

D. C. Paraskevopoulos, P. Panagiotis, C. D. Repoussis, G. Tarantilis, G. P. Ioannou et al., A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows, Journal of Heuristics, vol.152, issue.7, pp.425-455, 2008.
DOI : 10.1007/s10732-007-9045-z

S. Pelletier, O. Jabali, and G. Laporte, Goods distribution with electric vehicles: review and research perspectives. Transportation Science Accepted for publication, 2015.

D. Pisinger and S. Ropke, Large neighborhood search Handbook of Metaheuristics, International Series in Operations Research & Management Science, pp.399-419978, 2010.

J. Potvin and J. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, European Journal of Operational Research, vol.66, issue.3, pp.331-340, 1993.
DOI : 10.1016/0377-2217(93)90221-8

P. P. Repoussis and C. D. Tarantilis, Solving the Fleet Size and Mix Vehicle Routing Problem with Time Windows via Adaptive Memory Programming, Transportation Research Part C: Emerging Technologies, vol.18, issue.5, pp.695-712, 2010.
DOI : 10.1016/j.trc.2009.08.004

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

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

A. Sbihi and R. W. Eglese, Combinatorial optimization and Green Logistics, Annals of Operations Research, vol.11, issue.20, pp.159-175, 2010.
DOI : 10.1007/s10479-009-0651-z
URL : https://hal.archives-ouvertes.fr/hal-00644076

M. Schneider, B. Sand, and A. Stenger, A note on the time travel approach for handling time windows in vehicle routing problems, Computers & Operations Research, vol.40, issue.10, pp.2564-2568, 2013.
DOI : 10.1016/j.cor.2013.02.002

M. Schneider, A. Stenger, and D. Goeke, The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations, Transportation Science, vol.48, issue.4, pp.500-520, 2014.
DOI : 10.1287/trsc.2013.0490

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming. CP '98, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7295

C. D. Tarantilis, E. Emmanouil, C. T. Zachariadis, and . Kiranoudis, A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities, INFORMS Journal on Computing, vol.20, issue.1, pp.154-168, 2008.
DOI : 10.1287/ijoc.1070.0230