Dr Jonathan Thompson

(he/him)

Articles

• Monique, S., Lewis, R. and Thompson, J. 2022. A school bus routing heuristic algorithm allowing heterogeneous fleets and bus stop selection. SN Computer Science 4, article number: 74. (10.1007/s42979-022-01466-6)
• Hawa, A., Lewis, R. and Thompson, J. 2022. Exact and approximate methods for the score-constrained packing problem. European Journal of Operational Research 302(3), pp. 847-859. (10.1016/j.ejor.2022.01.028)
• Kheiri, A., Lewis, R., Thompson, J. and Harper, P. 2021. Constructing operating theatre schedules using partitioned graph colouring techniques. Health Systems 10(4), pp. 286-297. (10.1080/20476965.2020.1796530)
• Padungwech, W., Thompson, J. and Lewis, R. 2020. Effects of update frequencies in a dynamic capacitated arc routing problem. Networks 76(4), pp. 522-538. (10.1002/net.21990)
• Hardy, B., Lewis, R. and Thompson, J. 2018. Tackling the edge dynamic graph colouring problem with and without future adjacency information. Journal of Heuristics 24, pp. 321-343. (10.1007/s10732-017-9327-z)
• Kamour, A. et al. 2015. Increasing frequency of severe clinical toxicity after use of 2,4-dinitrophenol in the UK: a report from the National Poisons Information Service. Emergency Medicine Journal 32(5), pp. 383-386. (10.1136/emermed-2013-203335)
• Lewis, R. and Thompson, J. 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)
• Goodman, M., Dowsland, K. A. and Thompson, J. M. 2012. Hybridising GRASP and network flows in the solution of a medical school scheduling problem. Journal of Scheduling 15(6), pp. 717-731. (10.1007/s10951-012-0289-6)
• Lewis, R., Thompson, J. M., Mumford, C. L. and Gillard, J. W. 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)
• Song, X., Lewis, R., Thompson, J. M. and Wu, Y. 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, R., Song, X., Dowsland, K. A. and Thompson, J. M. 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)
• Lewis, R. and Thompson, J. M. 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)
• Song, X., Chu, C. B., Lewis, R., Nie, Y. Y. and Thompson, J. M. 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)
• Goodman, M. D., Dowsland, K. A. and Thompson, J. M. 2009. A GRASP-knapsack hybrid for a nurse-scheduling problem. Journal of Heuristics 15(4), pp. 351-379. (10.1007/s10732-007-9066-7)
• Parr, D. and Thompson, J. M. 2007. Solving the multi-objective nurse scheduling problem with a weighted cost function. Annals of Operations Research 155(1), pp. 279-288. (10.1007/s10479-007-0202-4)
• Dowsland, K. A. and Thompson, J. M. 2007. An improved ant colony optimisation heuristic for graph colouring. Discrete applied mathematics 156(3), pp. 313-324. (10.1016/j.dam.2007.03.025)
• Dowsland, K. A. and Thompson, J. M. 2005. Ant colony optimization for the examination scheduling problem. Journal of the Operational Research Society 56(4), pp. 426-438. (10.1057/palgrave.jors.2601830)
• Dowsland, K. A. and Thompson, J. M. 2000. Solving a Nurse Scheduling Problem with Knapsacks, Networks and Tabu Search. Journal of the Operational Research Society 51(7), pp. 825-833. (10.1057/palgrave.jors.2600970)

Book sections

• Thompson, J. 2024. Genetic algorithms and applications. In: Kulkarni, A. and Gandomi, A. eds. Handbook of Formal Optimization. Singapore: Springer, (10.1007/978-981-19-8851-6_30-1)
• Thompson, J. 2024. Heuristics: An overview. In: Kulkrani, A. J. and Gandomi, A. H. eds. Handbook of formal optimization. Singapore: Springer, (10.1007/978-981-19-8851-6_32-1)
• Alrajhi, K., Thompson, J. and Padungwech, W. 2017. A Heuristic approach for the Dynamic Frequency Assignment problem. In: Chao, F., Schockaert, S. and Zhang, Q. eds. Advances in Computational Intelligence Systems., Vol. 650. Advances in Intelligent Systems and Computing Springer, pp. 91-103., (10.1007/978-3-319-66939-7_8)
• Dowsland, K. A. and Thompson, J. 2012. Simulated annealing. In: Rozenberg, G., Back, T. and Kok, J. N. eds. Handbook of Natural Computing. Springer Reference Springer-Verlag, pp. 1623-1655., (10.1007/978-3-540-92910-9_49)

