Abstract
A long-term Inventory Routing Problem (IRP) is programmed in a new way. Focusing on the customers with stochastic demands, three policies of the IRP are studied, which are policy of fixed regions and fixed routes, policy of fixed regions and varied routes, and policy of varied regions and varied routes. Under the three policies, the IRP is solved by using newsvendor inventory model, sweep algorithm, periodic stochastic inventory policy and savings algorithm, respectively. Thus the optimal delivery quantity for each customer and the total shortest distribution distance in each policy are found, which offers new approaches for the study of the stochastic IRP.
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.
