معرفی
Günther Raidl is an Associate Professor at the Vienna University of Technology's Faculty of Informatics, specializing in the Algorithms and Complexity department. His research focuses on combinatorial optimization, metaheuristics, evolutionary computation, and operations research, with applications in logistics, bioinformatics, and scheduling. He leads projects on algorithmic problems, including vehicle routing, scheduling, and network design.
His academic career includes extensive contributions to heuristic optimization techniques, mathematical programming, and the development of efficient algorithms. He has collaborated with institutions like Honda Research Institute Europe and Alfie's GmbH on projects involving e-mobility optimization, battery station planning, and dynamic vehicle routing.
Raidl's work emphasizes practical applications of theoretical research, bridging algorithm development with real-world challenges in logistics and transportation. His recent publications address problems like longest common subsequence algorithms, Roman domination in graphs, and scheduling with interactive human availability learning.
Key projects include studies on cooperative optimization for service point distribution, electric dial-a-ride systems, and battery swapping station location planning. He teaches courses on heuristic optimization, algorithms, and mathematical programming, contributing to both education and industry-relevant research.
