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
(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
Self-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
A 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
Self-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
Self-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
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
Self-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
Self-citationNguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2227326 · Cited by 221
A Classification of Hyper-Heuristic Approaches: Revisited
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_14 · Cited by 168
Self-citationA Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics
Burke, E. K., Hyde, M., Kendall, G., & Woodward, J. R. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2041061 · Cited by 155
Self-citationAutomating the Packing Heuristic Design Process with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00044 · Cited by 118
Self-citationGrammatical Evolution of Local Search Heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2160401 · Cited by 103
Self-citationA review on learning to solve combinatorial optimisation problems in manufacturing
Zhang, C., Wu, Y., Ma, Y., Song, W. W., Zhang, L., Cao, Z., & Zhang, J. (2023) · IET Collaborative Intelligent Manufacturing · doi:10.1049/cim2.12072 · Cited by 96
A Lifelong Learning Hyper-heuristic Method for Bin Packing
Sim, K., Hart, E., & Paechter, B. (2014) · Evolutionary Computation · doi:10.1162/evco_a_00121 · Cited by 92
Optimal discharge scheduling of energy storage systems in MicroGrids based on hyper-heuristics
Mallol-Poyato, R., Salcedo‐Sanz, S., Jiménez-Fernández, S., & Díaz-Villar, P. (2015) · Renewable Energy · doi:10.1016/j.renene.2015.04.009 · Cited by 61
Vázquez-Rodríguez, J. A., & Ochoa, G. (2011) · Journal of the Operational Research Society · doi:10.1057/jors.2010.132 · Cited by 47
Hong, L., Drake, J. H., Woodward, J. R., & Özcan, E. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.10.002 · Cited by 45
Self-citationAutomatically designing selection heuristics
Woodward, J. R., & Swan, J. (2011) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/2001858.2002052 · Cited by 43
Self-citationGenetic Programming for Evolving Due-Date Assignment Models in Job Shop Environments
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013) · Evolutionary Computation · doi:10.1162/evco_a_00105 · Cited by 42
Hyper-heuristic decision tree induction
Vella, A., Corne, D., & Murphy, C. (2009) · World Congress on Nature and Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393568 · Cited by 41
Adaptive iterated local search for cross-domain optimisation
Burke, E. K., Gendreau, M., Ochoa, G., & Walker, J. D. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001843 · Cited by 40
Self-citationCost-Benefit Investigation of a Genetic-Programming Hyperheuristic
Keller, R. E., & Poli, R. (2008) · Springer eBooks · doi:10.1007/978-3-540-79305-2_2 · Cited by 39
Evolving reusable 3d packing heuristics with genetic programming
Allen, S. D., Burke, E. K., Hyde, M., & Kendall, G. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570029 · Cited by 39
Self-citationA genetic programming based hyper-heuristic approach for combinatorial optimisation
Nguyen, S., Zhang, M., & Johnston, M. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001752 · Cited by 38
CHAMP: Creating heuristics via many parameters for online bin packing
Asta, S., Özcan, E., & Parkes, A. J. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.07.005 · Cited by 36
Policy matrix evolution for generation of heuristics
Özcan, E., & Parkes, A. J. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001846 · Cited by 33
Benchmarking for Metaheuristic Black-Box Optimization: Perspectives and Open Challenges
Sala, R., & Müller, R. (2020) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec48606.2020.9185724 · Cited by 28
Generalizing Hyper-heuristics via Apprenticeship Learning
Asta, S., Özcan, E., Parkes, A. J., & Uyar, A. Ş. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37198-1_15 · Cited by 27
Metaheuristic Design Pattern: Surrogate Fitness Functions
Brownlee, A. E. I., Woodward, J. R., & Swan, J. (2015) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/2739482.2768499 · Cited by 26
Self-citationA New Hyperheuristic Algorithm for Cross-Domain Search Problems
Lehrbaum, A., & Musliu, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34413-8_41 · Cited by 24
Pillay, N. (2012) · South African Computer Journal · doi:10.18489/sacj.v48i1.87 · Cited by 21
An evolutionary-based hyper-heuristic approach for the Jawbreaker puzzle
Salcedo‐Sanz, S., Matías‐Román, J. M., Jiménez-Fernández, S., Portilla-Figueras, A., & Cuadra, L. (2013) · Applied Intelligence · doi:10.1007/s10489-013-0470-4 · Cited by 20
Heuristic generation via parameter tuning for online bin packing
Yarimcam, A., Asta, S., Özcan, E., & Parkes, A. J. (2014) · IEEE Symposium on Evolving and Autonomous Learning Systems (EALS) · doi:10.1109/eals.2014.7009510 · Cited by 19
A Hyper-Heuristic for the Orienteering Problem With Hotel Selection
Toledo, A., Riff, M.-C., & Neveu, B. (2019) · IEEE Access · doi:10.1109/access.2019.2960492 · Cited by 17
Providing a memory mechanism to enhance the evolutionary design of heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2010) · IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2010.5586388 · Cited by 15
Self-citationMetaheuristic Design Patterns: New Perspectives for Larger-Scale Search Architectures
Krawiec, K., Simons, C. L., Swan, J., & Woodward, J. R. (2017) · Advances in business information systems and analytics book series · doi:10.4018/978-1-5225-2990-3.ch001 · Cited by 15
Self-citationYates, W. B., & Keedwell, E. C. (2020) · Evolutionary Computation · doi:10.1162/evco_a_00277 · Cited by 15
Krasnogor, N. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_29 · Cited by 15
Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming
Nguyen, S. (2013) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.17005813 · Cited by 14
Benchmarking for Metaheuristic Black-Box Optimization: Perspectives and Open Challenges
Sala, R., & Müller, R. (2020) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec48606.2020.9185593 · Cited by 12
Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem
Ren, Z., Jiang, H., Xuan, J., & Luo, Z. (2010) · Springer eBooks · doi:10.1007/978-3-642-15844-5_55 · Cited by 11
Matrix Analysis of Genetic Programming Mutation
Parkes, A. J., Özcan, E., & Hyde, M. R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29139-5_14 · Cited by 10
Self-citationScaling Up Solutions to Storage Location Assignment Problems by Genetic Programming
Xie, J., Mei, Y., Ernst, A. T., Li, X., & Song, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13563-2_58 · Cited by 8
Drake, J. H., Swan, J., Neumann, G., & Özcan, E. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-55453-2_13 · Cited by 8
Automated code generation by local search
Hyde, M. R., Burke, E. K., & Kendall, G. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2012.149 · Cited by 7
Self-citationEvolving construction heuristics for the curriculum based university course timetabling problem
Pillay, N. (2016) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7744354 · Cited by 7
An investigation of multi-objective hyper-heuristics for multi-objective optimisation
Maashi, M. S. (2014) · Nottingham ePrints (University of Nottingham) · Cited by 7
Genetic Programming Hyper-heuristics for Job Shop Scheduling
Hunt, R. (2016) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.17018759 · Cited by 6
Design of vehicle routing problem domains for a hyper-heuristic framework
Walker, J. D. (2015) · Nottingham ePrints (University of Nottingham) · Cited by 5
Genetic Hyper-Heuristics for Graph Layout Problems
Koohestani, B. (2013) · Cited by 2
Evolving human-competitive reusable 2D strip packing heuristics
Hyde, M., Burke, E. K., & Kendall, G. (2009) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/1570256.1570299 · Cited by 2
Self-citationA Neural Approach to Generation of Constructive Heuristics
Alissa, M., Sim, K., & Hart, E. (2021) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec45853.2021.9504989 · Cited by 2
Brownlee, A. E. I., Woodward, J. R., & Veerapen, N. (2018) · Stirling Online Research Repository (University of Stirling) · Cited by 2
Self-citationNovel Hyper-heuristics Applied to the Domain of Bin Packing
Sim, K. (2014) · Edinburgh Napier Research Repository (Edinburgh Napier University) · doi:10.17869/enu.175745 · Cited by 2
A modified choice function hyper-heuristic with Boltzmann function
Mellouli, O., Hafidi, I., & Metrane, A. (2021) · Mathematical Modeling and Computing · doi:10.23939/mmc2021.04.736 · Cited by 1
Tauritz, D. R., & Woodward, J. R. (2017) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3067695.3067710 · Cited by 1
Self-citationLearning the Quality of Dispatch Heuristics Generated by Automated Programming
Parkes, A. J., Beglou, N., & Özcan, E. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-05348-2_13 · Cited by 1
Tauritz, D. R., & Woodward, J. R. (2020) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3377929.3389855 · Cited by 1
Self-citationTauritz, D. R., & Woodward, J. R. (2018) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3205651.3207868 · Cited by 1
Self-citationTauritz, D. R., & Woodward, J. R. (2016) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/2908961.2926978 · Cited by 1
Self-citationWoodward, J. R., & Tauritz, D. R. (2015) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/2739482.2756579
Self-citationCHaMP: Creating Heuristics via Many Parameters
Asta, S., & Parkes, A. J. (2014)
Hyper-heuristics for grouping problems
Elhag, A. (2015) · Nottingham ePrints (University of Nottingham)
Tauritz, D. R., & Woodward, J. R. (2021) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3449726.3461418
Self-citationTauritz, D. R., & Woodward, J. R. (2019) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3319619.3323382
Self-citationTauritz, D. R., & Woodward, J. R. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3533646
Self-citationTauritz, D. R., & Woodward, J. R. (2023) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3583133.3595033
Self-citationTauritz, D. R., & Woodward, J. R. (2024) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3638530.3648417
Self-citationOnline multi-appointment scheduling for outpatient examinations with genetic programming
Zhang, H., Wang, Y., Hao, J., Zeng, L., & Luo, L. (2026) · Computers & Operations Research · doi:10.1016/j.cor.2026.107548
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.