Study on Dependencies of Complexity of Asymmetric TSP Based on Values of Variation of Rows of Random Matrixes

Student: Sechkarev Vladimir

Supervisor: Mikhail Ulyanov

Educational Programme: Software Engineering (Bachelor)

Final Grade: 8

Year of Graduation: 2018

Solving the traveling salesman problem, or TSP, is a very common subtask in engineering, and the branch-and-bound algorithm is used as the default tool for it for many years to date. However, due to the nature of TSP, the amount of time and memory resources needed for solving each individual problem differs greatly and is unpredictable a priori. This study explores the possibility to provide a prediction model that is based solely on the variations of the algorithm input and forecasts if the amount of resources needed for solving a given problem with branch-and-bound algorithm is unreasonably high. The present work comprises 29 pages, 9 figures, 1 table. 7 appendixes are attached. 7 sources are used. Keywords: branch-and-bound; complexity prediction; matrix analysis; travelling salesman problem; TSP-complexity.

Full text (added May 28, 2018)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses