Development of an Optimal Route Algorithm for Several Agents with Time Constraints.

Student: Aiuntc Eduard

Educational Programme: Financial Technology and Data Analysis (Master)

Year of Graduation: 2020

The thesis provides a theoretical overview of various algorithms for solving the travelling salesman (TSP) and vehicle routing problem (VRP) with restrictions, as well as practical experiments to compare the effectiveness of the described algorithms and two approaches to creating routes - based on pre-clustering of objects, followed by the classic TSP for each agent and the VRP problem, which distributes objects and determines the order of visits within a single model. The comparison was based on algorithms implemented in the open software package or-tools based on data on 112 objects and 4 agents with individual restrictions on the duration of routes and types of visited objects. As a result, on the given data, the VRP concept was marginally more effective in terms of total route duration than individual TSPs, and the greedy algorithms showed results no worse than more complex heuristics.

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