All Outputs (6)

A heuristic combination method for solving job-shop scheduling problems. (1998)
Presentation / Conference Contribution
Hart, E., & Ross, P. (1998, September). A heuristic combination method for solving job-shop scheduling problems

This paper describes a heuristic combination based genetic algorithm, (GA), for tackling dynamic job-shop scheduling problems. Our approach is novel in that the genome encodes a choice of algorithm to be used to produce a set of schedulable operation... Read More about A heuristic combination method for solving job-shop scheduling problems..

Producing robust schedules via an artificial immune system. (1998)
Presentation / Conference Contribution
Hart, E., Ross, P., & Nelson, J. (1998, May). Producing robust schedules via an artificial immune system

This paper describes an artificial immune system (AIS) approach
to producing robust schedules for a dynamic jobshop
scheduling problem in which jobs arrive continually,
and the environment is subject to change due to practical
reasons. We investi... Read More about Producing robust schedules via an artificial immune system..

An adaptive mutation scheme for a penalty-based graph-colouring GA. (1998)
Presentation / Conference Contribution
Ross, P., & Hart, E. (1998, September). An adaptive mutation scheme for a penalty-based graph-colouring GA

The folklore of evolutionary algorithms still seems to contain some gross over-generalistions, such as that direct encodings are inferior to indirect ones, that penalty-function methods are often poor, and that observed performance on a few instances... Read More about An adaptive mutation scheme for a penalty-based graph-colouring GA..

A comparison of dominance mechanisms and simple mutation on non-stationary problems. (1998)
Presentation / Conference Contribution
Lewis, J., Hart, E., & Ritchie, G. (1998, September). A comparison of dominance mechanisms and simple mutation on non-stationary problems. Presented at 5th International Conference on Parallel Problem Solving from Nature PPSN 1998, Amsterdam

It is sometimes claimed that genetic algorithms using diploid representations will be more suitable for problems in which the environment changes from time to time, as the additional information stored in the double chromosome will ensure diversity,... Read More about A comparison of dominance mechanisms and simple mutation on non-stationary problems..

Some observations about GA-based exam timetabling. (1998)
Presentation / Conference Contribution
Ross, P., Hart, E., & Corne, D. (1997, August). Some observations about GA-based exam timetabling. Presented at Second International Conference, PATAT’97, Toronto, Canada

Although many people have tried using genetic algorithms (GAs) for exam timetabling, far fewer have done systematic investigations to try to determine whether a GA is a good choice of method or not. We have extensively studied GAs that use one partic... Read More about Some observations about GA-based exam timetabling..

Solving a real-world problem using an evolving heuristically driven schedule builder. (1998)
Journal Article
Hart, E., Ross, P., & Nelson, J. (1998). Solving a real-world problem using an evolving heuristically driven schedule builder. Evolutionary Computation, 6(1), 61-80. https://doi.org/10.1162/evco.1998.6.1.61

This work addresses the real-life scheduling problem of a Scottish company that must produce daily schedules for the catching and transportation of large numbers of live chickens. The problem is complex and highly constrained. We show that it can be... Read More about Solving a real-world problem using an evolving heuristically driven schedule builder..