Rhyd Lewis

Orcid: 0000-0003-1046-811X

Affiliations:
  • Cardiff University, School of Mathematics, UK


According to our database1, Rhyd Lewis authored at least 58 papers between 2005 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A user-centric model of connectivity in street networks.
Comput. Oper. Res., 2025

2024
Fast Algorithms for Computing Fixed-Length Round Trips in Real-World Street Networks.
SN Comput. Sci., October, 2024

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks.
CoRR, 2024

Soft happy colourings and community structure of networks.
CoRR, 2024

Optimisation of livestock routing on farms.
Comput. Ind. Eng., 2024

Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics.
Proceedings of the 11th International Network Optimization Conference, 2024

2023
Methods for determining cycles of a specific length in undirected graphs with edge weights.
J. Comb. Optim., December, 2023

A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection.
SN Comput. Sci., 2023

A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees.
CoRR, 2023

2022
Recombinative approaches for the maximum happy vertices problem.
Swarm Evol. Comput., 2022

Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks.
J. Heuristics, 2022

Exact and approximate methods for the score-constrained packing problem.
Eur. J. Oper. Res., 2022

Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs.
Proceedings of the 31st International Conference on Computer Communications and Networks, 2022

Internet Security Aesthetics: Can internet transparency afford social trust?
Proceedings of the 31st International Conference on Computer Communications and Networks, 2022

2021
The maximum happy induced subgraph problem: Bounds and algorithms.
Comput. Oper. Res., 2021

A Heuristic Algorithm for School Bus Routing with Bus Stop Selection.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2021

2020
Can School Enrolment and Performance be Improved by Maximizing Students' Sense of Choice in Elective Subjects?
J. Learn. Anal., March, 2020

Effects of update frequencies in a dynamic capacitated arc routing problem.
Networks, 2020

Evaluating the influence of parameter setup on the performance of heuristics for the graph colouring problem.
Int. J. Metaheuristics, 2020

Who is the Centre of the Movie Universe? Using Python and NetworkX to Analyse the Social Network of Movie Stars.
CoRR, 2020

Editorial for the Special Issue on "Algorithms for Graphs and Networks".
Algorithms, 2020

Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties.
Algorithms, 2020

Tackling the maximum happy vertices problem in large networks.
4OR, 2020

A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices.
Proceedings of the Computational Logistics - 11th International Conference, 2020

A Heuristic Algorithm for Finding Attractive Fixed-Length Circuits in Street Maps.
Proceedings of the Computational Logistics - 11th International Conference, 2020

2019
Finding happiness: An analysis of the maximum happy vertices problem.
Comput. Oper. Res., 2019

2018
A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems.
J. Discrete Algorithms, 2018

Tackling the edge dynamic graph colouring problem with and without future adjacency information.
J. Heuristics, 2018

Heuristics for the Score-Constrained Strip-Packing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
How to Pack Trapezoids: Exact and Evolutionary Algorithms.
IEEE Trans. Evol. Comput., 2017

The School Bus Routing Problem: An Analysis and Algorithm.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Creating seating plans: a practical application.
J. Oper. Res. Soc., 2016

Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem.
Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016

2015
Graph Coloring and Recombination.
Proceedings of the Springer Handbook of Computational Intelligence, 2015

Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem.
Eur. J. Oper. Res., 2015

2014
Towards objective measures of algorithm performance across instance space.
Comput. Oper. Res., 2014

An Improved Multi-objective Algorithm for the Urban Transit Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

Optimising large scale public transport network design problems using mixed-mode parallel multi-objective evolutionary algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2012
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem.
Comput. Oper. Res., 2012

A wide-ranging computational comparison of high-performance graph colouring algorithms.
Comput. Oper. Res., 2012

A time-dependent metaheuristic algorithm for post enrolment-based course timetabling.
Ann. Oper. Res., 2012

Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

2011
An investigation into two bin packing problems with ordering and orientation implications.
Eur. J. Oper. Res., 2011

Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems.
Evol. Comput., 2011

On the application of graph colouring techniques in round-robin sports scheduling.
Comput. Oper. Res., 2011

2010
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition.
INFORMS J. Comput., 2010

A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting.
Eur. J. Oper. Res., 2010

2009
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing.
Comput. Oper. Res., 2009

2008
A survey of metaheuristic-based techniques for University Timetabling problems.
OR Spectr., 2008

2007
Metaheuristics for University Course Timetabling.
Proceedings of the Evolutionary Scheduling, 2007

Finding Feasible Timetables Using Group-Based Operators.
IEEE Trans. Evol. Comput., 2007

Metaheuristics can solve sudoku puzzles.
J. Heuristics, 2007

On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007

2006
Metaheuristics for university course timetabling.
PhD thesis, 2006

2005
Application of the Grouping Genetic Algorithm to University Course Timetabling.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2005

An empirical analysis of the grouping genetic algorithm: the timetabling case.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005


  Loading...