Three heuristic algorithms: simulated annealing, genetic algorithm, and Tabu search were compared to molecular docking procedure using 3 protein-ligand systems. Statistical analysis of the results indicated that the Tabu search showed the best performance in terms of locating solutions close to the crystallographic ligand conformation. From the comparisons, a hybrid search algorithm was propose...

Given an undirected graph with weights associated with its nodes, the Steiner tree problem consists in nding a minimum weight subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe an improved tabu search algorithm for the Steiner problem in graphs, based on a neighborhood deened by insertions and eliminations of Steiner nodes. Move estimations, ...

To realize the integration of process planning and scheduling (IPPS) in the manufacturing system, a particle swarm optimization (PSO) algorithm is utilized. Based on the general PSO (GPSO) model, one GPSO algorithm is projected to solve IPPS. In GPSO, crossover and mutation operations of genetic algorithm are respectively used for particles to exchange information and search randomly, and tabu ...

In this paper we describe a scheduling problem for certain types of tournaments. It is formulated as a discrete minimization problem. Using a tabu search method we solve various problem instances of di erent size and complexity. The in uence of the tabu list size on the performance of the algorithm is studied. Tabu search is also compared with previous optimization techniques, which are availab...

Cryptology is a thriving research area of great practical importance. It is a fundamental building block of communications security. Cryptographic techniques currently being utilized in the field of communication. This paper presents an approach for the heuristic search procedures for cryptanalysis and development of enhanced cryptographic techniques. To implement the proposed Tabu search, Gene...

With the fast evolution of real time and multimedia applications, some quality of service (QoS) constraints need to be guaranteed in the underlying network. In this paper, we present a new method for least-cost QoS multicast routing problem based on genetic algorithm and tabu search. This problem has been proven to be NP-complete. The proposed genetic tabu search algorithm (GTS) combine Genetic...

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search...

The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics and combinatorial optimization. It is also considered as the class of the NPcomplete combinatorial optimization problems. By literatures, many algorithms and approaches have been launched to solve such the TSP. However, no current algorithms that can provide the exactly optimal solu...

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

In this paper the linear ordering problem with cumulative costs is approached. The best known algorithm solution for the problem is the tabu search proposed by Duarte. In this work an experimental study was performed to evaluate the intensification and diversification balance between these phases. The results show that the heuristic construction phase has a major impact on the tabu search algor...