K = 1, 2, 3, 4, 5, 6

STEP 1 :

Solusi Optimum
S
f1(s)= cx1,s X1*
1 5 1
2 3 1

STEP 2 :
F2(s) = f1(x2) + cx2,s Solusi Optimum
X2S
1 2 F2(s) X2*
3 6 - 6 1
4 8 11 8 1
5 11 10 10 2
6 - 9 9 2

STEP 3 :
F3(s) = f2(x3) + cx3,s Solusi Optimum
X3S
3 4 5 6 F3(s) X3*
7 12 11 - - 11 4
8 14 13 13 17 13 4 atau 5
9 - - 13 13 13 5 atau 6

STEP 4 :
F4(s) = f3(x3) + cx4,s Solusi Optimum
X4S
7 8 9 F4(s) X4*
10 13 - - 13 7
11 15 14 16 14 8
 12 - 15 16 15 8

STEP 5 :
F5(s) = f4(x4) + cx5,s Solusi Optimum
X5S
10 11 12 F5(s) X5*
13 16 19 21 16 10
14 18 16 19 16 11

STEP 6 :
F6(s) = f5(x5) + cx6,s Solusi Optimum
X6S
13 14 F6(s) X6*
15 20 19 19 14

STEP 7 : Rekontruksi Solusi Optimal

Jadi terdapat tiga lintasan terpendek dari 0 ke 15, yaitu :
1. 0 – 1 – 4 – 8 – 11 -14 -15
2. 0 – 1 – 5 – 8 – 11 -14 -15
3. 0 – 1 – 4 – 7 – 10 -14 -15