Talk:Tabu search

How about some examples, please?

--84.9.90.34 14:19, 18 December 2006 (UTC)

I found this article because an episode of Numb3rs was talking about it, and I can't understand a single thing aside from "it's a way to search" :P —Preceding unsigned comment added by 72.66.188.19 (talk) 15:45, 23 October 2008 (UTC)

:Many things are complicated and take study and time to understand. This is not a satisfactory explanation for adding a technical tag. --C S (talk) 12:08, 25 October 2008 (UTC)

It's just simulated annealing with a memoization step.

MrOllie, why was my Drools Planner link removed, while the Paradiseoo link wasn't removed?

Drools Planner is a production ready (and used) metaheuristics framework, including a tabu search and simulated annealing implementation.

The source code is open source code, and commercial/academy/... friendly under the ASL license.

The Drools Planner blog has comparisons between tabu search and simulated annealing performance and Drools Planner finished 4th in the international timetabling competition 2007. —Preceding unsigned comment added by Ge0ffrey de smet (talk • contribs) 18:28, 1 August 2010 (UTC)

:You're right, Paradiseoo probably doesn't belong either. I've removed that, too. - MrOllie (talk) 18:33, 1 August 2010 (UTC)

What's the reasoning that implementations with source code don't belong there? I expect users to look for production source code?

Would a link to a tabu search and simulated annealing comparison be accepted?

http://blog.athico.com/2010/07/simulated-annealing-new-algorithm-for.html —Preceding unsigned comment added by Ge0ffrey de smet (talk • contribs) 18:39, 1 August 2010 (UTC)

:We don't link to blogs, see WP:ELNO point 11. We generally don't link to suppliers either, even if their products are free or open source. - MrOllie (talk) 18:43, 1 August 2010 (UTC)

Too bad, I found the ParadiseOO link very useful: I hadn't heard of their project yet and welcome an algorithm and terminology comparison with them.

If you ever change your mind about the suppliers, you 'll want to link JBoss's Drools Planner, Unitime's CPSolver and ParadiseOO.

Note that the "operation systems" page does link Linux, Windows and Mac. —Preceding unsigned comment added by Ge0ffrey de smet (talk • contribs) 18:56, 1 August 2010 (UTC)

I've cleaned up the related links, attempted to categorise them to give them context, and deleted some links that were weakly related to tabu search (they can be found through sub-pages in the remaining links - this also helps to reduce confusion from users thinking that a particular technique is more related to tabu search than it in fact is). Comments welcome. Jr271 (talk) 18:18, 27 March 2011 (UTC)

The idea of the tabu search is to accept the best neighboring solution even if it's not better than the current best solution. The pseudo-code presented here is equivalent to a simple hill climbing algorithm (find a better solution and move to it). Note that the algorithm is also wrong in the cited book!

--84.227.228.172 (talk) 11:06, 22 April 2012 (UTC)

The fitness function is generally a mathematical function, which returns a score or the aspiration criteria are satisfied — for example, an aspiration criterion could be considered as a new search space is found)

Missing (? Or not deleted )? Jumpow (talk) 21:48, 15 January 2019 (UTC)

At line 7 of the pseudocode we have this: bestCandidate ← sNeighborhood[0]

But it doesn't check if sNeighborhood[0] is in the tabuList. If sNeighborhood[0] happens to be the best solution, but it already is in the tabuList then it gets choosen anyway.

Tsojtsoj (talk) 17:24, 3 March 2021 (UTC)