The genomic median problem is an optimization problem inspired by a biological issue: it aims to find the chromosome organization of the common ancestor to multiple living species. It is formulated as the search for a genome that minimizes a rearrangement distance measure among given genomes. Several attempts have been reported for solving this NP-hard problem. These range from simple heuristic...

A tabu search algorithm is proposed for the codebook generation in vector quantization. The key question is the definition of neighboring solution. Making random modifications to the current solution is not sufficient alone. The proposed algorithm first makes non-local changes to the codebook which is then fine-tuned by the generalized Lloyd algorithm (GLA). For a set of gray scale images, the ...

In this paper, a hybrid TS-DE algorithm based on Tabu search and differential evolution algorithm is proposed to solve the reliability redundancy optimization problem. A differential evolution algorithm is embedded in Tabu search algorithm. TS is applied for searching solutions space, and DE is used for generating neighborhood solutions. The advantages of both algorithms are considered simultan...

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling throu...

Assigning cells to switches in cellular mobile networks is an NP-hard problem which, for realsize mobile networks, could not be solved by using exact methods. In this context, heuristic approaches like genetic algorithms, tabu search and simulated annealing can be used. This paper proposes a comparative study of three heuristics—tabu search, simulated annealing and Parallel Genetic Algorithms w...

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...

Software testing is a very important phase in the development of software. Testing includes the generation of test cases which, if done manually, is time consuming. To automate this process and generate optimal test cases, several meta-heuristic techniques have been developed. These approaches include genetic algorithm, cuckoo search, tabu search, intelligent water drop, etc. This paper present...

A new hybrid optimization method, combining Continuous Ant Colony System (CACS) and Tabu Search (TS) is proposed for minimization of continuous multiminima functions. The new algorithm incorporates the concepts of promising list, tabu list and tabu balls from TS into the framework of CACS. This enables the resultant algorithm to avoid bad regions and to be guided toward the areas more likely to...

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

6 This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which 7 service requests arrive in real time. The hybrid algorithm combines an exact constraint 8 programming algorithm and a tabu search heuristic. An important component of the tabu 9 search heuristic consists of three scheduling procedures which are executed sequentially. 10 Experiments show that the constraint...