Abstract
This paper proposes the use of scatter search metaheuristic to solve an integrated production, inventory, and distribution routing problem. The problem is based on a single production plant that produces a single product that is delivered toNgeographically dispersed customers by a set of homogenous fleet of vehicles. The objective is to construct a production plan and delivery schedule to minimize the total costs and ensuring each customer’s demand is met over the planning horizon. We assumed that excess production can be stored at the plant or at customer’s sites within some limits, but stockouts due to backordering or backlogging are not allowed. Further testing on a set of benchmark problems to assess the effectiveness of our method is also carried out. We compare our results to the existing metaheuristic algorithms proposed in the literature.
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.
