@ARTICLE{26583204_174187300_2015, 
	author = {Mikhail Ulyanov and Mikhail Fomichev}, 
	keywords = {, travelling salesman problem, branch-and-bound method, time and memory efficiency, data structureexperimental research},
	title = {<p class="text">Resource characteristics of ways to organize a decision tree in the branch-and-bound method for the traveling salesmen problem</p>},
	journal = {},
	year = {2015},
	number = {4 (34)},
	pages = {38-46},
	url = {https://bijournal.hse.ru/en/2015--4 (34)/174187300.html},
	publisher = {},
	abstract = {Mikhail V. Ulyanov -&nbsp;Leading Researcher, V.A.Trapeznikov Institute of Control Sciences,&nbsp;Russian Academy of Sciences;&nbsp;Professor, Software Management Department,&nbsp;National Research University Higher School of Economics.Address: 65, Profsouznaya Street, Moscow, 117997, Russian Federation.E-mail: muljanov@mail.ruMikhail I. Fomichev -&nbsp;Student, Software Engineering Program,&nbsp;National Research University Higher School of Economics.&nbsp;Address: 20, Myasnitskaya Street, Moscow, 101000, Russian Federation.E-mail: mikhail.fomichev94@gmail.com&nbsp; &nbsp; &nbsp; &nbsp;The resource efficiency of different implementations of the branch-and-bound method for the classical traveling salesman problem depends, inter alia, on ways to organize a search decision tree generated by this method. The classic "time-memory" dilemma is realized herein either by an option of storing reduced matrices at the points of the decision tree, which leads to reduction in the complexity with additional capacity cost, or matrix recalculation for the current node, which leads to an increase in complexity while saving memory. The subject of this paper is an experimental study of temporal characteristics of solving the traveling salesman problem by the branch-and-bound method to identify a real reduction of span time using additional memory in a selected structure of a decision tree. The ultimate objective of the research is to formulate recommendations for implementing the method in practical problems encountered in logistics and business informatics.&nbsp; &nbsp; &nbsp; &nbsp;On the basis of experimental data, this paper shows that both considered options of the classic algorithm for the traveling salesman problem by the branch-and-bound method generate software implementations with an exponential dependence on the execution time of the input length. The experimental results permit us to suggest that the applicability of an additional memory capacity of no more than 1 GB results in a significant (up to five times) reduction of the time span. The estimate of the resulting trend makes it possible to recommend practical application of the software implementation of the branch-and-bound algorithm with storage of matrices - with a really available 16 GB random-access memory and with limitation of the expected average computation time of about one minute on modern personal computers whereby problems having a dimension no more than 70 can be solved exactly.},
	annote = {Mikhail V. Ulyanov -&nbsp;Leading Researcher, V.A.Trapeznikov Institute of Control Sciences,&nbsp;Russian Academy of Sciences;&nbsp;Professor, Software Management Department,&nbsp;National Research University Higher School of Economics.Address: 65, Profsouznaya Street, Moscow, 117997, Russian Federation.E-mail: muljanov@mail.ruMikhail I. Fomichev -&nbsp;Student, Software Engineering Program,&nbsp;National Research University Higher School of Economics.&nbsp;Address: 20, Myasnitskaya Street, Moscow, 101000, Russian Federation.E-mail: mikhail.fomichev94@gmail.com&nbsp; &nbsp; &nbsp; &nbsp;The resource efficiency of different implementations of the branch-and-bound method for the classical traveling salesman problem depends, inter alia, on ways to organize a search decision tree generated by this method. The classic "time-memory" dilemma is realized herein either by an option of storing reduced matrices at the points of the decision tree, which leads to reduction in the complexity with additional capacity cost, or matrix recalculation for the current node, which leads to an increase in complexity while saving memory. The subject of this paper is an experimental study of temporal characteristics of solving the traveling salesman problem by the branch-and-bound method to identify a real reduction of span time using additional memory in a selected structure of a decision tree. The ultimate objective of the research is to formulate recommendations for implementing the method in practical problems encountered in logistics and business informatics.&nbsp; &nbsp; &nbsp; &nbsp;On the basis of experimental data, this paper shows that both considered options of the classic algorithm for the traveling salesman problem by the branch-and-bound method generate software implementations with an exponential dependence on the execution time of the input length. The experimental results permit us to suggest that the applicability of an additional memory capacity of no more than 1 GB results in a significant (up to five times) reduction of the time span. The estimate of the resulting trend makes it possible to recommend practical application of the software implementation of the branch-and-bound algorithm with storage of matrices - with a really available 16 GB random-access memory and with limitation of the expected average computation time of about one minute on modern personal computers whereby problems having a dimension no more than 70 can be solved exactly.}
}