Vahid Roostapour

Vahid Roostapour completed his PhD in Computer Science at the University of Adelaide under the supervision of Professor Frank Neumann, focusing on bio-inspired computing for complex and dynamic constrained problems. His doctoral research made significant contributions to understanding evolutionary algorithms and ant colony optimization, particularly in addressing problems with dynamically changing constraints. His thesis work spans both static and dynamic combinatorial problems, including innovative research on minimum spanning tree problems, packing while travelling problems, and dynamic knapsack problems. Through his research, he demonstrated the advantages of evolutionary algorithms over traditional approaches in solving complex optimization problems, particularly in environments with high-frequency changes. His work has earned recognition in the field of evolutionary computation, with important contributions to theoretical and empirical understanding of bio-inspired algorithms. Beyond his research, he has been involved in teaching within the Mining Big Data course at Adelaide, combining his expertise in optimization with practical applications in data science.