In this paper tabu search for SAT is investi gated from an experimental point of view To this end TSAT a basic tabu search algorithm for SAT is introduced and compared with Selman et al Random Walk Strategy GSAT procedure in short RWS GSAT TSAT does not involve the ad ditional stochastic process of RWS GSAT This should facilitate the understanding of why simple local search methods for SAT work...

Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of the CPU and can be increased by proper use of the GPGPU, i.e. General-Purpose Computation Using Graphics Hardware. Modern graphics hardware, initially developed for computer graphics generation, appeared to be flexible...

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 reacting to the occurrence of cycles. In addition, if the search appears to be repeating an excessive number of solutions excessively often, then the ...

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper, we present two tabu search implementations, one involving an exhaustive search of the 2-opt neighborhood and the other involving an exhaustive search of the i...

We present a hybrid search technique based on metaheuristics for approximately solving the vehicle routing problem with time windows (VRPTW). The approach is two phased; a global customer clustering phase based on genetic algorithms (GAs) and a post-optimization local search technique based on tabu search (TS). We also devise a new crossover operator for the VRPTW and compare its performance wi...

A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. While there are many wellstudied methods to help the search process escape a basin of attraction, it seems more difficult to prevent it from looping between a limited number of basins of attraction. We introduce a Positi...

KULKARNI, GIRISH. A Tabu Search Algorithm for the Steiner Tree Problem. (Under the direction of Professor Yahya Fathi.) The Steiner Tree problem in graphs is an NP-hard problem having applications in many areas including telecommunication, distribution and transportation systems. We survey, briefly, a few exact methods and a few heuristic approaches that have been proposed for solving this prob...

A number of non-exhaustive search algorithms are presented. The methods are a c̀lassical’ genetic algorithm, a tabu search, an evolutionary strategy and stochastically repeated nearest and steepest-ascent hill-climbing algorithms. They are then used to determine optimum and good polarities for Reed± Muller canonical expansions of Boolean functions, and comparisons are drawn between the relative ...

The setting could have come from a Hollywood science fiction movie. A dozen figures, a handful in uniforms of the U.S. Strategic Air Command (SAC) and a slightly larger contingent variously in business suits and in shirtsleeves, were gathered around a large mainframe computer whose blinking lights signaled a run in progress. The computer run — on an early70s behemoth that represented the state-...

ion and decomposition (through explicit and attributive memory) Timing Recency of events Frequency of events Differentiation between short term and long term Quality and impact Relative attractiveness of alternative choices Magnitude of changes in structure or constraining Relationships Context Regional interdependence Structural interdependence Sequential interdependence Responsive Exploration...