The scalability of evolved on line bin packing heuristics
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“In addition, these evolved heuristics can sometimes generalize to larger instances than the ones they were trained on85, similar to the learned FunSearch heuristics.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [85]
Citations
Cites
(1979) · Cited by 43,841
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974) · SIAM Journal on Computing · doi:10.1137/0203025 · Cited by 911 · cited 2×
“Puts the piece in the right-most bin and opens a new bin if there is not enough room for it. First Fit [ 19 ].”
Background(2005) · doi:10.1007/0-387-28356-0 · Cited by 853
Self-citationHyper-Heuristics: An Emerging Direction in Modern Search Technology
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_16 · Cited by 665 · cited 2×
“Recentyearshave seenthe emergenceof a more general typeof searchalgorithm,hyper-heuristics[1], [2], wherethe searchspaceis a spaceof heuristics,rather than the space of solutionsthemselves.”
BackgroundSelf-citationGenetic Programming II: Automatic Discovery of Reusable Programs.
O'Reilly, U.-M. (1994) · Artificial Life · doi:10.1162/artl.1994.1.4.439 · Cited by 546 · cited 1×
“A number of problems of different size have been studied in the GP literature, for example the even parity problem and the lawn mower problem [20], [21].”
BackgroundA Tabu-Search Hyperheuristic for Timetabling and Rostering
Burke, E. K., Kendall, G., & Soubeiga, E. (2003) · Journal of Heuristics · doi:10.1023/b:heur.0000012446.94732.b6 · Cited by 509 · cited 1×
“In [13], a tabu search hyper-heuristic is presented and evaluated upon a nurse scheduling problem and a university course timetabling problem.”
MethodSelf-citationA graph-based hyper-heuristic for educational timetabling problems
Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.08.012 · Cited by 507 · cited 1×
“A graph based hyper-heuristic is presented in [ 12 ].”
MethodSelf-citationPrinciples in the Evolutionary Design of Digital Circuits—Part II
Miller, J. F., Job, D., & Vassilev, V. K. (2000) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1010066330916 · Cited by 381 · cited 1×
“Miller et. al. [ 23 ] evolve digital designs of arithmetic functions (addition and multiplication) and argue that ‘by studying the evolved design of gradually increasing scale, one might be able to discern new, efficient, and general principles of design’.”
Background
Research works printed but not linked: 1
- cowling, 2000, a hyperheuristic approach to scheduling a sales summit. in burke. e.k, Lecture Notes in Computer Science, 2079
Cited by
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Self-citationA Classification of Hyper-heuristic Approaches
Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_15 · Cited by 563
“An alternative idea is to use genetic programming to evolve a program representing a function, which is part of the processing of a given problem specific construction heuristic [9, 8, 11, 22, 31, 59].”
BackgroundMethodInfluentialSelf-citationMathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
“In addition, these evolved heuristics can sometimes generalize to larger instances than the ones they were trained on 85 , similar to the learned FunSearch heuristics.”
MethodExploring Hyper-heuristic Methodologies with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Ozcan, E., & Woodward, J. R. (2009) · Intelligent Systems Reference Library · doi:10.1007/978-3-642-01799-5_6 · Cited by 304
“In a series of papers, Burke et al. [10, 11, 12 ] examine the viability of using”
BackgroundInfluentialSelf-citationNguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2227326 · Cited by 221
“[29], [30] proposed a GP-HH framework to evolve construction heuristics for online bin packing.”
Background
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
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.