The effect of load on agent-based algorithms for distributed task allocation

Research output: Contribution to journalArticle

Abstract

Multi-agent algorithms inspired by the division of labour in social insects and by markets, are applied to a constrained problem of distributed task allocation. The efficiency (average number of tasks performed), the flexibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved efficiency and robustness. We employ nature inspired particle swarm optimisation to obtain optimised parameters for all algorithms in a range of representative environments. Although results are obtained for large population sizes to avoid finite size effects, the influence of population size on the performance is also analysed. From a theoretical point of view, we analyse the causes of efficiency loss, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.
Original languageEnglish
Pages (from-to)66–80
Number of pages15
JournalInformation Sciences
Volume222
Early online date11 Jun 2011
DOIs
Publication statusPublished - 10 Feb 2013

Fingerprint

Task Allocation
Population Size
Social Insects
Finite Size Effects
Hybrid Algorithm
Dynamic Environment
Particle swarm optimization (PSO)
Particle Swarm Optimization
Division
Flexibility
Personnel
Upper bound
Robustness
Task allocation
Agent-based
Experimental Results
Range of data

Bibliographical note

NOTICE: this is the author’s version of a work that was accepted for publication in Information sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Goldingay, H & Van Mourik, J. 'The effect of load on agent-based algorithms for distributed task allocation' Information sciences, vol 222 (2013) DOI 10.1016/j.ins.2011.06.011

Keywords

  • adaptive systems
  • algorithms
  • distributed decision-making
  • response thresholds

Cite this

@article{32471229d41642739ec82ca3f8670b65,
title = "The effect of load on agent-based algorithms for distributed task allocation",
abstract = "Multi-agent algorithms inspired by the division of labour in social insects and by markets, are applied to a constrained problem of distributed task allocation. The efficiency (average number of tasks performed), the flexibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved efficiency and robustness. We employ nature inspired particle swarm optimisation to obtain optimised parameters for all algorithms in a range of representative environments. Although results are obtained for large population sizes to avoid finite size effects, the influence of population size on the performance is also analysed. From a theoretical point of view, we analyse the causes of efficiency loss, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.",
keywords = "adaptive systems, algorithms, distributed decision-making, response thresholds",
author = "Harry Goldingay and {van Mourik}, Jort",
note = "NOTICE: this is the author’s version of a work that was accepted for publication in Information sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Goldingay, H & Van Mourik, J. 'The effect of load on agent-based algorithms for distributed task allocation' Information sciences, vol 222 (2013) DOI 10.1016/j.ins.2011.06.011",
year = "2013",
month = "2",
day = "10",
doi = "10.1016/j.ins.2011.06.011",
language = "English",
volume = "222",
pages = "66–80",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier",

}

The effect of load on agent-based algorithms for distributed task allocation. / Goldingay, Harry; van Mourik, Jort.

In: Information Sciences, Vol. 222, 10.02.2013, p. 66–80.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The effect of load on agent-based algorithms for distributed task allocation

AU - Goldingay, Harry

AU - van Mourik, Jort

N1 - NOTICE: this is the author’s version of a work that was accepted for publication in Information sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Goldingay, H & Van Mourik, J. 'The effect of load on agent-based algorithms for distributed task allocation' Information sciences, vol 222 (2013) DOI 10.1016/j.ins.2011.06.011

PY - 2013/2/10

Y1 - 2013/2/10

N2 - Multi-agent algorithms inspired by the division of labour in social insects and by markets, are applied to a constrained problem of distributed task allocation. The efficiency (average number of tasks performed), the flexibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved efficiency and robustness. We employ nature inspired particle swarm optimisation to obtain optimised parameters for all algorithms in a range of representative environments. Although results are obtained for large population sizes to avoid finite size effects, the influence of population size on the performance is also analysed. From a theoretical point of view, we analyse the causes of efficiency loss, 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 and by markets, are applied to a constrained problem of distributed task allocation. The efficiency (average number of tasks performed), the flexibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved efficiency and robustness. We employ nature inspired particle swarm optimisation to obtain optimised parameters for all algorithms in a range of representative environments. Although results are obtained for large population sizes to avoid finite size effects, the influence of population size on the performance is also analysed. From a theoretical point of view, we analyse the causes of efficiency loss, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.

KW - adaptive systems

KW - algorithms

KW - distributed decision-making

KW - response thresholds

UR - http://www.scopus.com/inward/record.url?scp=84870053496&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2011.06.011

DO - 10.1016/j.ins.2011.06.011

M3 - Article

VL - 222

SP - 66

EP - 80

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -