Cargo traort is one of the main causes of traffic, noise, and air pollution in populous cities. Implementation of two-echelon distribution systems can contribute to controlling the negative impacts of cargo traort in such urban environments. The cargo is traorted from one or several depots to multiple intermediate facilities called satellites, which are located near the urban area. In the satellites, the cargo will be packed to be delivered to customers by eco-friendly vehicles. This thesis presents a new mathematical model for two-echelon vehicle routing problem with two-dimensional loading constraints. This model aims to determine the sets of first echelon and second echelon routes that would ensure the complete delivery of all orders and minimize the traortation cost while not violating the vehicle weight capacity constraint and two-dimensional loading constraints. Given the NP-hard complexity of this problem, we proposed the combination of heuristic and metaheuristic algorithms, which included five heuristic algorithms of two-dimensional bin packing problem, a constructive heuristic algorithm to produce the initial solution, a variable neighborhood search and an improved variable neighborhood search. The good performance of the improved variable neighborhood search algorithm is demonstrated by comparing its outputs with the result of basic variable neighborhood search and exact method
