Skip to main content

Research Repository

Advanced Search

All Outputs (21)

Improving vehicle routing using a customer waiting time colony. (2004)
Conference Proceeding
Sa'adah, S., Ross, P., & Paechter, B. (2004). Improving vehicle routing using a customer waiting time colony. In J. Gottlieb, & G. Raidl (Eds.), Evolutionary Computation in Combinatorial Optimization (188-198). https://doi.org/10.1007/978-3-540-24652-7_19

In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to minimise the total distance travelled by all vehicles. This paper describes so... Read More about Improving vehicle routing using a customer waiting time colony..

Requirements for getting a robot to grow-up (2003)
Conference Proceeding
Ross, P., Hart, E., Lawson, A., Webb, A., Prem, E., Poelz, P., & Morgavi, G. (2003). Requirements for getting a robot to grow-up. In W. Banzhaf, T. Christaller, P. Dittrich, J. T. Kim, & J. Ziegler (Eds.), Advances in Artificial Life 7th European Conference, ECAL 2003, Dortmund, Germany, September 14-17, 2003. Proceedings (847-856). https://doi.org/10.1007/978-3-540-39432-7_91

Much of current robot research is about learning tasks in which the task to be achieved is pre-specified, a suitable technology for the task is chosen and the learning process is then experimentally investigated. In this paper we discuss a different... Read More about Requirements for getting a robot to grow-up.

A role for immunology in 'next generation' robots. (2003)
Conference Proceeding
Hart, E., Ross, P., Webb, A., & Lawson, A. (2003). A role for immunology in 'next generation' robots. In J. Timmis, P. Bentley, & E. Hart (Eds.), Artificial Immune Systems. ICARIS 2003 (46-56). https://doi.org/10.1007/978-3-540-45192-1_5

Much of current robot research is about learning tasks in which the task to be achieved is pre-specified, a suitable technology for the task is chosen and the learning process is experimentally investigated. A more interesting research question is ho... Read More about A role for immunology in 'next generation' robots..

Controlling a simulated Khepera with an XCS classifier system with memory. (2003)
Conference Proceeding
Webb, A., Hart, E., Ross, P., & Lawson, A. (2003). Controlling a simulated Khepera with an XCS classifier system with memory.

Autonomous agents commonly suffer from perceptual aliasing in which differing situations are perceived as identical by the robots sensors, yet require different courses of action. One technique for addressing this problem is to use additional interna... Read More about Controlling a simulated Khepera with an XCS classifier system with memory..

Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics. (2003)
Conference Proceeding
Ross, P., Marin-Blazquez, J. G., Schulenburg, S., & Hart, E. (2003). Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics.

The idea underlying hyper-heuristics is to discover some combination of familiar, straightforward heuristics that performs very well across a whole range of problems. To be worthwhile, such a combination should outperform all of the constituent heur... Read More about Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics..

A systematic investigation of GA performance on jobshop scheduling problems. (2003)
Conference Proceeding
Hart, E., & Ross, P. (2003). A systematic investigation of GA performance on jobshop scheduling problems. In Real-World Applications of Evolutionary Computing (280-289). https://doi.org/10.1007/3-540-45561-2_27

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)
Conference Proceeding
Hart, E., & Ross, P. (2002). Exploiting the analogy between immunology and sparse distributed memory. In J. Timmis, & P. J. Bentley (Eds.), ICARIS 2002 : 1st International Conference on Artificial Immune Systems (59-67)

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

Multiple-goal learning in robots using the MAXSON neural network architecture. (2002)
Conference Proceeding
Webb, A., Ross, P., & Hart, E. (2002). Multiple-goal learning in robots using the MAXSON neural network architecture. In B. Hallam, D. Floreano, G. Hayes, J. A. Meyere, & J. Hallam (Eds.), SAB'02 Workshop: On Growing Up Artifacts that Live - Basic Principles and Future Trends

No abstract available.

Solving a real world routing problem using multiple evolutionary algorithms. (2002)
Conference Proceeding
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Solving a real world routing problem using multiple evolutionary algorithms. In Parallel Problem Solving from Nature — PPSN VII (871-880). https://doi.org/10.1007/3-540-45712-7_84

This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are invest... Read More about Solving a real world routing problem using multiple evolutionary algorithms..

Solving a real world routing problem using evolutionary agents. (2002)
Conference Proceeding
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Solving a real world routing problem using evolutionary agents.

This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are invest... Read More about Solving a real world routing problem using evolutionary agents..

Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. (2002)
Conference Proceeding
Ross, P., Schulenburg, S., Marin-Blazquez, J. G., & Hart, E. (2002). Hyper-heuristics: learning to combine simple heuristics in bin-packing problems.

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)
Conference Proceeding
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Improving street based routing using building block mutations. In J. Gottlieb, E. Hart, & S. Cagnoni (Eds.), Applications of Evolutionary Computing: EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN Kinsale, Ireland, April 3–4, 2002 Proceedings (189-202). https://doi.org/10.1007/3-540-46004-7_33

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

Clustering Moving Data with a Modified Immune Algorithm (2001)
Conference Proceeding
Hart, E., & Ross, P. (2001). Clustering Moving Data with a Modified Immune Algorithm. In E. Boers (Ed.), Applications of Evolutionary Computing (394-403). https://doi.org/10.1007/3-540-45365-2_41

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.

Enhancing the performance of a GA through visualisation. (2000)
Conference Proceeding
Hart, E., & Ross, P. (2000). Enhancing the performance of a GA through visualisation. In Proceedings of 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..

An immune system approach to scheduling in changing environments. (1999)
Conference Proceeding
Hart, E., & Ross, P. (1999). An immune system approach to scheduling in changing environments. In W. Banzhaf, J. M. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, & R. E. Smith (Eds.), GECCO-99 : proceedings of the genetic and evolutionary computation conference. Volume 2 (1559-1566)

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

A heuristic combination method for solving job-shop scheduling problems. (1998)
Conference Proceeding
Hart, E., & Ross, P. (1998). A heuristic combination method for solving job-shop scheduling problems. In A. E. Eiben, T. Back, M. Schoenauer, & H. Schwefel (Eds.), Parallel Problem Solving from Nature V (845-854). https://doi.org/10.1007/BFb0056926

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)
Conference Proceeding
Hart, E., Ross, P., & Nelson, J. (1998). Producing robust schedules via an artificial immune system. In Proceedings of International Conference on Evolutionary Computing (464-469). https://doi.org/10.1109/ICEC.1998.699852

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)
Conference Proceeding
Ross, P., & Hart, E. (1998). An adaptive mutation scheme for a penalty-based graph-colouring GA. In A. E. Eiben, T. Back, M. Schoenauer, & H. Schwefel (Eds.), Parallel Problem Solving from Nature V (795-802). https://doi.org/10.1007/BFb0056921

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