Abstract
We present a new parallel best-first Branch and Bound algorithm conceived for machines with distributed memory. Based on the notion of problems having the same lower bound, the algorithm evaluates these problems in parallel, during each phase of its execution. These computationally intensive phases alternate with control phases where synchronization and information exchange between processors takes place. We propose a probabilistic model for predicting the performances of this algorithm and discuss the results obtained on a MIMD multiprocessor for the Asymmetric Non-Euclidean TSP.
This article was processed using the LaTEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Gengler, A Best-first Parallel B&B with Synchronization Phases on Distributed Memory Machines, Tech. Rep. 76, Laboratoire d'Informatique Théorique, EPFL-DI, Lausanne (CH), 1991.
M. Gengler, Axiomatique du Branch-and-Bound, Tech. Rep. 77, Laboratoire d'Informatique Théorique, EPFL-DI, Lausanne (CH), 1992.
D. S. Johnson, A Catalog of Complexity Classes, in Algorithms and Complexity, Handbook of Theoretical Computer Science, Vol. A, J. Van Leeuwen (ed.), pp. 67–161, Elsevier & MIT Press, Amsterdam (NL) & Cambridge (USA), 1990.
G. A. P. Kindervater, Exercises in Parallel Combinatorial Computing, PhD. Thesis, CWI, Amsterdam (NL), 1989.
J. D. Little, K. G. Murty, D. W. Sweeney, C. Karel, An Algorithm for the Traveling Salesman Problem, Operations Research 11, pp. 972–989, 1963.
L. G. Mitten, B&B Methods: General Formulation and Properties, Operations Research 18, pp. 24–34, 1970.
A. H. G. Rinnooy Kan, On Mitten's Axioms for Branch-and-Bound, Tech. Rep. W/74/45/03, Graduate School of Management, Delft (NL), 1974.
C. Roucairol, Du séquentiel au parallèle: La recherche arborescente et son application à la programmation quadratique en variables 0.1, Thèse d'Etat, Univ. Paris 6, Paris (F), 1987.
C. Roucairol, Parallel Branch and Bound Algorithms — an Overview, in Parallel and Distributed Algorithms, M. Cosnard et al. (eds.), Elsevier, Amsterdam (NL), 1989.
D. R. Smith, Random Trees and the Analysis of Branch and Bound Procedures, Journal of the ACM, Vol. 31, No 1, pp. 163–188, 1984.
B. Wah, C. Yu, Probabilistic Modeling of B&B Algorithms, in Proc. COMPSAC, pp. 647–653, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gengler, M., Coray, G. (1992). A parallel best-first B & B with synchronization phases. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_450
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_450
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive