Skip to main content

Research Repository

Advanced Search

Stone Soup (2000)
Conference Proceeding
Paechter, B., Fogarty, T. C., Burke, E., Cumming, A., & Rankin, B. (2000). Stone Soup. In Practice and Theory of Automated Timetabling III

Post-publication timetabling. (2000)
Conference Proceeding
Cumming, A., Paechter, B., & Rankin, R. C. (2000). Post-publication timetabling. In 3rd International Conference on the Practice And Theory of Automated Timetabling, PATAT 2000 (107-108)

Multiple traffic signal control using a genetic algorithm (1999)
Conference Proceeding
Kalganova, T., Russell, G., & Cumming, A. (1999). Multiple traffic signal control using a genetic algorithm. In A. Dobnikar, N. C. Steele, D. W. Pearson, & R. F. Albrecht (Eds.), Artificial Neural Nets and Genetic Algorithms (220-228). https://doi.org/10.1007/978-3-7091-6384-9_38

Optimising traffic signal timings for a multiple-junction road network is a difficult but important problem. The essential difficulty of this problem is that the traffic signals need to coordinate their behaviours to achieve the common goal of optimi... Read More about Multiple traffic signal control using a genetic algorithm.

Timetabling the classes of an entire university with an evolutionary algorithm. (1998)
Conference Proceeding
Paechter, B., Rankin, B., Cumming, A., & Fogarty, T. C. (1998). Timetabling the classes of an entire university with an evolutionary algorithm. In T. Beck, & M. Schoenauer (Eds.), Parallel Problem Solving from Nature - PPSN V (865-874). https://doi.org/10.1007/BFb0056928

This paper describes extensions to an evolutionary algorithm that timetables classes for an entire University. A new method of dealing with multi-objectives is described along with a user interface designed for it. New results are given concerning re... Read More about Timetabling the classes of an entire university with an evolutionary algorithm..

Improving a lecture timetabling system for university wide use (1998)
Conference Proceeding
Paechter, B., Rankin, B., & Cumming, A. (1998). Improving a lecture timetabling system for university wide use. In Practice and Theory of Automated Timetabling II (156-165). https://doi.org/10.1007/BFb0055887

During the academic year 1996/97 the authors were commissioned by their institution to produce an automated timetabling system for use by all departments within the Faculty of Science. The system had to cater for the varying requirements of all the d... Read More about Improving a lecture timetabling system for university wide use.

Extensions to a memetic timetabling system. (1996)
Conference Proceeding
Paechter, B., Cumming, A., Norman, M. G., & Luchian, H. (1996). Extensions to a memetic timetabling system. In R. Burke (Ed.), Practice and Theory of Automated Timetabling (251-265). https://doi.org/10.1007/3-540-61794-9_64

This paper describes work in progress to increase the performance of a memetic timetabling system. The features looked at are two directed mutation operators, targeted mutation and a structured population that facilitates parallel implementation. Exp... Read More about Extensions to a memetic timetabling system..

Lessons from experience: making theorem provers more co-operative. (1996)
Conference Proceeding
Lowe, H., Cumming, A., Smyth, M., & Varey, A. (1996). Lessons from experience: making theorem provers more co-operative. In Proceedings of the Second Workshop on User Interfaces for Theorm Provers (67-74)

We describe our experiences in trying to build a co-operative theorem proving system. Our model of co-operation is that of a user and an automaton combining forces to prove theorems in a semi-automated theorem proving system. We describe various unde... Read More about Lessons from experience: making theorem provers more co-operative..

The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. (1995)
Conference Proceeding
Paechter, B., Cumming, A., & Luchian, H. (1995). The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. In Evolutionary Computing (86-93). https://doi.org/10.1007/3-540-60469-3_27

This paper presents a new genetic representation for timetabling with evolutionary algorithms. The representation involves the use of suggestion lists for the placement of events into timeslots. A set of recombination operators is defined for the new... Read More about The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms..

Two solutions to the general timetable problem using evolutionary algorithms. (1994)
Conference Proceeding
Paechter, B., Luchian, H., Cumming, A., & Petriuc, M. (1994). Two solutions to the general timetable problem using evolutionary algorithms. In Proceedings of the IEEE World Congress in Computational Intelligence (300-305). https://doi.org/10.1109/ICEC.1994.349935

The general timetable problem, which involves the placing of events requiring limited resources into timeslots, has been approached in many different ways. This paper describes two approaches to solving the problem using evolutionary algorithms.... Read More about Two solutions to the general timetable problem using evolutionary algorithms..

An evolutionary approach to the general timetable problem. (1993)
Book Chapter
Paechter, B., Luchian, H., & Cumming, A. (1993). An evolutionary approach to the general timetable problem. In The Scientific Annals of the "Al. I. Cuza" University of Iasi, special issue for the ROSYCS symposium 1993. Alexandru Ioan Cuza University Press