Abstract
Abstract Inventory routing problem (IRP) is one of the emerging solutions for improving the supply chain efficiency. It gives the vendors the responsibility to monitor and decide the inventory replenishments of their customers. The Inventory Routing Problem (IRP) is an evolved component of VMI policies. Inventory routing provides a win-win situation for both vendors and customers. In this paper we consider a one or more distribution network consisting of a single depot and many geographically dispersed customers where each customer faces demands for a single item which, arise at a deterministic and customer-specific rate. The problem addressed in this paper is based on a finite horizon, multi- period and single product where a fleet of capacitated vehicles transport items from the depot to meet the demand specified by the customers for each period. Here a greedy algorithm is used for finding an optimal route and routing cost associated with it, finding an inventory and transportation cost that minimizes the total coste.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
