The problem, denoted as 2L-CVRP, combines the well-known Capacitated Vehicle Routing Problem and the two-dimensional Bin Packing Problem, and leads to a very complicated overall combinatorial problem.
The problem, denoted as 2L-CVRP, combines the well-known CapacitatedVehicle Routing Problem and the two-dimensional Bin Packing Problem, and leads to avery complicated overall combinatorial problem.