Abstract
There has been much work in establishing a joint replenishment policy to minimize the total cost of inventory replenishment. Most of this work uses the indirect grouping method. Little research has been done with direct grouping methods. In this paper we develop an evolutionary algorithm (EA) that uses direct grouping to solve the joint replenishment problem (JRP). We test the EA and compare these results with results with the best available algorithm. The EA is shown to find a replenishment policy that incurs a lower total cost than the best available algorithm for some problem parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.