Abstract
The inventory routing problem simultaneously considers both the inventory problem and the delivery problem; it determines the amount of delivery of inventory and the delivery route such that the total cost is minimized. In this study, we use stochastic programming to consider a multi-product inventory routing problem that considers the demand variation throughout multiple periods. Determining the delivery route for each period is difficult. Therefore, we propose a model that fixes the delivery route throughout the planning period and compare the calculation results to prove its practicality. In addition, the problem in this study is an integer programming problem, and solving a large-scale problem using the direct method would be time-consuming. Therefore, we apply the accelerated Benders decomposition method, which combines two cuts: the optimality cut with the solution of the linear relaxation problem, and the Pareto-optimal cut. We demonstrate its effectiveness through numerical experiments.
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.
