Professor Rhydian Lewis is a distinguished academic at Cardiff University's School of Mathematics, holding a Personal Chair since 2023. Previously, he served as a Reader (2019-2023), Senior Lecturer (2015-2019), and Lecturer (2008-2015) at the same institution, with earlier appointments at Cardiff Business School (2006-2008) and Edinburgh Napier University (2003-2006). He is a Fellow of the Higher Education Academy and serves as an Associate Editor for the International Journal of Metaheuristics. His research spans algorithmic graph theory, combinatorial optimization, and operational research, with specific expertise in graph coloring, vehicle routing, shortest path algorithms, school bus routing, automated timetabling, and metaheuristics. Lewis has made significant contributions to both theoretical and applied aspects of these fields, developing practical solutions for real-world problems in transportation, agriculture, healthcare scheduling, and network analysis. His recent publications demonstrate a strong trajectory in graph theory applications, particularly in street network analysis, payment channel networks, and livestock routing. The research shows increasing interdisciplinary connections between theoretical computer science, operations research, and practical applications in urban planning, financial technology, and agricultural engineering. His work often bridges theoretical algorithm development with practical implementation, as evidenced by his GCol Python library for graph coloring. Fellow of the Higher Education Academy Associate Editor, International Journal of Metaheuristics Guest Editor, Special Issue on Algorithms for Graphs and Networks (Algorithms, 2020) Program Committee Member for EVOCOP, PATAT, and GECCO conferences Professor Lewis actively supervises PhD students in combinatorial optimization, algorithmic graph theory, and transportation problems. His current supervisees include Monique Sciortino, Daniel Hambly, and Lukas Dijkstra, while his past students have completed research on score-constrained packing, dynamic graph coloring, dynamic arc routing, urban transportation networks, operating theatre schedules, and vehicle routing problems. His collaborative work spans multiple institutions and disciplines, particularly with researchers like P. Corcoran, J. Thompson, and D. Thiruvady. Lewis maintains active research teams focused on graph algorithms and operational research applications, with strong connections to industry through projects like the European Consortium for Mathematics in Industry. His work on school transport systems demonstrates practical impact in community applications.
