Location-Allocation Model for Supply Chain Network based on a Lagrangian Solution Algorithmline

This paper attempts to address a multi echelon network design problem with multiple levels of capacities for a single product system. The network consists of plants that produce and send products to warehouses. The finished products are transported to customers from warehouses. Modes of transportation are available to carry the products among the network. The use of different types of shipping is moreapplicable but turning out an NP-hard problem. Large size sample problems are solved using an efficient Lagrangian relaxation method. Computational results indicate that the proposed methods solved large size sample problems in a reasonable time

Keywords:

Location , Allocation , Transportation mode , Lagrangian relaxation