Implementation and Assessment of Heuristic Algorithms for MCPP

Student: Gordenko Mariia

Educational Programme: Software Engineering (Bachelor)

Year of Graduation: 2017

The Mixed Chinese Postman Problem is to find a minimum shortest tour of given graph or multigraph traversed each edge or arc at least once. The mixed case of the problem is NP-hard. However, the mixed case of the problem has many potentially useful applications, including delivering of something, robot exploration, web site usability, etc. We propose to solve the problem using the graph transformation. The algorithm for transforming Mixed Chinese Postman Problem into equivalent arc routing problems is pointed out. The group of Pareto-optimal algorithms was defined. The paper contains 139 pages, 26 illustrations, 19 tables, 66 bibliography items, 9 appendices. Keywords: Mixed Chinese postman problem, Travelling Salesman Problem, General Routing Problem, heuristic algorithm, NP-hard problem.

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