Institutional Repository of Vilnius University
Traukinių tvarkaraščių konfliktų sprendimų paieška ir optimizavimas naudojant kvantinius skaičiavimus /
Abstract
dc:descriptionThe Train Rescheduling Problem is one of the most common problems in railway traffic planning. The solution to this problem is to produce passenger and freight train timetables that satisfy existing railway constraints and optimize the train movements on the overall railway network. Optimizing this problem using classical methods is time‑consuming and requires other resources. In this paper, the problem is optimized not only by classical but also by quantum computation, comparing the speed and accuracy of different optimization methods. The theoretical background, the different types of railway tracks, the structure of railway networks, and the different algorithms for scheduling conflict management are presented. Experiments are carried out by implementing optimization using classical and quantum methods. The main results of the work are related to the analysis of trains routing schedules, the study of the Latvian railway network, the implementation of a linear programming model using the PuLP library CBC MILP solver, the solution using quantum computing, defining a QUBO model and passing it to a D‑Wave quantum computer for solving.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2024
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Venskus, Arvydas,
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD210648249&prefLang=en_US