Metraipolis › archive › dc_14f3f45169bb

GeoNest: Learning to Select Failure-Aware Neighborhoods for the Irregular Knapsack Problem in a Circular Container — arXiv:2609.38863

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38863
License (as archived)
CC0-1.0
Archived
2026-10-07T12:44:27.049Z
SHA-256 of the archived text
77c265fa5ca0a0073c5af75539640c5ca93c3c76cf4632d943e1e1f59dce6e1e
Stable URL of this page
https://metraipolis.com/documento/dc_14f3f45169bb

How to cite

GeoNest: Learning to Select Failure-Aware Neighborhoods for the Irregular Knapsack Problem in a Circular Container — arXiv:2609.38863 — arXiv (en), https://arxiv.org/abs/2609.38863 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_14f3f45169bb (Metraipolis archive dc_14f3f45169bb, sha256 77c265fa5ca0a0073c5af75539640c5ca93c3c76cf4632d943e1e1f59dce6e1e)
BibTeX
@misc{dc14f3f45169bb,
  title = {GeoNest: Learning to Select Failure-Aware Neighborhoods for the Irregular Knapsack Problem in a Circular Container — arXiv:2609.38863},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38863},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_14f3f45169bb; sha256 77c265fa5ca0a0073c5af75539640c5ca93c3c76cf4632d943e1e1f59dce6e1e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38863. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The two-dimensional irregular knapsack problem in a fixed circular container is an important combinatorial optimization problem for maximizing material utilization in manufacturing. Conventional geometric packing solvers can produce tightly packed layouts, yet they often partition the residual space into isolated small pockets that cannot fit valuable unplaced polygons. To overcome this late-stage packing bottleneck, we propose a failure-aware large neighborhood search framework named GeoNest, driven by a graph policy trained via reinforcement learning. Specifically, we first construct neighborhoods by pairing failed target polygons with residual pockets. We then use explanatory poses to identify the placed polygons that block candidate insertions. These diagnosed blocking relations define bounded, fixed-item repair subproblems for the underlying geometric solver. Finally, the graph policy selects the most promising subproblem for execution. For evaluation, we introduce CircleNest-Bench, a benchmark comprising 2,391 load-controlled instances from four contour sources, including a held-out industrial CAD source. Experimental results demonstrate that, under the same total time budget, GeoNest improves mean utilization over a state-of-the-art standalone packing solver by about 0.9% on average across the three main test sets and by about 0.6% on the held-out industrial set.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.38863 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T12:14:13.962Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).