Global supply chain network design problem with rules of origin and limited import quotas

Purpose This paper aims to develop an uncertain global supply chain network design (GSCND) model with rules of origin (RoOs) and limited import quotas, and to discuss the international factors’ effects on location decisions. Design/methodology/approach The authors establish an uncertain GSCND model...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Kybernetes 2019-05, Vol.48 (5), p.930-948
Hauptverfasser: Cheng, Xinxuan, Yang, Guoqing, Fan, Longfei
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Purpose This paper aims to develop an uncertain global supply chain network design (GSCND) model with rules of origin (RoOs) and limited import quotas, and to discuss the international factors’ effects on location decisions. Design/methodology/approach The authors establish an uncertain GSCND model with the international factors. The transportation costs and customers’ demands are characterized as random variables. To deal with the risk of uncertainty, the authors introduce the customers’ demand service level. A sample approximation approach (SAA) is used to deal with the service level constraint and turn the proposed model into a mixed integer programming. On the basis of the properties of the proposed model, a hybrid memetic algorithm (MA) is designed to solve it. Findings The authors find that the proposed MA is efficient to the real supply chain network design problem. Besides, the RoOs and limited import quotas can affect the optimal choices of plant and distribution center locations. Originality/value The authors propose an uncertain GSCND model with RoOs and limited import quotas. An MA with SAA is designed to solve the proposed model. The authors apply the proposed model into a real global supply chain of an apparel corporation in East Asia, and give some managerial insights.
ISSN:0368-492X
1758-7883
DOI:10.1108/K-10-2017-0394