Information Technology Reference
In-Depth Information
Table 6.14. Insert Mutation
j
1
2
3
4
5
X i
n j
3
5
2
1
4
π j
12
23
8
4
19
X i
n j
3
5
2
1
4
π j
12
22
8
4
19
6.2.8
DDE Update Operations
To figure out how the individuals are updated in the DDE algorithm, an example using
the GTSP instance in Table 6.2 is also illustrated through Table 6.15 and Table 6.18.
Assume that the mutation and crossover probabilities are 1.0, the two-cut PTL crossover
Table 6.15. An Example of Individual Update
j
1
2
3
4
5
X i
n j
3
5
2
1
4
π j
12
23
8
4
19
G i
n j
3
1
5
2
4
π j
15
4
24
7
17
Table 6.16. Insert Mutation
j
1
2
3
4
5
X i
n j
3
1
5
2
4
π j
15
4
24
7
17
G i
n j
3
1
5
2
4
π j
15
4
25
7
17
Table 6.17. Two-Cut PTL Crossover
j
1
2
3
4
5
X i
n j
3
5
2
1
4
π j
12
23
8
4
19
G i
n j
3
1
5
2
4
π j
15
4
25
7
17
U i
n j
2
1
3
5
4
π j
8
4
15
25
17
Search WWH ::




Custom Search