default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRhyd Lewis
Person information
- affiliation: Cardiff University, School of Mathematics, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j35]Padraig Corcoran, Rhyd Lewis
:
A user-centric model of connectivity in street networks. Comput. Oper. Res. 173: 106846 (2025)- [j34]Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Rhyd Lewis:
Soft happy colourings and community structure of networks. Comput. Oper. Res. 174: 106893 (2025) - 2024
- [j33]Padraig Corcoran, Rhyd Lewis:
Optimisation of livestock routing on farms. Comput. Ind. Eng. 188: 109882 (2024) - [j32]Rhyd Lewis, Padraig Corcoran:
Fast Algorithms for Computing Fixed-Length Round Trips in Real-World Street Networks. SN Comput. Sci. 5(7): 868 (2024) - [c17]Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis:
Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. INOC 2024: 22-27 - [c16]Daniel Hambly, Rhyd Lewis, Padraig Corcoran:
Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs. SEA 2024: 15:1-15:11 - [i4]Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Rhyd Lewis:
Soft happy colourings and community structure of networks. CoRR abs/2405.15663 (2024) - [i3]Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis:
Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks. CoRR abs/2409.04226 (2024) - 2023
- [j31]Rhyd Lewis, Padraig Corcoran, Andrei V. Gagarin:
Methods for determining cycles of a specific length in undirected graphs with edge weights. J. Comb. Optim. 46(5): 29 (2023) - [j30]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): 74 (2023) - [i2]Rhyd Lewis:
A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees. CoRR abs/2303.10034 (2023) - 2022
- [j29]Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson:
Exact and approximate methods for the score-constrained packing problem. Eur. J. Oper. Res. 302(3): 847-859 (2022) - [j28]Rhyd Lewis, Padraig Corcoran:
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks. J. Heuristics 28(3): 259-285 (2022) - [j27]Dhananjay R. Thiruvady, Rhyd Lewis:
Recombinative approaches for the maximum happy vertices problem. Swarm Evol. Comput. 75: 101188 (2022) - [c15]Fiona Carroll, Rhyd Lewis:
Internet Security Aesthetics: Can internet transparency afford social trust? ICCCN 2022: 1-2 - [c14]Rhyd Lewis, Fiona Carroll:
Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs. ICCCN 2022: 1-2 - 2021
- [j26]Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan:
The maximum happy induced subgraph problem: Bounds and algorithms. Comput. Oper. Res. 126: 105114 (2021) - [c13]Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson:
A Heuristic Algorithm for School Bus Routing with Bus Stop Selection. EvoCOP 2021: 202-218 - 2020
- [j25]Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan:
Tackling the maximum happy vertices problem in large networks. 4OR 18(4): 507-527 (2020) - [j24]Rhyd Lewis:
Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties. Algorithms 13(11): 269 (2020) - [j23]Rhyd Lewis:
Editorial for the Special Issue on "Algorithms for Graphs and Networks". Algorithms 13(11): 292 (2020) - [j22]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): 352-378 (2020) - [j21]Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis:
Effects of update frequencies in a dynamic capacitated arc routing problem. Networks 76(4): 522-538 (2020) - [j20]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): 75-87 (2020) - [c12]Rhyd Lewis:
A Heuristic Algorithm for Finding Attractive Fixed-Length Circuits in Street Maps. ICCL 2020: 384-395 - [c11]Rhyd Lewis:
A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices. ICCL 2020: 539-552 - [i1]Rhyd Lewis:
Who is the Centre of the Movie Universe? Using Python and NetworkX to Analyse the Social Network of Movie Stars. CoRR abs/2002.11103 (2020)
2010 – 2019
- 2019
- [j19]Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan:
Finding happiness: An analysis of the maximum happy vertices problem. Comput. Oper. Res. 103: 265-276 (2019) - 2018
- [j18]Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson:
Tackling the edge dynamic graph colouring problem with and without future adjacency information. J. Heuristics 24(3): 321-343 (2018) - [j17]Rhyd Lewis, Kate Smith-Miles:
A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discrete Algorithms 52-53: 2-17 (2018) - [c10]Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson:
Heuristics for the Score-Constrained Strip-Packing Problem. COCOA 2018: 449-462 - 2017
- [j16]Rhyd Lewis, Penny L. Holborn:
How to Pack Trapezoids: Exact and Evolutionary Algorithms. IEEE Trans. Evol. Comput. 21(3): 463-476 (2017) - [c9]Rhydian Lewis, Kate Smith-Miles, Kyle Phillips:
The School Bus Routing Problem: An Analysis and Algorithm. IWOCA 2017: 287-298 - 2016
- [j15]Rhyd Lewis, Fiona Carroll:
Creating seating plans: a practical application. J. Oper. Res. Soc. 67(11): 1353-1362 (2016) - [c8]Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson:
Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs. EvoCOP 2016: 186-201 - [c7]Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis:
Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem. HM 2016: 62-74 - 2015
- [j14]Rhydian Lewis, Jonathan M. Thompson:
Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. Eur. J. Oper. Res. 240(3): 637-648 (2015) - [p2]Rhyd Lewis:
Graph Coloring and Recombination. Handbook of Computational Intelligence 2015: 1239-1254 - 2014
- [j13]Kate Smith-Miles, Davaatseren Baatar, Brendan Wreford, Rhyd Lewis:
Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45: 12-24 (2014) - [c6]Ian M. Cooper, Matthew P. John, Rhydian Lewis, Christine L. Mumford, Andrew Olden:
Optimising large scale public transport network design problems using mixed-mode parallel multi-objective evolutionary algorithms. IEEE Congress on Evolutionary Computation 2014: 2841-2848 - [c5]Matthew P. John, Christine L. Mumford, Rhyd Lewis:
An Improved Multi-objective Algorithm for the Urban Transit Routing Problem. EvoCOP 2014: 49-60 - 2012
- [j12]Rhyd Lewis:
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Ann. Oper. Res. 194(1): 273-289 (2012) - [j11]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): 1933-1950 (2012) - [j10]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): 1988-2000 (2012) - [c4]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: 63-74 - 2011
- [j9]Rhyd Lewis, Jonathan M. Thompson:
On the application of graph colouring techniques in round-robin sports scheduling. Comput. Oper. Res. 38(1): 190-204 (2011) - [j8]Rhyd Lewis, E. Pullin:
Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems. Evol. Comput. 19(4): 693-704 (2011) - [j7]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): 52-65 (2011) - 2010
- [j6]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): 368-378 (2010) - [j5]Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke:
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS J. Comput. 22(1): 120-130 (2010)
2000 – 2009
- 2009
- [j4]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): 2295-2310 (2009) - 2008
- [j3]Rhydian Lewis:
A survey of metaheuristic-based techniques for University Timetabling problems. OR Spectr. 30(1): 167-190 (2008) - 2007
- [j2]Rhyd Lewis:
Metaheuristics can solve sudoku puzzles. J. Heuristics 13(4): 387-401 (2007) - [j1]Rhydian Lewis, Ben Paechter:
Finding Feasible Timetables Using Group-Based Operators. IEEE Trans. Evol. Comput. 11(3): 397-413 (2007) - [c3]Rhydian Lewis:
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case. Hybrid Metaheuristics 2007: 96-107 - [p1]Rhydian Lewis, Ben Paechter, Olivia Rossi-Doria:
Metaheuristics for University Course Timetabling. Evolutionary Scheduling 2007: 237-272 - 2006
- [b1]Rhydian Lewis:
Metaheuristics for university course timetabling. Edinburgh Napier University, UK, 2006 - 2005
- [c2]Rhydian Lewis, Ben Paechter:
An empirical analysis of the grouping genetic algorithm: the timetabling case. Congress on Evolutionary Computation 2005: 2856-2863 - [c1]Rhydian Lewis, Ben Paechter:
Application of the Grouping Genetic Algorithm to University Course Timetabling. EvoCOP 2005: 144-153
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
