• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Study of Approaches to Improving Branch and Bound Method Efficiency for Solving Traveling Salesman Problem

Student: Fomichev Mikhail

Supervisor: Mikhail Ulyanov

Faculty: Faculty of Computer Science

Educational Programme: Software Engineering (Bachelor)

Final Grade: 10

Year of Graduation: 2016

The object of the study is accurate algorithms solving the Traveling Salesman Problem, which are based on the Branch and Bound Method and its efficient modifications. The subject of the study is time and dedicated memory, required to solve the Traveling Salesman Problem. The target of the study is an analysis of different approaches, which can reduce running time of solving the Traveling Salesman Problem. Experimental research of random generated complete graphs was conducted in course of the work. The result of the study can be applied to tasks of logistics and application programming, for instance, an implementation of navigators. The paper contains 37 pages, 4 chapters, 6 illustrations, 9 tables, 30 bibliography items. Keywords: Traveling Salesman Problem, the Branch and Bound Method, hamiltonian cycle, binary heap, ordered list, self-balancing binary search tree, ant algorithm.

Full text (added May 29, 2016)

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