Information Technology Reference
In-Depth Information
k =8 in the first slot
Ta b l e 6 . 4 . Insertion of node π
j
1
2
3
4
5
n j
2
3
1
5
4
π j
8
14
5
22
16
d π j π j +1
d 8 , 14
d 14 , 5
d 5 , 22
d 22 , 16
d 16 , 8
Remove = d π 4 π 1 = d 16 , 14
Add = d π u π k + d π k π v = d 14 , 8 + d 8 , 5
F (
)= F π
D + Add
π
Remove
F (
π
)= d 14 , 5 + d 5 , 22 + d 22 , 16 + d 16 , 14 + d 8 , 14 + d 16 , 8
d 16 , 14
F (π)= d 14 , 5 + d 5 , 22 + d 22 , 16 + d 8 , 14 + d 16 , 8
R
k
D
B
Insertion of node,pair
π
in the last position of the partial tour
π
a
Remove = d
D
1
m π
π
b
Add = d
k + d
m π
k π
1
π
π
D are fit-
ness function values of the tour after insertion and the partial tour,
respectively.
)= F π
D + Add
) and F π
b
F (
π
Remove ,where F (
π
k =8 in the last slot
Ta b l e 6 . 5 . Insertion of node π
j
1
2
3
4
5
n j
3
1
5
4
2
π j
14
5
22
16
8
d π j π j +1
d 14 , 5
d 5 , 22
d 22 , 16
d 16 , 8
d 8 , 14
Remove = d π 4 π 1 = d 16 , 14
Add = d π 4 π k + d π k π 1 = d 16 , 8 + d 8 , 14
F (π)= F π
D + Add
Remove
F (
π
)= d 14 , 5 + d 5 , 22 + d 22 , 16 + d 16 , 14 + d 16 , 8 + d 8 , 14
d 16 , 14
F (
π
)= d 14 , 5 + d 5 , 22 + d 22 , 16 + d 16 , 8 + d 8 , 14
k between the edge π
v
u ,
C
Insertion of node
π
π
a
Remove = d
u
v
π
π
b
Add = d
k + d
u
k π
v
π
π
π
D are fitness
function values of the complete and the partial solutions respectively.
)= F π
D + Add
) and F π
b
F (
π
Remove ,where F (
π
Remove = d π u π v = d 14 , 5
Add = d π u π k + d π k π v = d 14 , 8 + d 8 , 5
F (
)= F π
D + Add
π
Remove
Search WWH ::




Custom Search