A demand-based relocation of warehouses and green routing

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. (c) 2021 Elsevier Ltd. All rights reserved. Selection and peer-review under responsibility of the scientific committee of the 3rd International Conference on Materials, Manufacturing and Modelling.