Skip to main content

Research Repository

Advanced Search

All Outputs (33)

Hyper-heuristics. (2005)
Book Chapter
Ross, P. (2005). Hyper-heuristics. In E. Burke, & G. Kendall (Eds.), Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (529-556). Springer-Verlag

This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can oper... Read More about Hyper-heuristics..

Evolutionary scheduling: a review. (2005)
Journal Article
Hart, E., Ross, P., & Corne, D. (2005). Evolutionary scheduling: a review. Genetic Programming and Evolvable Machines, 6, 191-220. https://doi.org/10.1007/s10710-005-7580-7

Early and seminal work which applied evolutionary computing methods to scheduling problems from 1985 onwards laid a strong and exciting foundation for the work which has been reported over the past decade or so. A survey of the current state-of-the-a... Read More about Evolutionary scheduling: a review..

The impact of the shape of antibody recognition regions on the emergence of idiotypic networks. (2005)
Journal Article
Hart, E., & Ross, P. (2005). The impact of the shape of antibody recognition regions on the emergence of idiotypic networks. International Journal of Unconventional Computing, 1, 281-313

One of the components of an AIS algorithm that most distinguishes it from other paradigms is the use of an affinity funciton. However, for the most part, the implications of choosing a suitable matching rule and the likely effects on the algorithm fr... Read More about The impact of the shape of antibody recognition regions on the emergence of idiotypic networks..

Improving vehicle routing using a customer waiting time colony. (2004)
Presentation / Conference Contribution
Sa'adah, S., Ross, P., & Paechter, B. (2004, April). Improving vehicle routing using a customer waiting time colony

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

Genetic algorithms and timetabling (2003)
Book Chapter
Ross, P., Hart, E., & Corne, D. (2003). Genetic algorithms and timetabling. In A. Ghosh, & K. Tsutsui (Eds.), Advances in Evolutionary Optimisation. Springer. https://doi.org/10.1007/978-3-642-18965-4_30

Genetic algorithms can be used to search very large spaces, and it would seem natural to use them for tackling the nastier kinds of timetabling problem. We completed an EPSRC-funded project on this last year, and distribute a free package that handle... Read More about Genetic algorithms and timetabling.

Routing using evolutionary agents and proactive transitions. (2003)
Book Chapter
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2003). Routing using evolutionary agents and proactive transitions. In Applications of Evolutionary Computing (696-705). Springer-Verlag

The authors have previously introduced the concept of building a delivery network using an agent-based system. The delivery networks are built in response to a real-world problem that involves delivering post to a large number of households within an... Read More about Routing using evolutionary agents and proactive transitions..

Exploiting the analogy between the immune system and sparse distributed memory. (2003)
Journal Article
Hart, E., & Ross, P. (2003). Exploiting the analogy between the immune system and sparse distributed memory. Genetic Programming and Evolvable Machines, 4(4), 333-358. https://doi.org/10.1023/a%3A1026191011609

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 the immune system and sparse distributed memory..

A role for immunology in 'next generation' robots. (2003)
Presentation / Conference Contribution
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)
Presentation / Conference Contribution
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..

Requirements for getting a robot to grow up. (2003)
Presentation / Conference Contribution
Ross, P., Hart, E., Lawson, A., Webb, A., Prem, E., Poelz, P., & Morgavi, G. (2003). Requirements for getting a robot to grow up.

Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics. (2003)
Presentation / Conference Contribution
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..

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

Exploiting the analogy between immunology and sparse distributed memory. (2002)
Presentation / Conference Contribution
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..

Solving a real world routing problem using evolutionary agents. (2002)
Presentation / Conference Contribution
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)
Presentation / Conference Contribution
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..

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.

Enhancing the performance of a GA through visualisation. (2000)
Presentation / Conference Contribution
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..