论文信息 - Joining forces in solving large-scale quadratic assignment problems in parallel

Joining forces in solving large-scale quadratic assignment problems in parallel

Program libraries are one way to make the cooperation between specialists from various fields successful: the separation of application-specific knowledge from application independent tasks ensures portability, maintenance, extensibility, and flexibility. This paper demonstrates the success in combining problem-specific knowledge for the quadratic assignment problem (QAP) with the raw computing power offered by contemporary parallel hardware by using the library of parallel search algorithms ZRAM. The solutions of 10 previously unsolved large standard test-instances of the QAP are presented.

[1] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[2] Jürg Nievergelt,et al. The parallel search bench ZRAM and its applications , 1999, Ann. Oper. Res..

[3] Catherine Roucairol,et al. A New Exact Algorithm for the Solution of Quadratic Assignment Problems , 1994, Discret. Appl. Math..

[4] M. Bazaraa,et al. A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .

[5] D. Knuth. Estimating the efficiency of backtrack programs. , 1974 .

[6] Catherine Roucairol,et al. BOB : a Unified Platform for Implementing Branch-and-Bound like Algorithms , 1995 .

[7] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[8] Jens Clausen,et al. Solving Large Quadratic Assignment Problems in Parallel , 1997, Comput. Optim. Appl..

[9] L. G. Mitten. Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..

[10] Franz Rendl,et al. On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel , 1998, Comput. Optim. Appl..

[11] Jens Clausen,et al. On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search , 1999, Ann. Oper. Res..