Adaptive Simulated Annealing with Greedy Search for the Circle Bin Packing Problem
Yong Yuan, Kevin Tole, Fei Ni, Kun He, Zhengda Xiong, Jinfa Liu

TL;DR
This paper introduces a new circle bin packing problem with circular items, proposing an adaptive simulated annealing algorithm with greedy search that significantly improves packing efficiency and solution quality over existing methods.
Contribution
The paper presents a novel problem formulation, a greedy constructive algorithm, and an adaptive simulated annealing approach with new local perturbation strategies for efficient packing.
Findings
ASA-GS outperforms the greedy algorithm in all tested instances.
Packing density in top bins is significantly higher with ASA-GS.
The algorithm is size-agnostic and scales well with problem size.
Abstract
We introduce a new bin packing problem, termed the circle bin packing problem with circular items (CBPP-CI). The problem involves packing all the circular items into multiple identical circle bins as compact as possible with the objective of minimizing the number of used bins. We first define the tangent occupying action (TOA) and propose a constructive greedy algorithm that sequentially packs the items into places tangent to the packed items or the bin boundaries. Moreover, to avoid falling into a local minimum trap and efficiently judge whether an optimal solution has been established, we continue to present the adaptive simulated annealing with greedy search (ASA-GS) algorithm that explores and exploits the search space efficiently. Specifically, we offer two novel local perturbation strategies to jump out of the local optimum and incorporate the greedy search to achieve faster…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Advanced Manufacturing and Logistics Optimization · Robotic Path Planning Algorithms
