In order to improve the efficiency of test data generation during the software test, many studies have been focusing on the automation of test data generation with metaheuristic techniques such as genetic algorithm and tabu search etc. This paper proposes a hybrid algorithm in combination with genetic algorithm with tabu search to generate the test data based on decision coverage criteria. The ...

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

Tabu search (TS) has provided advances for solving difficult optimization problems in many domains. At the same time, fundamental TS strategies are often not applied as effectively as they might be, and their underlying rationale is often not completely understood. We examine basic concepts and principles of tabu search, emphasizing those that have sometimes led to applying the label "adaptive ...

In this paper the problem of designing optimal logical topologies for WDM networks using the tabu search meta-heuristic has been considered. For a given physical topology and requests for data communication at specified rates between different pairs of nodes in the network, our objective is to obtain a logical topology, using the tabu search, to minimize the network congestion.

We analyze the possibility of parallelizing the Traveling Salesman Problem over the MapReduce architecture. We present the serial and parallel versions of two algorithms Tabu Search and Large Neighborhood Search. We compare the best tour length achieved by the Serial version versus the best achieved by the MapReduce version. We show that Tabu Search and Large Neighborhood Search are not well su...

In this paper we present a Genetic Algorithm (GA) with problem-specific operators for the layered digraph drawing problem and compare it with two very different meta-heuristics: Tabu search and Multi-start descents. Tabu search has previously proved to be better than the classical deterministic local heuristic often employed in graph drawing. Here, we show on a set of 282 medium-sized graphs th...

Now-a-days different meta-heuristic approaches, their variants and hybrids are being applied for solving Combinatorial Optimization Problems (COP). In this paper Resource Constrained Project Scheduling Problem (RCPSP) has been presented as a COP. This is a common problem for many construction projects. It is highly constrained and is categorized as a NP-hard problem. In our earlier work Simulat...

This paper presents a new and efficient Tabu search procedure to solve the Resource-Constrained, Project-Scheduling problem with either single or multiple execution modes and with variable resource availability. It investigates the efficiency of some neighborhood structures and of bounds used to reduce the computational time. Results show that the proposed Tabu search provides the bestknown sol...