Heterogeneous truck routing policies with tour routing time restriction: a case study of a Malaysian trucking company

We study a heterogeneous full‐truckload vehicle routing problem based on a real world case where tour routing time is restricted. Four integer programming solution policies are proposed. Three of the policies identify the set of home‐bound trucks before assigning jobs to trucks, while the last policy is a one‐off algorithm that assigns job routes to all the trucks and makes sure that each truck will not exceed the total route time limit. Computation results show that all four policies do better than the solutions provided by expert planners of the company.