Linear programming and Artificial Intelligence for Vehicle scheduling problems

• Thesis title in Czech: Lineární programování a umělá inteligence pro plánování oběhů vozidel
• Thesis title in English: Linear programming and Artificial Intelligence for Vehicle scheduling problems
• Academic year of topic announcement: 2023/2024
• Thesis type: diploma thesis
• Thesis language: angličtina
• Department: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
• Supervisor: RNDr. Jiří Fink, Ph.D.
• Author: hidden - assigned and confirmed by the Study Dept.
• Date of registration: 20.10.2023
• Date of assignment: 21.10.2023
• Confirmed by Study dept. on: 21.10.2023
• Opponents: Mgr. David Sychrovský

Guidelines

The task is to study optimization algorithms for Vehicle and Crew scheduling problems. Student will try to improve known algorithms based on Linear Programming (e.g.Branch-Cut-and-Price) using Artificial Intelligence (e.g. Neural networks). Proposed algorithms will be implemented and experimentally compared.

References

Alejandro Alvarez, Quentin Louveaux, and Louis Wehenkel. A machine learning-based approximation of strong branching. INFORMS Journal on Computing, 29:185–195, 01 2017.
Elias Khalil, Pierre Le Bodic, Le Song, George Nemhauser, and Bistra Dilkina. Learning to branch in mixed integer programming. Proceedings of the AAAI Conference on Artificial Intelligence, 30, 02 2016.
Marta Mesquita and Ana Paias. Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Computers & Operations Research, 35:1562–1575, 05 2008.