Page 29 - 33-3

NTU Management Review Vol. 33 No. 3 Dec. 2023

Algorithm 2 Greedy Selection Algorithm with Maximum Flow Estimation (GSAMFE)
1: y ← 0,S ← ∅
2: repeat
3: bestRatio ← 0,(j*,k*) ← (0, 0)
4: for j ∈ J \ S do
5: for k ∈ K do
6: if f(y) + f jk ≤ B then
7: y jk ←1
8: aRatio ← Ratio'(j,k|y)
9: if aRatio > bestRatio then
10: bestRatio ← aRatio,(j*,k*)←(j,k)
11: end if
12: y jk ←0
13: end if
14: end if
15: end if
16: y j* k* ←1,S←S∪{ j* }
17: until (j*,k*)=(0,0)
18: return y

Table 4 Example Demands
customer i demand d i
1 4
2 9
3 11

Table 5 Example Capacities and Construction Costs
facility j scale level k capacity q jk construction cost f jk
1 1 4 10
1 2 8 70
2 1 4 35
2 2 8 50
3 1 5 10
3 2 10 60

21