Metode Mutation

Peneliti Problem Algoritma Populasi N Hasil

Pengukuran Rate

-2383 Iterasi
Jumlah 10 -125 Iterasi
Sarkar dan N- Iterasi 3 Genetic -251 Iterasi
1000
Nag Queens solusi Algorithm -1431 Iterasi
optimal N 25 -382 Iterasi
-281 Iterasi
Waktu rata- 8 554.48 s
rata evaluasi HGA
Heris dan N- 512 1152110.00 s
fitness
Oskoei Queens 8 48522.00 s
function GA
setiap N 512 *
5 255299/0
BBO 50 0.08
200 9828/4
Compare 5
Habiboghli N- 0175/0
execution GA 50 0.08
dan Jalali Queens 200 4107/0
time
5 036943/0
PSO 50 0.08
200 8218/1
Best Tour
20 Cities
425.2955
GA 10
Best Tour
100 Cities
2092.9098
Best Tour
Compare 20 Cities
516.6587
time PSO 10
Best Tour
complexity 100 Cities
Saraei dan 3709.4103
TSP algorithm, Best Tour
Mansouri 20 Cities
Best tour 610.0944
with GA, FA 10
Best Tour
PSO, FA. 100 Cities
3556.4732
20 Cities Best Tour
388.1824
Greedy FA 10
Best Tour
100 Cities
827.0897
8 0
BA
500 330
Al-Gburi, N- Compare 8 0
GA
dkk Queens penalty cost 500 384
8 0
BA-GA
500 272
Optimal Loc 1 64
Ismail, Firefly
KTP value of best 20
dkk. Algorithm Loc 16 63
found.