Optimization of inventory vehicle routing and distribution center problems in a supply chain net work using meta heuristics algorithms

Abstract

In this research work an inventory vehicle routing and distribution center were the most significant issues in supply chain network problems that has been proposed Inventory routing problem in a supply chain is made to determine delivery routes from suppliers to some retailers It consists of one supplier and multiple retailers who face a stochastic demand that is assumed to be independently and identically distributed over an infinite planning horizon It has been focused to reduce inventories mainly by eliminating inventory problems that are holding costs and demand distribution for products Vehicle routing problem allows direct shipping of goods from manufacturer storages to customers It satisfies customer demands at minimum total route cost and minimum of the penalties of low quality service It designs routes for delivery vehicles which operates from a single deport to supply a set of customers with locations and demands for a certain commodity Distribution centers location problem is concerned with the selection of distribution center from the potential set so that the total relevant cost is minimized Cross docking is an approach that can reduce inventories and lead times on customer response time Total cost and space requirement for inventory can be cut down Meta Heuristics is used to find the best sequence of inbound and outbound vehicles so that the objective of minimizing the total operation time is called make span The inventory vehicle routing and distribution center are widely preferred configurations in supply chain network due to their handling flexibility and agility in accommodating new meta heuristics algorithms methods. newline