Prev: 2D Gaussian Multipeak Fitting
Next: question about C MEX file
From: ratnaji vanga on 9 Aug 2010 03:37
Jurimaya_Surd <umerisb(a)hotmail.com> wrote in message <ef02976.1(a)webx.raydaftYaTP>...
> Finally its done .. i programmed it for 'Odyssey of Ulysses 22 node
> probelem' .. but it takes a lot of time to iterate coz of large no of
> cities .. sometimes it gets struck at local minima .. the best
> possable result achieved by my code is 79.55, while the best possable
> is 75.3, quite close .. still trying to optimize the code to make it
> run a lil faster .. if any one wants the code just message me ..
> comments will be appriciated.
hi...
i am also working on ant colony algorithm..
i am in d middle of my program..
plz send me ur coding if u can
thank you...
 | 
Pages: 1
Prev: 2D Gaussian Multipeak Fitting
Next: question about C MEX file