A parallel adaptive tabu search approach

Parallel Computing

Volumn 24, Issue 14, 1998, Pages 2003-2019

  Talbi, E G ^a   Hafidi, Z ^a   Geib, J M ^a  

^a UNIV LILLE   (France)

Author keywords

Adaptive parallelism; Quadratic assignment problem; Tabu search

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTER WORKSTATIONS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING;

ADAPTIVE PARALLELISM; QUADRATIC ASSIGNMENT PROBLEM; TABU SEARCH;

PARALLEL PROCESSING SYSTEMS;

EID: 0032295173     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(98)00086-6     Document Type: Article

References (30)

1. F. Glover, Tabu search - Part I, ORSA Journal of Computing 1 (3) (1989) 190-206.
2. F. Glover, M. Laguna, Tabu search, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1992, pp. 70-150.
3. N. Boden, D. Cohen, R. Felderman, A. Kulawik, C. Seitz, J. Seizovic, W. Su, Myrinet - A gigabit-per-second local-area network, IEEE Micro (1995) 29-36.
4. P.R. Woodward, Perspectives on supercomputing: Three decades of change, IEEE Computer (1996) 99-111.
5. D.A. Nichols, Using idle workstations in a shared computing environment, ACM Operating System Review 21 (5) (1987) 5-12.
6. M.M. Theimer, K.A. Lantz, Finding idle machines in a workstation-based distributed system, IEEE Transactions on Software Engineering 15 (11) (1989) 1444-1458.
7. F. Glover, E. Taillard, D. de Werra, A user's guide to tabu search, Annals of Operations Research 41 (1993) 3-28.
8. A. Hertz, D. de Werra, The tabu search metaheuristic: How we use it? Annals of Mathematics and Artificial Intelligence (1989) 111-121.
9. S. Voss, Tabu search: Applications and prospects, Technical report Technische Hochshule Darmstadt, Germany, 1992.
10. T.D. Crainic, M. Toulouse, M. Gendreau, Towards a taxonomy of parallel tabu search algorithms, Technical Report CRT-933, Centre de Recherche sur les Transports, Université de Montreal, 1993.
11. E. Taillard, Parallel iterative search methods for vehicle routing problem, Networks 23 (1993) 661-673.
12. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Computing 17 (1991) 443-455.
13. J. Chakrapani, J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem, Annals of Operations Research 41 (1993) 327-341.
14. M. Malek, M. Guruswamy, M. Pandya, H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Annals of Operations Research 21 (1989) 59-84.
15. C. Rego, C. Roucairol, A parallel tabu search algorithm using ejection chains for the vehicle routing problem, in: Proc. of the Metaheuristics Int. Conf., Breckenridge, 1995, pp. 253-295.
16. P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin, E. Taillard, A parallel tabu search heuristic for the vehicle routing problem with time windows, RR CRT-95-84, Centre de Recherche sur les Transports, Université de Montréal, 1995.
17. S.C.S. Porto, C. Ribeiro, Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints, Journal of heuristics 1 (2) (1996) 207-223.
18. T.L. Casavant, J.G. Kuhl, A taxonomy of scheduling in general-purpose distributed computing systems, IEEE Transactions on Software Engineering 14 (2) (1988) 141-154.
19. D.L. Kaminsky, Adaptive parallelism in Piranha, Ph.D. thesis, Department of Computer Science, Yale University, RR-1021, 1994.
20. J. Pruyne, M. Livny, Parallel processing on dynamic resources with CARMI, in: Proc. of the Workshop on Job Scheduling for Parallel Processing IPPS'95, Lecture Notes On Computer Science, No.949, Springer, Berlin, 1995, pp. 259-278.
21. Z. Hafidi, E.G. Talbi, J.-M. Geib, MARS: Adaptive scheduling of parallel applications in a multi-user heterogeneous environment, in: European School of Computer Science ESPPE'96: Parallel Programming Environments for High Performance Computing, Alpe d'Huez, France, 1996, pp. 119-122.
22. T.C. Koopmans, M.J. Beckmann, Assignment problems and the location of economic activities, Econometrica 25 (1957) 53-76.
23. M. Garey, D. Johnson, Computers and Intractability: A guide to the theory on NP-completeness, Freeman, New York, 1979.
24. S. Sahni, T. Gonzales, P-complete approximation problems, Journal of the ACM 23 (1976) 556-565.
25. A. Brungger, A. Marzetta, J. Clausen, M. Perregaard, Joining forces in solving large-scale quadratic assignment problems in parallel, in: A. Gottlieb (Ed.), 11 th Int. Parallel Processing Symposium, Geneva, Switzerland, Morgan Kaufmann, Los Altos, CA, 1997, pp. 418-427.
26. P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: A survey and recent developments, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 1-42.
27. E. Taillard, Comparison of iterative searches for the quadratic assignment problem, Location Science 3 (1995) 87-103.
28. M.M. Eshagian, Heterogeneous computing, Artech House, MA, 1996.
29. C. Fleurent, J.A. Ferland, Genetic hybrids for the quadratic assignment problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 173-188.
30. D. Kebbal, E.G. Talbi, J.-M. Geib, A new approach for check pointing parallel applications, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications PDPTA'97, LasVegas, USA, 1997, pp. 1643-1651.