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

P. Toth and D. Vigo, 1. An Overview of Vehicle Routing Problems, SIAM Monographs on Discrete Mathematics and Applications, pp.1-26, 2002.
DOI : 10.1137/1.9780898718515.ch1
URL : https://hal.archives-ouvertes.fr/in2p3-00011039

C. Prins, Two memetic algorithms for heterogeneous fleet vehicle routing problems, Engineering Applications of Artificial Intelligence, vol.22, issue.6, pp.916-928, 2009.
DOI : 10.1016/j.engappai.2008.10.006

J. F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J. S. Sormany, New Heuristics for the Vehicle Routing Problem, pp.279-298, 2005.
DOI : 10.1007/0-387-24977-X_9

M. Gendreau, M. Iori, G. Laporte, S. A. Martello, and . Tabu, A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints, Networks, vol.23, issue.1, pp.4-18, 2008.
DOI : 10.1002/net.20192

E. E. Zachariadis, C. D. Tarantilis, and C. Kiranoudis, A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints, European Journal of Operational Research, vol.195, issue.3, pp.729-743, 2009.
DOI : 10.1016/j.ejor.2007.05.058

G. Fuellerer, K. F. Doerner, R. F. Hartl, and M. Iori, Ant colony optimization for the two-dimensional loading vehicle routing problem, Computers & Operations Research, vol.36, issue.3, pp.36-655, 2009.
DOI : 10.1016/j.cor.2007.10.021

M. Iori, J. J. Salazar-gonzález, and D. Vigo, An exact approach for capacitated vehicle routing problems with two-dimensional loading constraints, Transportation Science, issue.2, pp.41-253, 2007.

C. Duhamel, P. Lacomme, A. Quilliot, and H. Toussaint, A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem, Computers & Operations Research, vol.38, issue.3, pp.38-617, 2011.
DOI : 10.1016/j.cor.2010.08.017

M. Gendreau, M. Iori, G. Laporte, and S. A. Martello, A Tabu Search Algorithm for a Routing and Container Loading Problem, Transportation Science, vol.40, issue.3, pp.40-342, 2006.
DOI : 10.1287/trsc.1050.0145

G. Fuellerer, K. F. Doerner, R. F. Hartl, and M. Iori, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, European Journal of Operational Research, vol.201, issue.3, pp.751-759, 2010.
DOI : 10.1016/j.ejor.2009.03.046

M. Hifi, I. Kacem, S. Nègre, and L. Wu, A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem, Electronic Notes in Discrete Mathematics, vol.36, pp.993-1000, 2010.
DOI : 10.1016/j.endm.2010.05.126

Y. Wu, W. Li, M. Goh, and R. De-souza, Three-dimensional bin packing problem with variable bin height, European Journal of Operational Research, vol.202, issue.2, pp.347-355, 2010.
DOI : 10.1016/j.ejor.2009.05.040

A. Bortfeldt and D. Mack, A heuristic for the three-dimensional strip packing problem, European Journal of Operational Research, vol.183, issue.3, pp.1267-1279, 2007.
DOI : 10.1016/j.ejor.2005.07.031

S. D. Allen, E. K. Burke, and G. Kendall, A hybrid placement strategy for the three-dimensional strip packing problem, European Journal of Operational Research, vol.209, issue.3, pp.219-227, 2011.
DOI : 10.1016/j.ejor.2010.09.023

D. Almeida, A. Figueiredo, and M. B. , A particular approach for the Three-dimensional Packing Problem with additional constraints, Computers & Operations Research, vol.37, issue.11, pp.37-1968, 2010.
DOI : 10.1016/j.cor.2010.01.010

C. Prins, A GRASP×Evolutionary Local Search Hybrid for the Vehicle Routing Problem Bio-inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence, vol.161, pp.35-53, 2009.

T. A. Feo and M. G. Resende, Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, vol.68, issue.2, pp.109-142, 1995.
DOI : 10.1007/BF01096763

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

H. Lourenço, O. Martin, and T. Stützle, Iterated Local Search Handbook of Metaheuristics, pp.320-353, 2003.

C. Duhamel, P. Lacomme, and C. Prodhon, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, Computers & Operations Research, vol.38, issue.4, pp.723-739, 2011.
DOI : 10.1016/j.cor.2010.09.010

P. C. Gilmore and R. E. Gomory, Multistage Cutting Stock Problems of Two and More Dimensions, Operations Research, vol.13, issue.1, pp.94-120, 1965.
DOI : 10.1287/opre.13.1.94

L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), pp.16-18, 1978.
DOI : 10.1109/SFCS.1978.3

R. Bayer and E. M. Mccreight, Organization and maintenance of large ordered indices, Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control, SIGFIDET '70, pp.173-189, 1972.
DOI : 10.1145/1734663.1734671

P. Lacomme, C. Prins, and W. Ramdane-chérif, Competitive Memetic Algorithms for Arc Routing Problems, Annals of Operations Research, vol.131, issue.1-4, pp.159-185, 2004.
DOI : 10.1023/B:ANOR.0000039517.35989.6d
URL : https://hal.archives-ouvertes.fr/hal-00119814

J. E. Beasley, Route first???Cluster second methods for vehicle routing, Omega, vol.11, issue.4, pp.403-408, 1983.
DOI : 10.1016/0305-0483(83)90033-6

V. Bajart and C. Charles, Systèmes d'Information Géographique. 3 rd year project report, ISIMA

D. Cote-d, Armor 4654, pp.4522-52