A parallel adaptive tabu search approach

Abstract 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 large optimization problems. The parallel tabu search algorithm includes different tabu list sizes and new intensification/diversification 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]  Jean-Marc Geib,et al.  A New Approach for Checkpointing Parallel Application , 1997, PDPTA.

[2]  David Kaminsky.  Adaptive parallelism with Piranha , 1995 .

[3]  Miron Livny,et al.  Parallel Processing on Dynamic Resources with CARMI , 1995, JSSPP.

[4]  Celso C. Ribeiro,et al.  Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints , 1996, J. Heuristics.

[5]  David A. Nichols,et al.  Using idle workstations in a shared computing environment , 1987, SOSP '87.

[6]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[7]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[8]  E. Talbi,et al.  MARS * : Adaptive scheduling of parallel applications in a multi-userheterogeneous environmentZ , 1996 .

[9]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[10]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[11]  Paul R. Woodward.  Perspectives on Supercomputing: Three Decades of Change , 1996, Computer.

[12]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[13]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[16]  Michel Gendreau,et al.  A PARALLEL TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 1997 .

[17]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[18]  Michel Gendreau,et al.  TOWARDS A TAXONOMY OF PARALLEL TABU SEARCH ALGORITHMS. , 1993 .

[19]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[20]  Marvin Theimer,et al.  Finding idle machines in a workstation-based distributed system , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[21]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[22]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[23]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[24]  Miroslaw Malek,et al.  Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .

[25]  Jens Clausen,et al.  Joining forces in solving large-scale quadratic assignment problems in parallel , 1997, Proceedings 11th International Parallel Processing Symposium.

[26]  Stefan Voß,et al.  Tabu Search: Applications and Prospects , 1993 .

[27]  Jadranka Skorin-Kapov,et al.  Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..

[28]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[29]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.