Genetics and competing strategies in a threshold model for mail processing

Research output: Working paperTechnical report

Abstract

Multi-agent algorithms inspired by the division of labour in social insects are applied to a problem of distributed mail retrieval in which agents must visit mail producing cities and choose between mail types under certain constraints.The efficiency (i.e. the average amount of mail retrieved per time step), and the flexibility (i.e. the capability of the agents to react to changes in the environment) are investigated both in static and dynamic environments. New rules for mail selection and specialisation are introduced and are shown to exhibit improved efficiency and flexibility compared to existing ones. We employ a genetic algorithm which allows the various rules to evolve and compete. Apart from obtaining optimised parameters for the various rules for any environment, we also observe extinction and speciation. From a more theoretical point of view, in order to avoid finite size effects, most results are obtained for large population sizes. However, we do analyse the influence of population size on the performance. Furthermore, we critically analyse the causes of efficiency loss, derive the exact dynamics of the model in the large system limit under certain conditions, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.
Original languageEnglish
Place of PublicationBirmingham
PublisherAston University
Number of pages34
ISBN (Print)NCRG/2008/003
Publication statusPublished - 16 May 2008

Fingerprint

Processing
Genetic algorithms
Personnel
Genetics

Keywords

  • Distributed mail retrieval problem
  • Rules for mail selection and specialization
  • mail processing problem

Cite this

@techreport{59c05af0dd4b4e719b226514b9a4f06d,
title = "Genetics and competing strategies in a threshold model for mail processing",
abstract = "Multi-agent algorithms inspired by the division of labour in social insects are applied to a problem of distributed mail retrieval in which agents must visit mail producing cities and choose between mail types under certain constraints.The efficiency (i.e. the average amount of mail retrieved per time step), and the flexibility (i.e. the capability of the agents to react to changes in the environment) are investigated both in static and dynamic environments. New rules for mail selection and specialisation are introduced and are shown to exhibit improved efficiency and flexibility compared to existing ones. We employ a genetic algorithm which allows the various rules to evolve and compete. Apart from obtaining optimised parameters for the various rules for any environment, we also observe extinction and speciation. From a more theoretical point of view, in order to avoid finite size effects, most results are obtained for large population sizes. However, we do analyse the influence of population size on the performance. Furthermore, we critically analyse the causes of efficiency loss, derive the exact dynamics of the model in the large system limit under certain conditions, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.",
keywords = "Distributed mail retrieval problem, Rules for mail selection and specialization, mail processing problem",
author = "Harry Goldingay and {van Mourik}, Jort",
year = "2008",
month = "5",
day = "16",
language = "English",
isbn = "NCRG/2008/003",
publisher = "Aston University",
type = "WorkingPaper",
institution = "Aston University",

}

Genetics and competing strategies in a threshold model for mail processing. / Goldingay, Harry; van Mourik, Jort.

Birmingham : Aston University, 2008.

Research output: Working paperTechnical report

TY - UNPB

T1 - Genetics and competing strategies in a threshold model for mail processing

AU - Goldingay, Harry

AU - van Mourik, Jort

PY - 2008/5/16

Y1 - 2008/5/16

N2 - Multi-agent algorithms inspired by the division of labour in social insects are applied to a problem of distributed mail retrieval in which agents must visit mail producing cities and choose between mail types under certain constraints.The efficiency (i.e. the average amount of mail retrieved per time step), and the flexibility (i.e. the capability of the agents to react to changes in the environment) are investigated both in static and dynamic environments. New rules for mail selection and specialisation are introduced and are shown to exhibit improved efficiency and flexibility compared to existing ones. We employ a genetic algorithm which allows the various rules to evolve and compete. Apart from obtaining optimised parameters for the various rules for any environment, we also observe extinction and speciation. From a more theoretical point of view, in order to avoid finite size effects, most results are obtained for large population sizes. However, we do analyse the influence of population size on the performance. Furthermore, we critically analyse the causes of efficiency loss, derive the exact dynamics of the model in the large system limit under certain conditions, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.

AB - Multi-agent algorithms inspired by the division of labour in social insects are applied to a problem of distributed mail retrieval in which agents must visit mail producing cities and choose between mail types under certain constraints.The efficiency (i.e. the average amount of mail retrieved per time step), and the flexibility (i.e. the capability of the agents to react to changes in the environment) are investigated both in static and dynamic environments. New rules for mail selection and specialisation are introduced and are shown to exhibit improved efficiency and flexibility compared to existing ones. We employ a genetic algorithm which allows the various rules to evolve and compete. Apart from obtaining optimised parameters for the various rules for any environment, we also observe extinction and speciation. From a more theoretical point of view, in order to avoid finite size effects, most results are obtained for large population sizes. However, we do analyse the influence of population size on the performance. Furthermore, we critically analyse the causes of efficiency loss, derive the exact dynamics of the model in the large system limit under certain conditions, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.

KW - Distributed mail retrieval problem

KW - Rules for mail selection and specialization

KW - mail processing problem

M3 - Technical report

SN - NCRG/2008/003

BT - Genetics and competing strategies in a threshold model for mail processing

PB - Aston University

CY - Birmingham

ER -