Parallel Adaptive Tabu Search for Large Optimization Problems
نویسندگان
چکیده
This paper presents a new approach for parallel tabu search based on adaptive par-allelism. Adaptive parallelism demonstrates that massively parallel computing using a hundred of heterogeneous machines is feasible to solve large optimization problems. The parallel tabu search algorithm includes diierent tabu list sizes and new intensiication/diversiication mechanisms. Encouraging results have been obtained in solving the quadratic assignment problem. We have improved the best known solutions for some large real-world problems. 1 Motivation and goals Many interesting combinatorial optimization problems are NP-hard, and then they cannot be solved exactly within a reasonable amount of time. Consequently, heuris-tics must be used to solve real-world problems. Tabu search (TS) is a general purpose heuristic (meta-heuristic) that has been proposed by Glover 1]. TS has achieved widespread successes in solving practical optimization problems in diier-ent domains (resource management, process design, logistics, telecommunications, ...). Promising results of applying TS to a variety of academic optimization problems (traveling salesman, quadratic assignment, time-tabling, job-shop scheduling, ...) are reported in the literature 2]. Solving large problems motivates the development of a parallel implementation of TS. The proliferation of powerful workstations and fast communication networks with constantly decreasing cost/performance ratio have shown the emergence of heterogeneous workstation networks and homogeneous clusters of processors (DEC Alpha farms, IBM SP/2, Cray T3D, CM-5, ...) as platforms for high performance computing. These parallel platforms are generally composed of an important park of machines shared by many users. Many parallel TS algorithms have been proposed in the literature. In general, they don't use advanced programming tools (load balancing, adaptive parallelism, checkpointing, ...) to eeciently use the machines. Most of them are developed for dedicated parallel homogeneous machines. Load analysis of networks of workstations during long periods of time showed that only a few percentage of the available power was used 3]]4]. There is a substantial amount of idle time. In addition, a workstation belongs to an owner who will not tolerate external applications degrading the performance of his machine. Therefore, dynamic adaptive scheduling of parallel applications is essential. Our aim is to develop a parallel adaptive TS strategy, which can beneet greatly from a platform having combined computing resources of massively parallel ma
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملParallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, and greedy randomized adaptive search procedures (GRASP) are discussed.
متن کاملA parallel adaptive tabu search approach
This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive parallelism was used to dynamically adjust the parallelism degree of the application with respect to the system load. Adaptive parallelism demonstrates that high-performance computing using a hundred of heterogeneous workstations combined with massively parallel machines is feasible to solve larg...
متن کاملAn Efficient Asynchronous Parallel Evolutionary Algorithm Based on Message Passing Model for Solving Complex Nonlinear Constrained Optimization
Abstract This study presents an asynchronous parallel evolutionary algorithm based on message passing model (MAPEA) for solving complex function optimization problems with constraints. The MAPEA combines a local search into the global search. The local search is based on Tabu search, and the radius of neighborhood is self-adaptive. The MAPEA is implemented in Parallel Virtual Machine (PVM) prog...
متن کامل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 ...
متن کامل