The 3L-CVRP is considered as an NP-hard problem. It consists of placing di erent rectangular objects in a minimum number of vehicles in order to serve a number of clients, minimizing the number of vehicles and maximizing the number of placed objects. This loading takes into account the constraint of fragility. In fact, a fragile object cannot be placed under another fragile object...