Synchronous Tabu Search
نویسندگان
چکیده
We study and compare synchronous parallelization strategies for tabu search. We identify the most promising parallelization approaches, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: length of the synchronization steps, number of processors, handling of exchanged information, etc. Parallelization approaches are implemented and compared by using a tabu search algorithm for multicommodity location-allocation problems with balancing requirements.
منابع مشابه
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملApproximation algorithms for the design of SDH/SONET networks
In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.
متن کاملA Case Study on Parallel Synchronous Implementations for Tabu Search Based on Neighborhood Decomposition
We study in this paper diierent synchronous strategies for the parallel implementation of tabu search on a parallel machine. The task scheduling problem on heterogeneous processors under precedence constraints is used as the framework for the development, implementation, validation, and performance evaluation of diierent parallel strategies. Several strategies are proposed, discussed and compar...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملParallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints
This paper presents parallelization strategies for a tabu search algorithm for the task scheduling problem on heterogeneous processors under task precedence constraints. Par-allelization relies exclusively on the decomposition of the solution space exploration. Four diierent parallel strategies are proposed and implemented on an asynchronous parallel machine under PVM: the master-slave model, w...
متن کامل