Heuristic for Truck and Trailer Routing Problem

Student: Grechikhin Ivan

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

Educational Programme: Applied Mathematics and Information Science (Master)

Final Grade: 9

Year of Graduation: 2016

VRP is famous and popuNP-hard problem in logistics and transportation. It is considered in many real-life applications. In such real-life applications, the problem has a lot of additional constraints, and because of that, it is not possible to find an exact solution. Generally, for such problems, different heuristics are used and the most simple one is the greedy heuristic. In this work, heuristic with elements of local search and tabu search is considered. Based on the solution from greedy heuristic, the suggested heuristic searches for better solutions through the infeasible regions or neighborhoods.

Full text (added June 2, 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