Rhyd Lewis
Orcid: 0000-0003-1046-811XAffiliations:
- Cardiff University, School of Mathematics, UK
According to our database1,
Rhyd Lewis
authored at least 58 papers
between 2005 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
-
on d-nb.info
-
on rhydlewis.eu
On csauthors.net:
Bibliography
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
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
Swarm Evol. Comput., 2022
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks.
J. Heuristics, 2022
Eur. J. Oper. Res., 2022
Proceedings of the 31st International Conference on Computer Communications and Networks, 2022
Proceedings of the 31st International Conference on Computer Communications and Networks, 2022
2021
Comput. Oper. Res., 2021
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
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
Algorithms, 2020
Algorithms, 2020
Proceedings of the Computational Logistics - 11th International Conference, 2020
Proceedings of the Computational Logistics - 11th International Conference, 2020
2019
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
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
IEEE Trans. Evol. Comput., 2017
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
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
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016
2015
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
Comput. Oper. Res., 2014
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
Evol. Comput., 2011
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
OR Spectr., 2008
2007
Proceedings of the Evolutionary Scheduling, 2007
IEEE Trans. Evol. Comput., 2007
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007
2006
2005
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2005
Proceedings of the IEEE Congress on Evolutionary Computation, 2005