The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Ant colony optimization and local search for bin packing and cutting stock problems
Abstract
The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO.
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Cited by
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
Energy-Aware Ant Colony Based Workload Placement in Clouds
Feller, E., Rilling, L., & Morin, C. (2011) · 2011 IEEE/ACM 12th International Conference on Grid Computing · doi:10.1109/grid.2011.13 · Cited by 322
Metadata
- Authors
- Levine, J., & Ducatelle, F.
- Venue
- Journal of the Operational Research Society
- Publisher
- Informa UK Limited
- Published
- 2004-07
- Volume
- 55
- Issue
- 7
- Pages
- 705-716
- ISSN
- 0160-5682 (ISSN-L)
- 1476-9360
- OpenAlex
- W2109469182
- Cited by
- 211
- References
- 1
- FWCI
- 33.52
- 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: Ant colony optimization and local search for bin packing and cutting stock problems. https://app.cochat.ai/papers/10.1057/palgrave.jors.2601771
- The paper
- Levine, J., & Ducatelle, F. (2004). Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research Society. https://doi.org/10.1057/palgrave.jors.2601771
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.