Abstract
The circumstantial surge in demand for products, despite meticulous demand forecasting, calls for robust supply chain enhancement. One of the ways to optimize it without altering other facets of the supply chain is warehouse relocation. In this study, the data obtained from an enterprise is fed to the Mixed Integer Linear Programming (MILP) algorithm to determine the case for relocation of warehouses. The objective of this paper is to find the appropriate location of the warehouse and determine the economical route using dynamic programming. The choice of economical routing would help in the conservation of fuel and emission of greenhouse gases as green routing is applied. This work would help the supply chain managers to optimize their logistics design, minimize operating costs and attain sustainability in their supply chain.
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.
