Majalah Ilmiah UNIKOM

**Vol.8, No. 1**

11

H a l a m a n

Muhammad Aria

distance 2.25% over SA and 3.09% over GA.

Especially for larger sets of data, GA im-

proves the distance 3.19% over SA and

4.66% over GA.

The standard deviations from AG solution

are relative small, so we can expect to

achieve average performance easily. But AG

computation time is more complex than

(a)

(b)

(c)

Figure 8. Example TSP Problem: PR1002

(a) Distribution City from PR1002

(b) Known Optimal Solution

(c) Best Solution found by us

both SA and GA algorithm, so AG takes 6.47

times slower than SA and 1.3 times than GA

algorithm. In application, AG needs 13.88

bytes units of memory, while SA only needs

10.67 bytes unit memory and GA algorithm

needs 31.33 bytes units memory.

Download: **PDF**

Copyright © 2011 Unikom Center

Copyright © 2011 Unikom Center