tag:blogger.com,1999:blog-6314876008291942531.post7305370612860229539..comments2024-01-14T00:36:43.430-08:00Comments on Antonio Gulli's coding playground: Simulated AnnealingUnknownnoreply@blogger.comBlogger8125tag:blogger.com,1999:blog-6314876008291942531.post-24566618820484272222012-07-04T10:59:06.299-07:002012-07-04T10:59:06.299-07:00I've written a post on my blog where I show a ...I've written a post on my blog where I show a method to improve the accuracy of SA through a transformation of the matrix cost<br />http://textanddatamining.blogspot.it/2012/07/simulated-annealing-how-to-boost.html<br />I hope it could be helpful to your followers.<br />cheers<br />cristian mesianoCristian Mesianohttps://www.blogger.com/profile/04880057603671195464noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-40366483958640461102011-07-09T20:42:02.661-07:002011-07-09T20:42:02.661-07:00Thanks for the introduction to simulated annealing...Thanks for the introduction to simulated annealing. I've linked through from a recent post of mine about the importance of finding the global minimum (over the local minimum) when analysing problems in Business Analysis:<br />http://www.darrensmith.com.au/discovering-the-optimal-solution/Darrenhttps://www.blogger.com/profile/11535029270795389964noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-57642059863713849722010-07-21T03:50:44.564-07:002010-07-21T03:50:44.564-07:00I 've done a comparison between simulated anne...I 've done a comparison between simulated annealing and tabu search for the nurse rostering competition problem:<br />http://blog.athico.com/2010/07/simulated-annealing-new-algorithm-for.htmlGeoffrey De Smethttps://www.blogger.com/profile/10118333179703404539noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-57645496987114498322009-12-06T09:09:41.991-08:002009-12-06T09:09:41.991-08:00thanks. That's one well written piece of code....thanks. That's one well written piece of code.Unknownhttps://www.blogger.com/profile/08559798036637583281noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-22096619703650684162009-05-07T09:29:00.000-07:002009-05-07T09:29:00.000-07:00wanted to know how to use this algorithm in optimi...wanted to know how to use this algorithm in optimisationAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-36713324583274638552009-03-31T01:59:00.000-07:002009-03-31T01:59:00.000-07:00thanksthankscodingplaygroundhttps://www.blogger.com/profile/08478993186814330588noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-29801016919133845132009-03-27T09:24:00.000-07:002009-03-27T09:24:00.000-07:00Also... I made the random update step proportional...Also... I made the random update step proportional to the size of the current entry:<BR/><BR/>Essentially, changed:<BR/><BR/>vecb[i] += step;<BR/><BR/>to: <BR/><BR/>vecb[i] = (1.+step)*vecb[i];<BR/><BR/>The code now gets to a cost around 1.e-16 before the iterations finish.jimmy_hchttps://www.blogger.com/profile/08702729632525419265noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-71873973813847901372009-03-27T08:55:00.000-07:002009-03-27T08:55:00.000-07:00Hi,I changed abs to fabs in your cost function. T...Hi,<BR/><BR/>I changed abs to fabs in your cost function. The minimization seemed to work a bit better. Thanks for your code snippet.jimmy_hchttps://www.blogger.com/profile/08702729632525419265noreply@blogger.com