Algorithm for Travelling Salesman Problem with Subcycles

Student: Isaev Anton

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

Educational Programme: Data Mining (Master)

Year of Graduation: 2020

The work describes the traveling salesman problem with complex cycles and constraints: two classes of vertices and track capacity. For this problem, a mixed integer programming model has been developed which allows h allows obtaining exact solutions. The model can be used to optimize existing heuristics. Model generator for IBM CPLEX solver was implemented using Java programming language. The main advantages of this model are the ability to add any other specific constraints and the generation process (it is enough to have a file with a graph, the program is able to read it and generate the model objective and all the constraints according to the model and run it via solver like IBM CPLEX). Program contains local search algorithm which uses edge alpha-nearness.

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