HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH LOADING CONSTRAINTS WITHIN THE CONTEXT OF SUSTAINABLE LOGISTIC

This study addresses the Capacitated Vehicle Routing Problem where customer’s goods to be delivery is set by two-dimensional items. In contrast to other papers in the literature, this paper suggests the establishment of a model that develops economic and environmental objectives in an integrated way by measuring the associated balanced costs and promoting sustainable logistics. Additionally, a Heuristic Algorithm capable of solving the routing problem is presented, in which the container loading by the binary tree procedure solved the loading component of the problem. Through computational tests with the proposed approaches, the effectiveness of the algorithm is demonstrated, where high-quality results are achieved for 180 instances of 2L-CVRP used in previous publications in the literature. The main contribution of this paper is providing a novel, large-scale sustainable solution to 2L-CVRP through the calculation of energy consumption and emissions using an internationally standardized framework.