The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
DOI: 10.1109/cec.2003.1299839
|View full text |Cite
|
Sign up to set email alerts
|

Do ants paint trucks better than chickens? Markets versus response thresholds for distributed dynamic scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(17 citation statements)
references
References 10 publications
0
17
0
Order By: Relevance
“…The problem we investigate involves a single task, and the team of agents solving this problem must self-organize such that an appropriate number of them are working and not working on the task at any given time. Both the biological [3], [4], [5] and multi-agent [6], [7], [8], [9], [10] literatures provide examples of systems where behavioral differences among the individuals of a team help the team as a whole reach its objective. We hypothesize that inter-agent variation is not only beneficial but also essential to a distributed team's ability to self-organize.…”
Section: Introductionmentioning
confidence: 99%
“…The problem we investigate involves a single task, and the team of agents solving this problem must self-organize such that an appropriate number of them are working and not working on the task at any given time. Both the biological [3], [4], [5] and multi-agent [6], [7], [8], [9], [10] literatures provide examples of systems where behavioral differences among the individuals of a team help the team as a whole reach its objective. We hypothesize that inter-agent variation is not only beneficial but also essential to a distributed team's ability to self-organize.…”
Section: Introductionmentioning
confidence: 99%
“…Every algorithm was optimised for each setting it was tested in (high and low load, static and dynamic environments). Note that PSO provided no improvement for the MB algorithm over the standard settings, due to its relative insensitivity to parameter choice [19]. Table 1 illustrates the efficiency of the various algorithms for t c = 2.…”
Section: Performancementioning
confidence: 99%
“…In order to do so, we apply existing threshold-and market-based algorithms to a problem of distributed task allocation based on a mail retrieval problem in which agents travel to distinct locations (cities) at which they must choose between various tasks (types of mail to process). It has been used in various comparative studies of algorithms for distributed task allocation, presented either as a mail processing [25,26,12,13], or truck painting problem [4,19]. It is a flexible problem which allows for a comprehensive investigation of the behaviour of candidate algorithms.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The stimulus (S) represents the number of time steps an EC is in the WfMS, in this study we use S=1 [14]. The parameter tuning for the learning mechanism can be based on a genetic algorithm [25], a simple hand tuning technique [26], or a sensitivity analysis that first sets the most important parameter followed by the parameter with the second highest impact, and so on [27]. Based on the latter approach, we derived the threshold values as well as the learning importance α and the task duration component β.…”
Section: Simulation Approachmentioning
confidence: 99%