Summary
The paper presents parallelization of Branch and Bound (B & B) algorithm for Travelling Salesman Problem. The basis for parallelization is the described in literature B&B algorithm. It generates and examines a binary decision tree according to back track strategy, with use of recursive procedure. In order to assure the balanced loads of parallel processors some modifications have been introduced. The main one refers to another construction of decision tree. The way of dynamic assigning subtrees of the decision tree to the particular processors is described. The results of computer experiments carried out with use of Parallel Virtual Machine software are given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-Ari M.: Principles of concurrent and distributed programming. Englewood Cliffs, NY, Prentice- Hall 1990.
Dudek-Dyduch E.: Control of discrete event processes — branch and bound method. Prepr. of IF AC/ Ifors/Imacs Symposium Large Scale Systems: Theory and Applications, Chinese Association of Automation, vol. 2, 1992, 573–578.
Dudek-Dyduch E.: Optimization of discrete manufacturing processes — branch and bound method, in P. Gritzman, R. Hettich, R. Horst, E. Sachs (eds) Operations Research ′92. Springer-Verlag, Heidelberg 1992, 19–22.
Geist AI et all.-: Oak Ridge National Laboratory Report TM - 12187, 1993.
Hernandez V., Vidal A.M.: Parallel orthogonal triangularization of a rectangular matrix on a distributed memory multiprocessor. Working Conf. on Decentralized Systems, Lyon, December 1989.
Syslo M., Deo N., Kowalik J.: Discrete Optimization Algorithms. Englewood Cliffs, NY, Prentice-Hall 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dyduch, T., Dudek-Dyduch, E. (1995). Parallel Branch and Bound Algorithm for Travelling Salesman Problem. In: Derigs, U., Bachem, A., Drexl, A. (eds) Operations Research Proceedings 1994. Operations Research Proceedings, vol 1994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79459-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-79459-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58793-4
Online ISBN: 978-3-642-79459-9
eBook Packages: Springer Book Archive