Conferences

• Sciortino, M., Lewis, R. and Thompson, J. 2021. A heuristic algorithm for school bus routing with bus stop selection. Presented at: EvoCOP 2021, Seville, Spain, Apr 2021 Presented at Zarges, C. and Verel, S. eds.Evolutionary Computation in Combinatorial Optimization, Vol. 12692. Lecture Notes in Computer Science/Theoretical Computer Science and General Issues Springer Verlag, (10.1007/978-3-030-72904-2_13)
• Hawa, A. L., Lewis, R. and Thompson, J. M. 2018. Heuristics for the score-constrained strip-packing problem. Presented at: COCOA 2018: International Conference on Combinatorial Optimization and Applications, Atlanta, GA, USA, 15-17 December 2018 Presented at Kim, D., Uma, R. N. and Zelikovsky, A. eds.Combinatorial Optimization and Applications: 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings, Vol. 11346. Lecture Notes in Computer Science Springer Verlag pp. 449., (10.1007/978-3-030-04651-4_30)
• Padungwech, W., Thompson, J. and Lewis, R. 2016. Investigating edge-reordering procedures in a tabu search algorithm for the capacitated arc routing problem. Presented at: HM 2016: International Workshop on Hybrid Metaheuristics, Plymouth, UK, 8-10 June 2016 Presented at Blesa, M. J., Blum, C. and Cangelosi, A. eds.Hybrid Metaheuristics: 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings, Vol. 9668. Lecture Notes in Computer Science Cham: Springer pp. 62-74., (10.1007/978-3-319-39636-1_5)
• Hardy, B., Lewis, R. and Thompson, J. M. 2016. Modifying colourings between time-steps to tackle changes in dynamic random graphs. Presented at: EvoCOP 2016: European Conference on Evolutionary Computation in Combinatorial Optimization, Porto, Portugal, 30 March - 1 April 2016 Presented at Chicano, F., Hu, B. and Garcia-Sanchez, P. eds.Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 – April 1, 2016, Proceedings, Vol. 9595. Springer pp. 186-201., (10.1007/978-3-319-30698-8_13)
• Kheiri, A., Özcan, E., Lewis, R. and Thompson, J. 2016. A Sequence-based selection hyper-heuristic: a case study in nurse rostering. Presented at: PATAT 2016: 11th International Conference on the Practice and Theory of Automated Timetabling, Udine, Italy, 23-26 August 2016 Presented at Burke, E. K. et al. eds.PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling. pp. 503-505.
• Rowse, E. L., Lewis, R., Harper, P. R. and Thompson, J. M. 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.
• Holborn, P. L., Thompson, J. M. and Lewis, R. 2012. Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows. Presented at: EvoCOP 2012: 12th European Conference on Evolutionary Computation in Combinatorial Optimization, Malaga, Spain, 11-13 April 2012 Presented at Hao, J. K. and Middendorf, M. eds.Evolutionary Computation in Combinatorial Optimization: 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings, Vol. 7245. Lecture Notes in Computer Science Springer Verlag pp. 63-74., (10.1007/978-3-642-29124-1_6)
• Staggemeier, A., Thompson, J. M., Smith, J. and Clark, A. 2007. Improving our knowledge of metaheuristic approaches for cell suppression problems. Presented at: UNECE/Eurostat Work Session on Statistical Data Confidentiality, Manchester, UK, 17-19 December 2007Proceedings of the Eurostat Conference on Statistical Data Confidentiality. Titchford: Eurostat, (10.2901/Eurostat.C2007.004)

• Goodman, M., Dowsland, K. A. and Thompson, J. M. 2012. Hybridising GRASP and network flows in the solution of a medical school scheduling problem. Journal of Scheduling 15(6), pp. 717-731. (10.1007/s10951-012-0289-6)
• Dowsland, K. A. and Thompson, J. 2012. Simulated annealing. In: Rozenberg, G., Back, T. and Kok, J. N. eds. Handbook of Natural Computing. Springer Reference Springer-Verlag, pp. 1623-1655., (10.1007/978-3-540-92910-9_49)
• Lewis, R., Song, X., Dowsland, K. A. and Thompson, J. M. 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)
• Goodman, M. D., Dowsland, K. A. and Thompson, J. M. 2009. A GRASP-knapsack hybrid for a nurse-scheduling problem. Journal of Heuristics 15(4), pp. 351-379. (10.1007/s10732-007-9066-7)