Читать книгу Optimization and Machine Learning - Patrick Siarry - Страница 12

Ines SBAI1 and Saoussen KRICHEN1

1Université de Tunis, Institut Supérieur de Gestion de Tunis, LARODEC Laboratory, Tunisia

This chapter combines two of the most studied combinatorial optimization problems, namely, the capacitated vehicle routing problem (CVRP) and the two/three-dimensional bin packing problem (2/3D-BPP). It focuses heavily on real-life transportation problems such as the transportation of furniture or industrial machinery. An extensive overview of the CVRP with two/three-dimensional loading constraints is presented by surveying over 76 existing contributions. We provide an updated review of the variants of the L-CVRP studied in the literature and analyze some of the most popular optimization methods presented in the existing literature. Alongside this, we discuss their variants and constraints, their applications for solving real-world problems, as well as their impact on the current literature.