Abstract
A supply chain network design needs to consider the future probability of reconfiguration due to some problems of disaster or price changes. The objective of this article is to design a reconfigurable supply chain network by optimizing inventory allocation and transportation routing. A two-stage programming is composed according to Benders decomposition by allocating inventory in advance and anticipating the changes of transportation routings; thus the transportation routing is stochastic in nature. In addition, the fuzzy shortest path is developed to solve the problem complexity in terms of the multi-criteria of lead time and capacity with an efficient computational method. The results and analysis indicate that the proposed two-stage programming with fuzzy shortest path surpasses the performance of shortest path problem with time windows and capacity constraint (SPPTWCC) in terms of less computational time and CPU memory consumption. Finally, management decision-making is discussed among other concluding remarks.
| Original language | English |
|---|---|
| Journal | Expert Systems with Applications |
| Volume | 41 |
| Issue number | 1 |
| Pages (from-to) | 39-49 |
| Number of pages | 11 |
| ISSN | 0957-4174 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
| Externally published | Yes |
Keywords
- Benders decomposition
- Fuzzy set
- Resilient supply chain
- Shortest path problem
- Supply chain design
- Two-stage programming