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...

In this paper we propose a parallel tabu search algorithm based on the consecutive tabu algorithm constructed by us earlier to solve the problem of the distributed database optimal logical structure synthesis. Also we provide a reader with some information about the performance of our new parallel algorithm and the quality of the solutions obtained with help of it.

Flowshop scheduling deals with the sequencing of a set of jobs that visit a set of machines in the same order. A tabu search procedure is proposed for the flowshop scheduling problem with the makespan minimization criterion. Different from other tabu search procedures, the neighborhood of a solution is generated using a combination of three different exchange mechanisms. This has resulted in a ...

The Multiple Sequence Alignment problem is considered to be an NP-Hard problem, requiring initially a specific encoding schema and design, as for any other of its siblings, implement run the main categories heuristic. This paper intends discuss our proposed generic implementation Tabu Search algorithm, heuristic procedure by Fred Glover solve discrete combinatorial optimization problems. In thi...

This thesis focuses on designing automatic planning tools for the planning problem of 3rd Generation (3G) Universal Mobile Telecommunication System (UMTS) all-IP Release 4 networks. A new mathematical model for the design problem of such architecture was proposed. The main advantage of the proposed model is to incorporate a realistic traffic profile taken from real live networks. Two approximat...

This paper models the sea port system with the objective of determining the optimal storage strategy and container-handling schedule. It presents an iterative search algorithm that integrates a container transfer model with a container location model in a cyclic fashion to determine both optimal locations and corresponding handling schedule. A genetic algorithm, a tabu search and a tabu search/...