Jonathan M. Thompson

According to our database, Jonathan M. Thompson authored at least 28 papers between 1995 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection.

Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson

SN Comput. Sci., 2023

2022

Exact and approximate methods for the score-constrained packing problem.

Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson

Eur. J. Oper. Res., 2022

2021

A Heuristic Algorithm for School Bus Routing with Bus Stop Selection.

Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2021

2020

Effects of update frequencies in a dynamic capacitated arc routing problem.

Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis

Networks, 2020

2018

Tackling the edge dynamic graph colouring problem with and without future adjacency information.

Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson

J. Heuristics, 2018

Heuristics for the Score-Constrained Strip-Packing Problem.

Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

A Heuristic Approach for the Dynamic Frequency Assignment Problem.

Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech

Proceedings of the Advances in Computational Intelligence Systems, 2017

2016

Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem.

Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis

Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem.

Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech

Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs.

Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016

2015

Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem.

Rhydian Lewis, Jonathan M. Thompson

Eur. J. Oper. Res., 2015

2012

Simulated Annealing.

Kathryn A. Dowsland, Jonathan M. Thompson

Proceedings of the Handbook of Natural Computing, 2012

Hybridising GRASP and network flows in the solution of a medical school scheduling problem.

Melissa D. Goodman, Kathryn A. Dowsland, Jonathan M. Thompson

J. Sched., 2012

An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem.

Xiang Song, Rhyd Lewis, Jonathan M. Thompson, Yue Wu

Comput. Oper. Res., 2012

A wide-ranging computational comparison of high-performance graph colouring algorithms.

Rhyd Lewis, Jonathan M. Thompson, Christine L. Mumford, J. Gillard

Comput. Oper. Res., 2012

Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows.

Penny L. Holborn, Jonathan M. Thompson, Rhyd Lewis

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

2011

An investigation into two bin packing problems with ordering and orientation implications.

Rhyd Lewis, Xiang Song, Kathryn A. Dowsland, Jonathan M. Thompson

Eur. J. Oper. Res., 2011

On the application of graph colouring techniques in round-robin sports scheduling.

Rhyd Lewis, Jonathan M. Thompson

Comput. Oper. Res., 2011

2010

A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting.

Xiang Song, C. B. Chu, Rhyd Lewis, Y. Y. Nie, Jonathan M. Thompson

Eur. J. Oper. Res., 2010

2009

A grasp-knapsack hybrid for a nurse-scheduling problem.

Melissa D. Goodman, Kathryn A. Dowsland, Jonathan M. Thompson

J. Heuristics, 2009

2008

An improved ant colony optimisation heuristic for graph colouring.

Kathryn A. Dowsland, Jonathan M. Thompson

Discret. Appl. Math., 2008

2007

Solving the multi-objective nurse scheduling problem with a weighted cost function.

D. Parr, Jonathan M. Thompson

Ann. Oper. Res., 2007

2005

Ant colony optimization for the examination scheduling problem.

Kathryn A. Dowsland, Jonathan M. Thompson

J. Oper. Res. Soc., 2005

2002

GRASPing the Examination Scheduling Problem.

Stephen Casey, Jonathan M. Thompson

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2000

Solving a nurse scheduling problem with knapsacks, networks and tabu search.

Kathryn A. Dowsland, Jonathan M. Thompson

J. Oper. Res. Soc., 2000

1998

A robust simulated annealing based examination timetabling system.

Jonathan M. Thompson, Kathryn A. Dowsland

Comput. Oper. Res., 1998

1996

Variants of simulated annealing for the examination timetabling problem.

Jonathan M. Thompson, Kathryn A. Dowsland

Ann. Oper. Res., 1996

1995

General Cooling Schedules for a Simulated Annealing Based Timetabling System.

Jonathan M. Thompson, Kathryn A. Dowsland

Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995