Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147160
Authors: 
Tavakkoli-Moghaddam, Reza
Forouzanfar, Fateme
Ebrahimnejad, Sadoullah
Year of Publication: 
2013
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 9 [Year:] 2013 [Pages:] 1-6
Abstract: 
This paper considers a single-sourcing network design problem for a three-level supply chain. For the first time, a novel mathematical model is presented considering risk-pooling, the inventory existence at distribution centers (DCs) under demand uncertainty, the existence of several alternatives to transport the product between facilities, and routing of vehicles from distribution centers to customer in a stochastic supply chain system, simultaneously. This problem is formulated as a bi-objective stochastic mixed-integer nonlinear programming model. The aim of this model is to determine the number of located distribution centers, their locations, and capacity levels, and allocating customers to distribution centers and distribution centers to suppliers. It also determines the inventory control decisions on the amount of ordered products and the amount of safety stocks at each opened DC, selecting a type of vehicle for transportation. Moreover, it determines routing decisions, such as determination of vehicles' routes starting from an opened distribution center to serve its allocated customers and returning to that distribution center. All are done in a way that the total system cost and the total transportation time are minimized. The Lingo software is used to solve the presented model. The computational results are illustrated in this paper.
Subjects: 
Stochastic supply chain
Inventory control
Risk-pooling
Uncertainty
Capacity levels
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/2.0/
Document Type: 
Article

Files in This Item:
File
Size
203.53 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.