Penerapan Algoritma Semut pada Peyelesaian Travelling Salesman Problem (TSP) dengan MAtlab 7.0.1.

vrf,rvi!.ro&rMaEP)

v'l;

n6N(AN M^

n,\or0.r

qildi

y0s

I !+d{$l
5trr hioi $n &hn nqdijdu bFer dri sq n4ui! sne
o&ui'4'9qFfueP!,@?4'
etu5iq'imd si4

hF

,rd du Bmstrhn

ru

bnkud:BP,&41!J4,'ry'@t

i/eJ@}4&F'!rdei|tr!$j!
Ficlruo nssnimsie&GF kdi

'!r

ke hoy. iiksiuqirkri

doi

khGnlrlhkFr4]d]kthsiG
q{i(dtsdnbagra'hise

si*s krNhn &!n no{iub! jr
Firdqi ilhr rrydcl !6 D4jdi
rrdqq uhr nquj!*{j!iu yra dq ! rnFi.

d

Akqlna saNl

gito

d.aFkn

!to

eBUa shd &Fr &kdi

nr*e

etr $ilnkh

qruki jlrur

N[datr

rrdd d&i ,ur!
o4ud6 Flrjlkrqryd! d&

rir!! edd ld

NmDh

$junhi oms. H4 didu/1r,,,
14 iidniF I drire fnd& il
di Fojtu4 nr hi rnir h4q
ilu rEd
nqsdh nu

Dd

D-qedfG

rarg

d

4r Da iu !q

d

jlo d kb r4!! er r

q jns djrdGi Fe F@6!

is' 5 E'is, ldF ira[ ! nrL^ h !

d

snd xber dd

$tu ndo&

rt@ iry tuhlNt tuu.

hdiir

trsP)

dapd

*ni4s

direqkd d.lm nhrlHitutr

dip@hi

jd r4 &! i&

$du

@f'Mdhb$b@id!'pahi!@n.

iblndi4|bFo$Iiosqcruud
Prds

Fidirim shijuhF dn!@ka

ud

op'imr ddm

sd.ii iu !d. @dii4 ersjftF

ile

Donbdhgkun.bdekui$ikFig*

jwh i ps

hbih

trt Anh

A

R Nr tuan. L w6nmo

ri4

rk sadt

o)

b. NiFhsi

De.

a! M4hr

Ph@

c4, ner !!d apiatb$ b Ewtuta3 d

t4t Dqieo M etr L

Ir1

KA!o@{. s un

r6tM$r Rradi

L7l

tui0,i

R.

H.

P!n.o! ao

r$ k@drhrnk

tu B Mdie
^

e,€@1, c,o? 5''d, /,.s/ \1s\ [ihiJL r !dfLd.
t3t

siD i&

he

Roni..4k.

ro4l/@k r,e