the reactive tabu search（反应性禁忌搜索）.pdfVIP

1 The Reactive Tabu Search ROBERTO BATTITI Dipartimento di Matematica and Istituto Nazionale di Fisica Nucleare, gruppo collegato di Trento, Universit`a di Trento, 38050 Povo (Trento), Italy, EMAIL: battiti@itnvax.science.unitn.it GIAMPIETRO TECCHIOLLI Istituto Nazionale di Fisica Nucleare, gruppo collegato di Trento and Istituto per la Ricerca Scientifica e Tecnologica, 38050 Povo (Trento), Italy, EMAIL: tec@irst.it We propose an algorithm for combinatorial optimization where an explicit check for the repetition of configurations is added to the basic scheme of Tabu search. In our Tabu scheme the appropriate size of the list is learned in an automated way by re- acting to the occurrence of cycles. In addition, if the search appears to be repeating an excessive number of solutions excessively often, then the search is diversified by making a number of random moves proportional to a moving average of the cycle length. The reactive scheme is compared to a ”strict” Tabu scheme, that forbids the repetition of configurations and to schemes with a fixed or randomly varying list size. From the implementation point of view we show that the Hashing or Digital Tree techniques can be used in order to search for repetitions in a time that is ap- proximately constant. We present the results obtained for a series of computational tests on a benchmark function, on the 0-1 Knapsack Problem, and on the Quadratic Assignment Problem. Preprint Dip. Matematica Univ. diTrento, October 1992 Final version: September 1993, toappear in: ORSA Journal on Computing Subject classification: Programming:integer, heuristic Other key words: tabu search, greedyheuristics, hashing, memory-based optimization R Battiti and G Tecchiolli - The Reactive Tabu Search