Skip to main content

Research Repository

Advanced Search

All Outputs (181)

A systematic investigation of GA performance on jobshop scheduling problems. (2003)
Presentation / Conference Contribution
Hart, E., & Ross, P. (2000, April). A systematic investigation of GA performance on jobshop scheduling problems. Presented at EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight, Edinburgh

Although there has been a wealth of work reported in the literature on the application of genetic algorithms (GAs) to jobshop scheduling problems, much of it contains some gross over-generalisations, i.e that the observed performance of a GA on a sma... Read More about A systematic investigation of GA performance on jobshop scheduling problems..

Exploiting the analogy between immunology and sparse distributed memory. (2002)
Presentation / Conference Contribution
Hart, E., & Ross, P. (2002, September). Exploiting the analogy between immunology and sparse distributed memory. Presented at ICARIS 2002

The relationship between immunological memory and a class of associative memories known as sparse distributed memories (SDM) is well known. This paper proposes a new model for clustering non-stationary data based on a combination of salient features... Read More about Exploiting the analogy between immunology and sparse distributed memory..

Combining choices of heuristics. (2002)
Book Chapter
Ross, P., & Hart, E. (2002). Combining choices of heuristics. In R. Sarker, M. Mohammadian, & X. Yao (Eds.), Evolutionary Optimization (229-252). Kluwer

Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. (2002)
Presentation / Conference Contribution
Ross, P., Schulenburg, S., Marin-Blazquez, J. G., & Hart, E. (2002, July). Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. Presented at Genetic and Evolutionary Computation Conference (GECCO)

Evolutionary algorithms (EAs) often appear to be a ‘black box’, neither offering worst-case bounds nor any guarantee of optimality when used to solve individual problems. They can also take much longer than non-evolutionary methods. We
try to addres... Read More about Hyper-heuristics: learning to combine simple heuristics in bin-packing problems..

Improving street based routing using building block mutations. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002, April). Improving street based routing using building block mutations. Presented at Workshops on Applications of Evolutionary Computation EvoWorkshops 2002, Kinsale, Ireland

Street based routing (SBR) is a real-world inspired routing problem that builds routes within an urban area for mail deliveries. The authors have previously attempted to solve this problem using an Evolutionary Algorithm (EA). In this paper the autho... Read More about Improving street based routing using building block mutations..

GAVEL - a new tool for genetic algorithm visualization (2001)
Journal Article
Hart, E., & Ross, P. (2001). GAVEL - a new tool for genetic algorithm visualization. IEEE Transactions on Evolutionary Computation, 5(4), 335-348. https://doi.org/10.1109/4235.942528

This paper surveys the state of the art in evolutionary algorithm visualization and describes a new tool called GAVEL. It provides a means to examine in a genetic algorithm (GA) how crossover and mutation operations assembled the final result, where... Read More about GAVEL - a new tool for genetic algorithm visualization.

Clustering Moving Data with a Modified Immune Algorithm (2001)
Presentation / Conference Contribution
Hart, E., & Ross, P. (2001, April). Clustering Moving Data with a Modified Immune Algorithm. Presented at Workshops on Applications of Evolutionary Computation EvoWorkshops 2001, Como, Italy

In this paper we present a prototype of a new model for performing clustering in large, non-static databases. Although many machine learning algorithms for data clustering have been proposed, none appear to specifically address the task of clustering... Read More about Clustering Moving Data with a Modified Immune Algorithm.

Street-based routing using an evolutionary algorithm (2001)
Presentation / Conference Contribution
Urquhart, N. B., Paechter, B., & Chisholm, K. (2001, April). Street-based routing using an evolutionary algorithm. Presented at Workshops on Applications of Evolutionary Computation EvoWorkshops 2001, Como, Italy

Much research has been carried out into solving routing problems using both Evolutionary Techniques and other methods. In this paper the authors investigate the usage of an Evolutionary Algorithms to solve the Street-Based Routing Problem (SBRP). The... Read More about Street-based routing using an evolutionary algorithm.

Enhancing the performance of a GA through visualisation. (2000)
Presentation / Conference Contribution
Hart, E., & Ross, P. (2000, July). Enhancing the performance of a GA through visualisation. Presented at GECCO 2000

This article describes a new tool for visualising genetic algorithms, (GAs) which is designed in order to allow the implicit mechanisms
of the GA | i.e. crossover and mutation | to be thoroughly analysed. This allows the user to determine whether th... Read More about Enhancing the performance of a GA through visualisation..

Real-world applications of evolutionary computing (2000)
Presentation / Conference Contribution
Cagnoni, S., Poli, R., Smith, G. D., Corne, D., Oates, M., Hart, E., Lanzi, P. L., Willem, E. J., Li, Y., Paechter, B., & Fogarty, T. C. (2000, April). Real-world applications of evolutionary computing. Presented at EvoWorkshops 2000, Edinburgh, Scotland

This book constitutes the refereed proceedings of six workshops on evolutionary computation held concurrently as EvoWorkshops 2000 in Edinburgh, Scotland, UK, in April 2000.
The 37 revised papers presented were carefully reviewed and selected by the... Read More about Real-world applications of evolutionary computing.

Optimising an evolutionary algorithm for scheduling (2000)
Presentation / Conference Contribution
Urquhart, N. B., Chisholm, K., & Paechter, B. (2000, April). Optimising an evolutionary algorithm for scheduling. Presented at EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight,, Edinburgh

This paper examines two techniques for setting the parameters of an evolutionary Algorithm (EA). The example EA used for test purposes undertakes a simple scheduling problem. An initial version of the EA was tested utilising a set of parameters that... Read More about Optimising an evolutionary algorithm for scheduling.

An immune system approach to scheduling in changing environments. (1999)
Presentation / Conference Contribution
Hart, E., & Ross, P. (1999, July). An immune system approach to scheduling in changing environments. Presented at Genetic and Evolutionary Computation Conference ; GECCO-99

This paper describes the application of an artificial immune system, (AIS), model to a scheduling application, in which sudden changes in the scheduling environment require the rapid production of new schedules. The model operates in two phases: In t... Read More about An immune system approach to scheduling in changing environments..

Scheduling chicken catching - an investigation into the success of a genetic algorithm on a real world scheduling problem. (1999)
Journal Article
Hart, E., Ross, P., & Nelson, J. (1999). Scheduling chicken catching - an investigation into the success of a genetic algorithm on a real world scheduling problem. Annals of Operations Research, 92, 363-380. https://doi.org/10.1023/A%3A1018951218434

Genetic Algorithms (GAs) are a class of evolutionary algorithms that have been successfully
applied to scheduling problems, in particular job-shop and flow-shop type problems
where a number of theoretical benchmarks exist. This work applies a genet... Read More about Scheduling chicken catching - an investigation into the success of a genetic algorithm on a real world scheduling problem..

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..

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..

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 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..