In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although propos...

In this paper we present a classi cation of parallel tabu search metaheuristics based, on the one hand, on the control and communication strategies used in the design of the parallel tabu search procedures and, on the other hand, on how the search space is partitionned. These criteria are then used to review the parallel tabu search implementations described in the literature. The taxonomy is f...

This article explores the meta-heuristic approach called tabu search, which is dramatically changing our ability to solve a host of problems in applied science, business and engineering. Tabu search has important links to evolutionary and “genetic” methods, often overlooked, through its intimate connection with scatter search and path relinking — evolutionary procedures that have recently attra...

Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack ...

Tabu search, an iterative discrete optimization technique which is widely used in the Operations Research community is virtually unknown in Computer Vision and related elds. This paper aims to ll this gap by introducing tabu search through two simple examples and then by describing an implementation of tabu search in a robot vision task. In this task the robot has to take away unmodeled objects...

The naïve tabu search (NTS) has been enhanced with two adaptive mechanisms namely back-tracking and adaptive search radius. The proposed search is called adaptive tabu search (ATS). The paper provides convergence and performance analyses of the ATS.

The quadratic assignment problem (QAP) is one of the nondeterministic polynomial (NP)-hard combinatorial optimization problems. One of the heuristic algorithms for the QAP is tabu-search. Exponential tabusearch, which is one of improved versions of the tabu search, was proposed using a neural network, and it was further extended to chaotic tabu search with a chaotic neural network. Chaotic dyna...

Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...

In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NP-hard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although propo...

in this paper a guided tabu search (gts) is utilized for optimal nodal ordering of finite element models (fems) leading to small profile for the stiffness matrices of the models. the search strategy is accelerated and a graph-theoretical approach is used as guidance. the method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. comp...