Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 279

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

Falkenauer, E., Delchambre, A.·2003·Proceedings 1992 IEEE International Conference on Robotics and Automation

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/robot.1992.220088

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 7 references

Cited by

See all 279

Metadata

Authors
Falkenauer, E., & Delchambre, A.
Venue
Proceedings 1992 IEEE International Conference on Robotics and Automation
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.