Dr Rhyd Lewis

Biography

Rhyd Lewis is a reader in mathematics. He is the author of the book A Guide to Graph Colouring: Algorithms and Applications.

Professional memberships

• Fellow of the Higher Education Academy

Academic positions

• 2019 - Present: Reader, School of Mathematics, Cardiff University
• 2015 - 2019: Senior Lecturer, School of Mathematics, Cardiff University
• 2008 - 2015: Lecturer, School of Mathematics, Cardiff University
• 2006 - 2008: Lecturer, Cardiff Business School, Cardiff University
• 2003 - 2006: Postgraduate Demonstrator, School of Computing, Edinburgh Napier University
• 2003 - 2006: Postgraduate Researcher, School of Computing, Edinburgh Napier University

Committees and reviewing

• Associate Editor, IMA Journal of Management Mathematics.
• Associate Editor, International Journal of Metaheuristics.
• Guest editor, Special Issue on Algorithms for Graphs and Networks, Algorithms, 2020.
• Programme commitee member for:
  • Evolutionary Computation in Combinatorial Optimisation (EVOCOP).
  • Practice and Theory of Automated Timetabling conference (PATAT).
  • Genetic and Evolutionary Computation Conference (GECCO).

Publications

We are currently unable to retrieve the list of publications. Visit our institutional repository.

Teaching

Undergraduate

• MA2760 Mathematical Investigations in Python
• MA3602 Algorithms and Heuristics

Postgraduate

• MAT004 Computational Methods

Rhyd Lewis is a fellow of the Higher Education Academy.

Rhyd Lewis's research interests include:

• Algorithmic graph theory;
• Combinatorial optimisation;
• Graph colouring (including vertex colouring, edge colouring and happy colouring);
• The application and analysis of metaheuristic and integer programming algorithms;
• Vehicle routing and arc routing, particularly dynamic variants of the problem;
• Shortest path algorithms;
• School bus routing;
• Automated timetabling (course and exam) and related problems;
• Grouping and partitioning problems;
• Operating theatre scheduling;
• Sports scheduling;
• Solving Latin square and Sudoku problems;
• Bin-packing, trapezoid (trapezium) packing, and the equal-piles problem.

Find out more about his research and download resources at his personal website.

Research group

• Operational Research

Supervision

I am interested in supervising PhD students in the areas of:

• Combinatorial optimisation
• Algorithmic graph theory
• Graph colouring;
• Packing, scheduling, and timetabling problems
• Routing problems

Current supervision

Past projects

Previous PhD projects:

• Hawa, A. (2020) "Exact and evolutionary algorithms for the score-constrained packing problem".
• Hardy, B. (2018) "Heuristic methods for colouring dynamic random graphs".
• Padungwech, W. (2018) "Heuristic algorithms for dynamic capacitated arc routing".
• John, M. (2016) "Metaheuristics for designing efficient routes and schedules for urban transportation networks".
• Rowse, E. (2015) "Robust optimisation of operating theatre schedules".
• Holborn, P. (2013) "Heuristics for dynamic vehicle routing problems with pickups and deliveries and time windows".
• Taylor, L. (2013) "Local search methods for the post enrolment-based course timetabling problem".