The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods
Abstract
A problem of relevant interest to some industrial processes is the one of allocating a specified number of two-dimensional regular or irregular generally different pieces on a stock of sheets of finite dimensions, the object being to minimize the amount of waste produced. The problem is present in industrial applications like shipbuilding, clothing manufacturing, or leather cutting. An approach is given where the solution is achieved with a heuristic search method typical of the artificial intelligence discipline. In this paper it is shown by the experimental results that this framework not only allows a simple formulation of the solution but represents an effective technique to obtain solutions competitive with the ones produced by hand.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Cited by
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
Approximation Algorithms for Bin-Packing — An Updated Survey
Coffman, E. G., Garey, M. R., & Johnson, D. S. (1984) · CISM International Centre for Mechanical Sciences · doi:10.1007/978-3-7091-4338-4_3 · Cited by 433
Metadata
- Authors
- Albano, A., & Sapuppo, G.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1980
- Volume
- 10
- Issue
- 5
- Pages
- 242-248
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2054327146
- Cited by
- 217
- References
- 1
- FWCI
- 12.91
- Type
- journal article
- 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: Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods. https://app.cochat.ai/papers/10.1109/tsmc.1980.4308483
- The paper
- Albano, A., & Sapuppo, G. (1980). Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/tsmc.1980.4308483
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.