CoChat

The scalability of evolved on line bin packing heuristics

Burke, E. K., Hyde, M. R., Kendall, G., Woodward, J. R. · 2007 · 2007 IEEE Congress on Evolutionary Computation

The DOI matches its Crossref record; 31 of the 32 references it cites were found in a registry or an index.

Abstract

The scalability of an evolved multi-agent system is an important characteristic of the system. The multi-agent system is normally evolved in a particular configuration of system parameters. However, an optimized solution using one set of system parameters does not necessarily means a good solution using a different set of system parameters. The research presented in this paper studies the performance scalability of evolved solutions in reactive multi-agent systems for the heap formation task. The scalability variable considered in the research was the cardinality of the agents group, whereas keeping the rest of the system and collective resources invariable. In the first phase of the experiments, best solutions for different system configurations were found using genetic algorithm. In the second phase, the evolved solutions were cross-tested in all system configurations. The research showed that evolved solutions performed well if the agents/objects ratio of the multi-agent system used in testing was similar to the agents/objects ratio of the multi-agent system used in evolution. Additionally, evolved solutions scaled well only on limited intervals that did not span over the critical point, which corresponded to the condition where the number of agents is equal to the number of objects. Typically, solutions that performed well on one side of the critical point performed badly on the other side, suggesting the solutions performances were significantly dependant on agents/objects ratio.

Overview

Integrity signals

Registry

Crossref · 10.1109/cec.2007.4424789

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 31 references

Research works printed but not linked: 1

  1. cowling, 2000, a hyperheuristic approach to scheduling a sales summit. in burke. e.k, Lecture Notes in Computer Science, 2079

Cited by

See all 66

Metadata

Authors
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R.
Affiliations
University of Nottingham (GB)
Venue
2007 IEEE Congress on Evolutionary Computation
Publisher
IEEE
Published
2007-09
Pages
2530-2537
OpenAlex
W2171341281
Cited by
55
References
32
Citations by year
2026: 2 · 2024: 1 · 2023: 3 · 2022: 1 · 2021: 3 · 2020: 3 · 2019: 1 · 2018: 3 · 2017: 4 · 2016: 1 · 2015: 2 · 2014: 5 · 2013: 5 · 2012: 6
FWCI
2.17
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Congress on Evolutionary Computation (CEC) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Engineering › Mechanical Engineering › Modular Robots and Swarm Intelligence
Keywords
scalability, online bin packing, genetic algorithm

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The scalability of evolved on line bin packing heuristics. https://app.cochat.ai/papers/10.1109/cec.2007.4424789
The paper
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R. (2007). The scalability of evolved on line bin packing heuristics. 2007 IEEE Congress on Evolutionary Computation. https://doi.org/10.1109/cec.2007.4424789

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.