The vehicle routing problem is one of the practical and significant issues in the field of traortation. In this research, the site-dependent heterogeneous fleet vehicle routing problem with three-dimensional loading constraints has been investigated. Site dependency relates to the ability of the shipping fleet to serve each customer. Sometimes, due to the characteristics of the delivery customer place, fleet, or items, not all types of fleets can serve all customers. Also, observing loading constraints can reduce costs and increase operational efficiency. Ignoring these constraints may lead to inefficient plans and thus increase costs. The loading constraints considered in this dissertation include classical, fragility, stability, and positioning constraints. To solve the problem, the mathematical modeling approach for the small and heuristic and meta-heuristic methods for the large scale problem has been used. Validation of the mathematical model was performed with the help of 21 instances.
