Two‐echelon, multi‐commodity supply chain network design with mode selection, lead‐times and inventory costs

We have formulated the problem as a mixed integer programming model, which integrates the above mentioned decisions and intends to minimize total costs of the network including transportation, lead‐times, and inventory holding costs for products, as well as opening and operating costs for facilities. Moreover, we have developed an efficient Lagrangian based heuristic solution algorithm for solving the real‐sized problems in reasonable computational time. Designing distribution networks – as one of the most important strategic issues in supply chain management – has become the focus of research attention in recent years. This paper deals with a two‐echelon supply chain network design problem in deterministic, single‐period, multi‐commodity contexts. The problem involves both strategic and tactical levels of supply chain planning including locating and sizing manufacturing plants and distribution warehouses, assigning the retailers' demands to the warehouses, and the warehouses to the plants, as well as selecting transportation modes.