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

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

We presented a parallel tabu search (PTS) algorithm for the traveling salesman problem (TSP), which is NP-hard. To parallelize tabu search (TS) algorithm efficiently, the search space decomposition based on partition principle was used to balance the computing load, while exploitation in subspace had been boosted by an adaptive search strategy of intensification and diversification. Numerical r...

In recent years, there has been a great deal of interest in metaheuristics in the optimization community. Tabu Search (TS) represents a popular class of metaheuristics. However, compared with other metaheuristics like genetic algorithm and simulated annealing, contributions of TS that deals with continuous problems are still very limited. In this paper, we introduce a continuous TS called Direc...

We present cycle-based algorithmic approaches to find local minima of a nonconvex and nonsmooth model for capacity expansion of a network supporting multicommodity flows. By exploiting complete optimality conditions for local minima, we give the convergence analysis of the negative-cost cycle canceling method. The cycle canceling method is embedded in a tabu search strategy to explore the solut...

Quadratic Assignment Problem (QAP) is an NPhard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP) and analyze their performance in terms of both runtime effici...

This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for thi...

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features tha...