Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Browse by Current Cardiff authors

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 31.

Hardy, Bradley, Lewis, Rhyd and Thompson, Jonathan Mark 2017. Tackling the edge dynamic graph colouring problem with and without future adjacency information. Journal of Heuristics 10.1007/s10732-017-9327-z
file

Lewis, Rhyd and Carroll, Fiona 2016. Creating seating plans: a practical application. Journal of the Operational Research Society 67 (11) , pp. 1353-1362. 10.1057/jors.2016.34
Item availability restricted.
file

Lewis, Rhyd and Holborn, Penny 2016. How to pack trapezoids: exact and evolutionary algorithms. IEEE Transactions on Evolutionary Computation 10.1109/TEVC.2016.2609000
file

Padungwech, Wasin, Thompson, Jonathan and Lewis, Rhyd 2016. Investigating edge-reordering procedures in a tabu search algorithm for the capacitated arc routing problem. Lecture Notes in Computer Science 9668 , pp. 62-74. 10.1007/978-3-319-39636-1_5
Item availability restricted.
file

Hardy, Bradley, Lewis, Rhyd and Thompson, Jonathan Mark 2016. Modifying colourings between time-steps to tackle changes in dynamic random graphs. Lecture Notes in Computer Science 9595 , pp. 186-201. 10.1007/978-3-319-30698-8_13
file

Lewis, Rhydian 2016. Graph colouring: an ancient problem with modern applications. Impact 3 , pp. 47-50.

Lewis, Rhyd 2015. A guide to graph colouring: algorithms and applications. Springer.

Lewis, Rhyd and Thompson, Jonathan 2015. Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. European Journal of Operational Research 240 (3) , pp. 637-648. 10.1016/j.ejor.2014.07.041
file

Lewis, Rhyd 2015. Graph coloring and recombination. In: Kacprzyk, J. and Pedrycz, W. eds. Springer Handbook of Computational Intelligence, Springer, pp. 1239-1254. (10.1007/978-3-662-43505-2_63)

Rowse, Elizabeth Louise, Lewis, Rhydian, Harper, Paul Robert and Thompson, Jonathan Mark 2015. Applying set partitioning methods in the construction of operating theatre schedules. Presented at: International Conference on Theory and Practice in Modern Computing 2015, Las Palmas de Gran Canaria, Spain, 22-24 July 2015.
file

Smith-Miles, Kate, Baatar, Davaatseren, Wreford, Brendan and Lewis, Rhyd 2014. Towards objective measures of algorithm performance across instance space. Computers & Operations Research 45 , pp. 12-24.
file

John, Matthew P., Mumford, Christine L. and Lewis, Rhyd 2014. An improved multi-objective algorithm for the urban transit routing problem. Lecture Notes in Computer Science 8600 , pp. 49-60. 10.1007/978-3-662-44320-0_5
file

Cooper, Ian, John, Matthew P., Lewis, Rhydian, Mumford, Christine Lesley and Olden, Andrew 2014. Optimising large scale public transport network design problems using mixed-mode parallel multi-objective evolutionary algorithms. Presented at: IEEE Congress on Evolutionary Computation, Beijing, China, 6 - 11 July 2014. Evolutionary Computation (CEC). IEEE, pp. 2841-2848. 10.1109/CEC.2014.6900362
file

Lewis, Rhydian and Carroll, Fiona 2013. The "engaged" interaction: important considerations for the HCI design and development of a web application for solving a complex combinatorial optimization problem. World Journal of Computer Application and Technology 1 (3) , pp. 75-82.
file

Lewis, Rhyd, Thompson, Jonathan Mark, Mumford, Christine Lesley and Gillard, Jonathan William 2012. A wide-ranging computational comparison of high-performance graph colouring algorithms. Computers & Operations Research 39 (9) , pp. 1933-1950. 10.1016/j.cor.2011.08.010
file

Song, Xiang, Lewis, Rhyd, Thompson, Jonathan Mark and Wu, Yue 2012. An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. Computers & Operations Research 39 (9) , pp. 1988-2000. 10.1016/j.cor.2011.09.012

Lewis, Rhyd 2012. A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Annals of Operations Research 194 (1) , pp. 273-289. 10.1007/s10479-010-0696-z
file

Holborn, Penny Louise, Thompson, Jonathan Mark and Lewis, Rhyd 2012. Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows. Lecture Notes in Computer Science 7245 , pp. 63-74. 10.1007/978-3-642-29124-1_6
file

Lewis, Rhyd, Song, Xiang, Dowsland, Kathryn Anne and Thompson, Jonathan Mark 2011. An investigation into two bin packing problems with ordering and orientation implications. European Journal of Operational Research 213 (1) , pp. 52-65. 10.1016/j.ejor.2011.03.016
file

Lewis, Rhyd and Thompson, Jonathan Mark 2011. On the application of graph colouring techniques in round-robin sports scheduling. Computers & Operations Research 38 (1) , pp. 190-204. 10.1016/j.cor.2010.04.012
file

Lewis, Rhyd and Pullin, Emma J. 2011. Revisiting the restricted growth function genetic algorithm for grouping problems. Evolutionary Computation 19 (4) , pp. 693-704. 10.1162/EVCO_a_00040
file

Song, Xiang, Chu, C. B., Lewis, Rhyd, Nie, Y. Y. and Thompson, Jonathan Mark 2010. A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting. European Journal of Operational Research 202 (2) , pp. 368-378. 10.1016/j.ejor.2009.05.047

McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, Rhyd, Parkes, A. J., Gaspero, L. D., Qu, R. and Burke, E. K. 2009. Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS Journal on Computing 22 (1) , pp. 120-130. 10.1287/ijoc.1090.0320

Lewis, Rhyd 2009. A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing. Computers & Operations Research 36 (7) , pp. 2295-2310. 10.1016/j.cor.2008.09.004
file

Lewis, Rhydian, Paechter, Ben and McCollum, Barry 2007. Post enrolment based course timetabling: a description of the problem model used for track two of the second International Timetabling Competition. [Working Paper]. Cardiff Working Papers in Accounting and Finance, Cardiff: Cardiff University.
file

Lewis, Rhyd and Paechter, Ben 2007. Finding feasible timetables using group-based operators. IEEE Transactions on Evolutionary Computation 11 (3) , pp. 397-413. 10.1109/TEVC.2006.885162
file

Lewis, Rhyd 2007. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30 (1) , pp. 167-190. 10.1007/s00291-007-0097-0
file

Lewis, Rhyd 2007. Metaheuristics can solve sudoku puzzles. Journal of Heuristics 13 (4) , pp. 387-401. 10.1007/s10732-007-9012-8
file

Lewis, Rhyd 2007. On the combination of constraint programming and stochastic search: the Sudoku case. Hybrid Metaheuristics, Lecture Notes in Computer Science, vol. 4771. Springer, pp. 96-107. (10.1007/978-3-540-75514-2_8)
file

Lewis, Rhyd, Paechter, Ben and Rossi-Doria, Olivia 2007. Metaheuristics for university course timetabling. In: Dahal, Keshav P., Tan, Kay Chen and Cowling, Peter I. eds. Evolutionary Scheduling, Studies in Computational Intelligence, vol. 49. Springer, pp. 237-272. (10.1007/978-3-540-48584-1_9)

Lewis, Rhyd and Paechter, Ben 2005. Application of the grouping genetic algorithm to university course timetabling. Lecture Notes in Computer Science 3448 , pp. 144-153. 10.1007/978-3-540-31996-2_14

This list was generated on Thu Sep 21 12:36:07 2017 BST.