Skip to main content

Table 2 Data of the proposed case study

From: A branch and efficiency algorithm for the optimal design of supply chain networks

Description Parameter Value
Upper bound of produced quantities of plant i \(P_i^U\) 8000
Lower bound of produced quantities of plant i \(P_i^L\) 5000
Upper bound of transported quantities from plant i to warehouse j \(Q_{ij}^U\) 500
Upper bound of transported quantities warehouse j to customer k \(Q_{jk}^U\) 500
Unit production cost at plant i \(c_i^P\) U[0, 200]
Fixed route cost from plant i to warehouse j \(c_{ij}^F\) U[50, 100]
Unit transportation cost from plant i to warehouse j \(c_{ij}^V\) U[0, 20]
Fixed route cost from warehouse j to customer k \(c_{jk}^F\) U[50, 100]
Unit transportation cost from warehouse j to customer k \(c_{ij}^V\) U[0, 20]
Penalty cost assigned to uncovered demand of customer k \(c_k^{{ PEN}}\) \(10^{6}\)
Fixed installation cost of warehouse j \(F_j\) \(U[50, 100]\times 10^{3}\)
Coefficient relating quantity at capacity warehouse j \(\beta _j\) U[0.0001, 0.01]
Inventory kept at warehouse j \(I_j\) U[0, 100]
Demand of customer k \(d_k\) \(U[500, 1000]\times 10^{3}\)