Research of Correlation Between Comparative Words Entropy and TSP-complexities of Individual Travelling Salesman Problem

Student: Shulga Mikhail

Supervisor: Mikhail Ulyanov

Educational Programme: Software Engineering (Bachelor)

Final Grade: 9

Year of Graduation: 2017

The objects of the study are the individual Travelling Salesman Problems (TSP), considered in the aspect of prediction their solution using branch-and-bound method complexities. The subject of the study are the correlation coefficients of the selected entropy function’s over comparative words built using TSP matrix characteristics values and their complexities. The study of the set of individual travelling salesman problems and their corresponding complexities was conducted during the research. The resulting source code may be used in the researches, that are related to the entropy function over comparative words behavior features. This paper consists of 45 pages, 9 appendices including the source code, 5 graphs, 1 table and 4 sources. Keywords: Travelling Salesman Problem, the Branch and Bound method, entropy function, complexity prediction.

Full text (added May 22, 2017)

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