Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Convergence analysis of canonical genetic algorithms
Rudolph, G. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265964 · Cited by 1,484
Evolutionary Algorithms in Engineering Applications
(1997) · Springer eBooks · doi:10.1007/978-3-662-03423-1 · Cited by 705
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
Hopper, E. M., & Turton, B. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00357-4 · Cited by 516
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
Beasley, J. E. (1985) · Operations Research · doi:10.1287/opre.33.1.49 · Cited by 497
Cited by
Paek, S. W., Kim, S., & de Weck, O. (2019) · Sensors · doi:10.3390/s19040765 · Cited by 75
Metadata
- Authors
- Leung, T. W., Chan, C. K., & Troutt, M. D.
- Affiliations
- Government Laboratory (HK)
- Hong Kong Polytechnic University (HK)
- Kent State University (US)
- Corresponding author
- Troutt, Marvin D
- ORCID
- Chan, Chi Kin
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2003-03
- Volume
- 145
- Issue
- 3
- Pages
- 530-542
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2072231122
- Cited by
- 109
- References
- 27
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 2 · 2023: 3 · 2022: 3 · 2021: 6 · 2020: 5 · 2019: 5 · 2018: 1 · 2017: 4 · 2016: 2 · 2015: 6 · 2014: 4 · 2013: 6 · 2012: 5
- FWCI
- 15.96
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- European Journal of Operational Research (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- PolyU Institutional Research Archive (Hong Kong Polytechnic University) (submittedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Optimization and Packing Problems
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Keywords
- simulated annealing, genetic algorithm, hybrid metaheuristic, premature convergence, packing heuristics, metaheuristic comparison
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: Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. https://app.cochat.ai/papers/10.1016/s0377-2217(02)00218-7
- The paper
- Leung, T. W., Chan, C. K., & Troutt, M. D. (2003). Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research. https://doi.org/10.1016/s0377-2217(02)00218-7
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.