Rhyd Lewis

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 30

Top Topics

Greedy Heuristics

Routing Problem

Tabu Search Algorithm

Top Venues

Comput. Oper. Res.

Publications

Daniel Hambly, Rhyd Lewis, Padraig Corcoran
Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs. SEA (2024)
Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis
Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. INOC (2024)
Padraig Corcoran, Rhyd Lewis
Optimisation of livestock routing on farms. Comput. Ind. Eng. 188 (2024)
Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Rhyd Lewis
Soft happy colourings and community structure of networks. CoRR (2024)
Rhyd Lewis
A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees. CoRR (2023)
Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson
A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection. SN Comput. Sci. 4 (1) (2023)
Fiona Carroll, Rhyd Lewis
Internet Security Aesthetics: Can internet transparency afford social trust? ICCCN (2022)
Rhyd Lewis, Padraig Corcoran
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks. J. Heuristics 28 (3) (2022)
Dhananjay R. Thiruvady, Rhyd Lewis
Recombinative approaches for the maximum happy vertices problem. Swarm Evol. Comput. 75 (2022)
Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson
Exact and approximate methods for the score-constrained packing problem. Eur. J. Oper. Res. 302 (3) (2022)
Rhyd Lewis, Fiona Carroll
Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs. ICCCN (2022)
Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson
A Heuristic Algorithm for School Bus Routing with Bus Stop Selection. EvoCOP (2021)
Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan
The maximum happy induced subgraph problem: Bounds and algorithms. Comput. Oper. Res. 126 (2021)
Rhyd Lewis
Who is the Centre of the Movie Universe? Using Python and NetworkX to Analyse the Social Network of Movie Stars. CoRR (2020)
Rhyd Lewis
Editorial for the Special Issue on "Algorithms for Graphs and Networks". Algorithms 13 (11) (2020)
Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis
Effects of update frequencies in a dynamic capacitated arc routing problem. Networks 76 (4) (2020)
Rhyd Lewis
Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties. Algorithms 13 (11) (2020)
Rhyd Lewis
A Heuristic Algorithm for Finding Attractive Fixed-Length Circuits in Street Maps. ICCL (2020)
Rhyd Lewis, Tom Anderson, Fiona Carroll
Can School Enrolment and Performance be Improved by Maximizing Students' Sense of Choice in Elective Subjects? J. Learn. Anal. 7 (1) (2020)
Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan
Tackling the maximum happy vertices problem in large networks. 4OR 18 (4) (2020)
Rhyd Lewis
A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices. ICCL (2020)
Paulo Neis, Rhyd Lewis
Evaluating the influence of parameter setup on the performance of heuristics for the graph colouring problem. Int. J. Metaheuristics 7 (4) (2020)
Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan
Finding happiness: An analysis of the maximum happy vertices problem. Comput. Oper. Res. 103 (2019)
Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson
Heuristics for the Score-Constrained Strip-Packing Problem. COCOA (2018)
Rhyd Lewis, Kate Smith-Miles
A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discrete Algorithms (2018)
Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson
Tackling the edge dynamic graph colouring problem with and without future adjacency information. J. Heuristics 24 (3) (2018)
Rhyd Lewis, Penny L. Holborn
How to Pack Trapezoids: Exact and Evolutionary Algorithms. IEEE Trans. Evol. Comput. 21 (3) (2017)
Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson
Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs. EvoCOP (2016)
Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis
Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem. HM (2016)
Rhyd Lewis, Fiona Carroll
Creating seating plans: a practical application. J. Oper. Res. Soc. 67 (11) (2016)
Matthew P. John, Christine L. Mumford, Rhyd Lewis
An Improved Multi-objective Algorithm for the Urban Transit Routing Problem. EvoCOP (2014)
Kate Smith-Miles, Davaatseren Baatar, Brendan Wreford, Rhyd Lewis
Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45 (2014)
Rhyd Lewis, Jonathan M. Thompson, Christine L. Mumford, J. Gillard
A wide-ranging computational comparison of high-performance graph colouring algorithms. Comput. Oper. Res. 39 (9) (2012)
Penny L. Holborn, Jonathan M. Thompson, Rhyd Lewis
Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows. EvoCOP (2012)
Rhyd Lewis
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Ann. Oper. Res. 194 (1) (2012)
Xiang Song, Rhyd Lewis, Jonathan M. Thompson, Yue Wu
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. Comput. Oper. Res. 39 (9) (2012)
Rhyd Lewis, Jonathan M. Thompson
On the application of graph colouring techniques in round-robin sports scheduling. Comput. Oper. Res. 38 (1) (2011)
Rhyd Lewis, Xiang Song, Kathryn A. Dowsland, Jonathan M. Thompson
An investigation into two bin packing problems with ordering and orientation implications. Eur. J. Oper. Res. 213 (1) (2011)
Rhyd Lewis, E. Pullin
Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems. Evol. Comput. 19 (4) (2011)
Xiang Song, C. B. Chu, Rhyd Lewis, Y. Y. Nie, Jonathan M. Thompson
A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting. Eur. J. Oper. Res. 202 (2) (2010)
Rhyd Lewis
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing. Comput. Oper. Res. 36 (7) (2009)
Rhyd Lewis
Metaheuristics can solve sudoku puzzles. J. Heuristics 13 (4) (2007)