%0 Journal Article
%T Genetic Algorithm and Hybrid Method to Minimize Total Distribution Cost in Multi-level Supply Chain
%J Advances in Industrial Engineering
%I University of Tehran
%Z 2423-6896
%A Tarokh, Mohammad Jafar
%A Naseri, A.
%D 2012
%\ 03/20/2012
%V 46
%N 1
%P 15-26
%! Genetic Algorithm and Hybrid Method to Minimize Total Distribution Cost in Multi-level Supply Chain
%K Facility capacity
%K Hybrid Geneticâ€“Simulated annealing algorithm
%K Inventory - distribution models
%K Lost sale cost
%K Supply Chain Management
%R 10.22059/jieng.2012.29617
%X In this paper, the distribution network for multi-level supply chain has been studied. Products produced in factories are sent to customers through warehouses and distribution centers based on specific demands. Warehouses as holding inventory facilities are located close to factories and the distribution centers are placed in the most accessible locations for services near customers. Each item is sent from factories to customers through warehouses and distribution centers. Therefore, a model was designed to minimize the total distribution costs in a multi-level supply chain network. The main goal of this paper is offering a model to determine a replenishment program, to determine the values of inventory distributed to reduce the cost of lost sales, and also to determine delivery routes to reduce transport costs and determine the values stored to reduce the holding costs. A mixed integer programming for the suggested model is formulated. Therefore, the objective function of this model is to minimize the total costs of distribution network including holding cost, lost sale cost, replenishment cost and transportation costs. The model shows that the problem is Np-Hard and thus cannot be solved by LINGO for large size problems. Hence, two Meta-heuristics methods for solving the model have been used. In the first part, we have used the genetic algorithm that according to the specification of the suggested model was programmed to earn high quality solution in short run time. Secondly we have used a hybrid algorithm that simultaneously takes advantage of genetic and simulation annealing algorithms. For the hybrid algorithm, the initial solution was earned through the implementation of genetic algorithms and then this solution was improved using simulated annealing algorithm. Computational results indicate the superiority of the hybrid algorithm for small and medium size problems but for larger problems it is recommended to use the genetic algorithm alone.
%U https://jieng.ut.ac.ir/article_29617_9c24a1c5775183bb4ef6028b25396b56.pdf