An Algorithm to solve the 3L-CVRP

The Three Loading Capacitated Vehicle Routing Problem considering three dimensional loading constraints (3L-CVRP) is one of the main problems to distribute goods in the logistics fields. This problem is a derivative of the Vehicle Routing Problem (VRP) whose aimed is to find optimal routes for a fleet of vehicles to deliver demand to a specific number of clients and adding constraints to better fit practical problems. This work presents an algorithm whose objective is to obtain results for large problems while minimizing execution time. Results from other authors are presented with the aim of comparing and drawing conclusions about the method used in this work.