A stochastic mathematical programming approach to resilient supplier selection and order allocation problem: A case study of Iran Khodro supply chain

2Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

Abstract

Suppliers are one of the main sources of vulnerability in supply chains, which can lead to disruption and risk. Thus, resilient supplier selection can ensure enhanced resilience of the supply process, especially in automotive supply chains. The goal of this study is to select a set of resilient suppliers and ensure optimal demand allocation in an automotive supply chain exposed to risk. For this purpose, a bi-objective two-stage stochastic programming model is presented. In contrast to previous mathematical models, our proposed model incorporates a new objective function to consider the supplier's delivery performance as one of the criteria of resilient supplier selection. In addition, the K-means clustering method is used to cluster and decrease the number of disruption scenarios. Due to the uncertainty of demand, a chance-constrained programming approach is utilized in our proposed model. The augmented "-constraint method is implemented to solve the presented model. Finally, sensitivity analysis is carried out to determine the e ect of parameter changes on the nal results. The research results indicate that contingency planning can reduce the e ect of disruption risks. Further to the above, the strategy of implementing supply chain regionalization is important in reducing the e ects of environmental disruption.

Cite

CITATION STYLE

APA

Tavana, A. B., Rabieh, M., Phishvaee, M. S., & Esmaeili, M. (2023). A stochastic mathematical programming approach to resilient supplier selection and order allocation problem: A case study of Iran Khodro supply chain. Scientia Iranica, 30(5 E), 1796–1821. https://doi.org/10.24200/sci.2021.56020.4515

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free