Solving the Travelling Salesman Problem

Student: Vinogradova Kristina

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2024

In today's world, where speed and efficiency are key success factors, optimization methods and resources become especially inventive. One of the most complex and relevant problems in the field of combinatorial optimization is the trade management problem (TSP – Traveling Salesman Problem). This problem involves finding the best route to visit a limited number of points once and return to the starting point while minimizing the path contour.

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