• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Models and algorithms for solving modern discrete optimization problems

Student: Semenov Sergey

Supervisor: Ilya S. Bychkov

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

Educational Programme: Data Mining (Master)

Year of Graduation: 2018

This master thesis is dedicated to employing metaheuristics to solve discrete optimization problems. Patient Admission Scheduling problem originating from the healthcare field is considered. Three heuristic algorithms were implemented in order to find quality solutions to the problem: tabu search, genetic algorithm and an approach that uses both. Their performance is measured using benchmark problem instances and compared to existing methods.

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