Abstract

Abstract. A mathematical model and heuristic method for solving multi-depot and multi-product vehicle routing problem (MD-MPVRP) with heterogeneous vehicles have been proposed in this article. Customers can order eclectic products and depots are supposed to deliver customers' orders before the lead time, using vehicles with diverse capacities, costs and velocities. Hence, mathematical model of multi-depot vehicle routing problem has been developed to mirror these conditions. This model is aimed at minimizing the serving distances which culminates in a reduction in prices and also serving time. As the problem is so complex and also solving would be too time-taking, a heuristic method has been offered. The heuristic method, at first, generates an initial solution through a three-step procedure which encompasses grouping, routing and vehicle selection, scheduling and packaging. Then it improves the solution by means of simulated annealing. We have considered the efficiency of offered algorithm by comparing its solutions with the optimum solutions and also during a case study. [V. Mahdavi Asl, S.A. Sadeghi, MR. Ostadali Makhmalbaf. A stochastic hybrid algorithm for multi-depot and multi-product routing problem with heterogeneous vehicles.