A Two-Phase Hybrid Heuristic Method For A Multi-Depot Inventory-Routing Problem

In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (mdmvirp). inventory routing problem (irp) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (vmi) the mdmvirp combines inventory management and routing decision. we are given on input a fleet of homogeneous vehicles, in which any of these vehicles have a capacity and a fixed cost. also, a set of distribution centers with restricted capacities are responsible to serve the customer’s demands, which are known for distributer at beginning of each period. the problem consists of determining the delivery quantity to the customers at each period and the routes to be performed to satisfy the demand of the customers. the objective function of this problem is to minimize sum of the holding cost at distributer centers and the customers, and of the transportation costs associated to the preformed routes. in the proposed hybrid heuristic method, after a construction phase (first phase) a modified variable neighborhood search algorithm (vns), with distinct neighborhood structures, is used during the improvement phase (second phase). moreover, we use simulated annealing (sa) concept to avoid that the solution remains in a local optimum for a given number of iterations. computational results on benchmark instances that adopt from the literature of irp indicate that the proposed algorithm is capable to find, within reasonable computing time, several solutions gained by the approaches that applied in the previous published studies.