Abstract
Various schemes are considered of the parallel implementation of the branch and bound method, as applied to multiprocessor computing systems (clusters) with the distributed memory. In the language of informal automata, questions are set out of the organization of the exchange of data and signals within the cluster, which afford the asynchronous operation of its processors. Common ideas are illustrated by the example of the classical traveling salesman problem and data of numerical experiments performed on the multiprocessor computing system-100 (MCS-100) are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.
Emelichev, V.A., Kovalev, M.M., and Kravtsov, M.K., Mnogogranniki, grafy, optimizatsiya (Polyhedrons, Graphs, and Optimization), Moscow: Nauka, 1981.
Sergienko, I.V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii (Mathematical Models and Methods of Solution of Discrete Optimization Problems), Kiev: Naukova Dumka, 1988.
Ananth, G.Y., Kumar, V., and Pardalos, P., Parallel Processing of Discrete Optimization Problems, Encyclopedia Microcomput., 1993, vol. 13, pp. 129–147.
Gendron, B. and Grainic, T.G., Parallel Branch-And-Bound Survey and Synthesis, Oper. Res., 1994, vol. 42, no. 2, pp. 1042–1066.
Verkhoturov, V.R., Veselovskii, V.E., Zlotov, A.V., et al., Kombinatornye metody i algoritmy resheniya zadach diskretnoi optimizatsii bol’shoi razmernosti (Combinatorial Methods and Algorithms of Solution of Discrete Optimization Problems of Large Dimensions), Moscow: Nauka, 2000.
Voevodin, V.V., Parallel’nye vychisleniya (Parallel Computations), St. Petersburg: BKhV-Peterburg, 2004.
Chetverushkin, B.N., Highly Productive Multiprocessor Computing Systems, Vest. Ross. Akad. Nauk, 2002, vol. 72, no. 9, pp. 786–794.
Prisypkin, M.A., Sigal, I.Kh., and Galim’yanova, N.N., Parallel’nye algoritmy v zadachakh diskretnoi optimizatsii: vychislitel’nye modeli, biblioteki, rezul’taty eksperimentov (Parallel Algorithms in Discrete Optimization Problems: Computational Models, Library, Results of Experiments), Moscow: Vychisl. Tsentr Akad. Nauk SSSR, 2006.
Popov, L.D., On Parallel Implementation of the Branch and Bound Method for the Traveling Salesman Problem, in Algorithms and Software of Parallel Computations, Ekaterinburg: Ross. Akad. Nauk, 1998, issue 2, pp. 236–255.
Trienekes, H.W.J.M., Parallel Branch and Bound on an MIMD System, Rotterdam: Econometric Institute, Erasmus University, Report 8640/A.
Little, J., Murty, K., Sweeney, D., and Karel, C., An Algorithm for Traveling Salesman Problem, Oper. Res., 1963, vol. 11, no. 6, pp. 972–990.
The Travelling Salesman Problem, Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.N., and Shmoys, D.B., Eds., New York: Wiley, 1985.
Author information
Authors and Affiliations
Additional information
Original Russian Text © L.D. Popov, 2007, published in Avtomatika i Telemekhanika, 2007, No. 5, pp. 171–181.
This work was supported by the Russian Foundation for Basic Research, project no. 07-01-00399 and the President program of support of leading scientific schools, project no. NSH-5595.2006.1.
Rights and permissions
About this article
Cite this article
Popov, L.D. Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems. Autom Remote Control 68, 901–911 (2007). https://doi.org/10.1134/S0005117907050153
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0005117907050153