Control schemes in a generalized utility for parallel branch-and-bound algorithms

Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most promising methods for improving these algorithms. Parallel branch-and-bound algorithm implementations can be divided into two types based on whether a central or a distributed control scheme is used. Central control schemes have reduced scalability because of bottleneck problems which are frequently encountered. In order to solve problem cases that cannot be solved with a sequential branch-and-bound algorithm distributed control schemes are necessary. However, compared to central control schemes, higher efficiency is not always achieved through the use of a distributed control scheme. A mixed control scheme is proposed, changing between the two different types of control schemes during execution. In addition, a dynamic load balancing strategy is applied in the distributed control scheme. Performance evaluation for three different cases is carried out: central, distributed and mixed control schemes. Several TSP instances from the TSPLIB are experimentally solved, using up to 101 workstations. The results of these experiments show that the mixed control scheme is one of the most promising control schemes and furthermore, the hybrid selection rule, which was introduced in the authors' previous work, has an advantage in parallel branch-and-bound algorithms.

[1]  Jesper Larsson Träff,et al.  Implementation of parallel branch-and-bound algorithms – experiences with the graph partitioning problem , 1991, Ann. Oper. Res..

[2]  Victor J. Rayward-Smith,et al.  Parallel branch-and-bound , 1992 .

[3]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[4]  品野勇治.  A Generalized Utility for Parallel Branch-and-Bound Algorithms(並列分枝限定法システムの汎用化) , 1997 .

[5]  Yuji Shinano,et al.  A generalized utility for parallel branch and bound algorithms , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[6]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[7]  Reinhard Lüling,et al.  Two Strategies for Solving the Vertex Cover Problem on a Transputer Network , 1989, WDAG.

[8]  Jonathan Eckstein.  Control strategies for parallel mixed integer branch and bound , 1994, Proceedings of Supercomputing '94.

[9]  Joseph F. Pekny,et al.  A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems , 1992, CSC '90.

[10]  G. Nemhauser,et al.  Branch-and-bound and parallel computation: A historical note , 1988 .

[11]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[12]  Reinhard Lüling,et al.  Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[13]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[14]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[15]  Alfred Taudes,et al.  Implementing Branch-and-Bound Algorithms on a Cluster of Workstations — A Survey, Some New Results and Open Problems , 1991 .

[16]  Ricardo C. Corrêa.  A Parallel Formulatiion for General Branch-and-Bound Algorithms , 1995, IRREGULAR.

[17]  P. Pardalos,et al.  Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architecture , 1990 .

[18]  Catherine Roucairol,et al.  A parallel branch and bound algorithm for the quadratic assignment problem , 1987, Discret. Appl. Math..

[19]  José D. P. Rolim,et al.  Parallel Algorithms for Irregularly Structured Problems , 1995, Lecture Notes in Computer Science.

[20]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[21]  Michael J. Quinn,et al.  Analysis and Implementation of Branch-and Bound Algorithms on a Hypercube Multicomputer , 1990, IEEE Trans. Computers.

[22]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[23]  Reinhard Lüling,et al.  Load balancing for distributed branch & bound algorithms , 1992, Proceedings Sixth International Parallel Processing Symposium.