Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!galileo.cc.rochester.edu!uhura.cc.rochester.edu!mehta
From: mehta@uhura.cc.rochester.edu (Tushar Mehta)
Subject: Re: Taboo Search Algorithm: Anyone care to explain?
Message-ID: <1995Feb25.045848.14951@galileo.cc.rochester.edu>
Sender: news@galileo.cc.rochester.edu
Nntp-Posting-Host: uhura.cc.rochester.edu
Organization: University of Rochester - Rochester, New York
References: <3iipck$t7p@pith.uoregon.edu>
Date: Sat, 25 Feb 95 04:58:48 GMT
Lines: 28

You might want to try Modern Heuristic Techniques for Combinatorial
Problems, Edited by Colin Reeves, published by Halsted Press, 1993.  I found
it to be a good intro to Simulated annealing, Tabu search, GA, and Artificial
Neural Networks

Regards,

Tushar Mehta

In <3iipck$t7p@pith.uoregon.edu> ben@chinook.uoregon.edu (Ben Marcotte) writes:


>A recent issue of Science contained an article discussing the merits of a 
>global optimization scheme called the Taboo Search (TS) algorithm.  The 
>description of the method was a bit choppy and I would like to hear from 
>anyone who has any understanding of TSA's. 

>I did find it interesting that in the paper, they discuss GA's in the 
>introduction and then again at the end of the paper but nowhere in the 
>results or data comparing TS to other methods.  They did inlcude some 
>data from Simulated Annealing but it would be no surprise to me that a 
>method could produce better results than SA but not as good as a GA.

>Thanks all,
>Ben Marcote (still looking for the Holy Grail of Global Optimization)
>==============================================================================
>Ben Marcotte               ben@chinook.uoregon.edu              (503) 346-4592
>==============================================================================
