Article ID: | iaor20114034 |
Volume: | 10 |
Issue: | 4 |
Start Page Number: | 398 |
End Page Number: | 415 |
Publication Date: | Apr 2011 |
Journal: | International Journal of Operational Research |
Authors: | Salam Adil, Bandaly Dia, Defersha Fantahun M |
Keywords: | programming: integer, programming: branch and bound |
In this paper, we formulate and analyse the design of a supply chain network where the concept of economies of scale in transportations are considered. Having the demand of different products from various retailers, the model determines the numbers and locations of the consolidation and distribution centres. It also determines the routes and lot sizes of the shipments to fulfil the demand by the retailers. Piecewise linearisation technique is utilised to transform the non‐linear concave‐cost function of the transportation into a linear form. Using this linearisation technique, a mixed integer linear programming model is developed that can be efficiently solved using a branch‐and‐bound‐based optimisation package. Numerical examples are presented to demonstrate the features of the proposed model and the impacts of certain input parameters on the design of the supply chain network.