Approximate Algorithms Design for Solving NP-Complete Problems

Student: Murzin Petr

Faculty: HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE)

Educational Programme: Control Systems and Data Processing in Engineering (Master)

Final Grade: 7

Year of Graduation: 2017

The major objective of this study is to investigate and develop approximate algorithms for NP-complete problems. Polynomial algorithms for such problems have not been found yet, but it also has not been proven that such algorithms do not exist. Particular attention is paid to the VRP (Vehicle Routing Problem). Algorithms of swarm intelligence and their modifications are used in order to solve this problem. A hybrid algorithm was developed, which is a sequential and embedded scheme of bee, genetic and ant algorithms respectively. The dependence of optimal parameters and objective functions is revealed.

Full text (added May 26, 2017)

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