The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A genetic algorithm for bin packing and line balancing
Abstract
The authors present an efficient genetic algorithm for two NP-hard problems, the bin packing and the line balancing problems. They define the two problems precisely and specify a cost function suitable for the bin packing problem. It is shown that the classic genetic algorithm performs poorly on grouping problems and an encoding of solutions of fitting these problems is presented. Efficient crossover and mutation operators are introduced for bin packing. The modification necessary to fit these operators for line balancing is given. Results of performance tests on randomly generated data are included. The line balancing tests cover real-world problem sizes. The results and areas of further research are discussed.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
(1979) · Cited by 43,841
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
A Structure for Plans and Behavior
Sacerdoti, E. D. (1977) · Defense Technical Information Center (DTIC) · Cited by 1,160
Simple Genetic Algorithms and the Minimal, Deceptive Problem
Goldberg, D. E. (1987) · Medical Entomology and Zoology · Cited by 297
Induction: Processes of inference, learning and discovery
Margolis, H. (1988) · Journal of Economic Behavior & Organization · doi:10.1016/0167-2681(88)90041-8 · Cited by 132
Cited by
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Bin packing and cutting stock problems: Mathematical models and exact algorithms
Delorme, M., Iori, M., & Martello, S. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.04.030 · Cited by 379
Evolving Bin Packing Heuristics with Genetic Programming
Burke, E. K., Hyde, M. R., & Kendall, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11844297_87 · Cited by 144
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277273 · Cited by 121
Metadata
- Authors
- Falkenauer, E., & Delchambre, A.
- Venue
- Proceedings 1992 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-02
- Pages
- 1186-1192
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1878040096
- Cited by
- 279
- References
- 7
- FWCI
- 20.53
- Type
- conference paper
- Language
- en
- Open access
- closed
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: A genetic algorithm for bin packing and line balancing. https://app.cochat.ai/papers/10.1109/robot.1992.220088
- The paper
- Falkenauer, E., & Delchambre, A. (2003). A genetic algorithm for bin packing and line balancing. Proceedings 1992 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/robot.1992.220088
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.