The present Master’s Degree Thesis analyses the three parallel patterns of the Branch and Bound method: parallel pattern of static domain decomposition; parallel pattern of static domain decomposition with the exchange of the best solution; Master-Slave parallel pattern. In this paper, they are applied to solving of the travelling salesman problem (TSP) , besides the speed and efficiency of parallel algorithms are identified. Algorithms written in the C ++ language, the results of calculations and user-friendly graphical user interface (GUI) are provided here. The paper consists of 7 parts: introduction, global optimization tasks, overview of parallel computers and algorithms, branch-and-bound method, as well as the analysis of the parallel patterns of this method, testing of algorithms when solving TSP, the description of GUI and the references. Paper scope - 31 pages of text without enclosures, 19 illustrations, 5 tables, 19 bibliographic sources.
Šakų ir rėžių lygiagrečiųjų algoritmų analizė ir taikymai ; Analysis and practice of parallel branch and bound algorithms
2016-06-13
Hochschulschrift
Elektronische Ressource
Lithuanian , Englisch
A Selection Rule for Parallel Branch and Bound Algorithms
British Library Online Contents | 1996
|