James P. Newall

According to our database, James P. Newall authored at least 8 papers between 1995 and 2004.

Collaborative distances:

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

2004

Solving Examination Timetabling Problems through Adaption of Heuristic Orderings.

Edmund K. Burke, James P. Newall

Ann. Oper. Res., 2004

2003

Hyper-Heuristics: An Emerging Direction in Modern Search Technology.

Edmund K. Burke, Graham Kendall, Jim Newall, Emma Hart, Peter Ross, Sonia Schulenburg

Proceedings of the Handbook of Metaheuristics, 2003

2002

Enhancing Timetable Solutions with Local Search Methods.

Edmund K. Burke, James P. Newall

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

1999

Hybrid methods for automated timetabling.

James P. Newall

PhD thesis, 1999

A multistage evolutionary algorithm for the timetable problem.

Edmund K. Burke, James P. Newall

IEEE Trans. Evol. Comput., 1999

1998

Initialization Strategies and Diversity in Evolutionary Timetabling.

Edmund K. Burke, Rupert F. Weare, James P. Newall

Evol. Comput., 1998

1997

A Phased Evolutionary Approach for the Timetable Problem: An Initial Study.

Edmund Kieran Burke, James P. Newall

Proceedings of the Progress in Connectionist-Based Information Systems: Proceedings of the 1997 International Conference on Neural Information Processing and Intelligent Information Systems, 1997

1995

A Memetic Algorithm for University Exam Timetabling.

Edmund K. Burke, James P. Newall, Rupert F. Weare

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