DeepAI AI Chat
Log In Sign Up

Adaptive Simulated Annealing with Greedy Search for the Circle Bin Packing Problem

by   Yong Yuan, et al.

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 convergence. The parameters of ASA-GS are adaptive according to the number of items so that they can be size-agnostic across the problem scale. We design two sets of new benchmark instances, and the empirical results show that ASA-GS completely outperforms the constructive greedy algorithm. Moreover, the packing density of ASA-GS on the top few dense bins is much higher than that of the state-of-the-art algorithm for the single circle packing problem, inferring the high quality of the packing solutions for CBPP-CI.


page 7

page 10

page 11


Adaptive Large Neighborhood Search for Circle Bin Packing Problem

We address a new variant of packing problem called the circle bin packin...

Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale

The problem of packing equal circles in a circle is a classic and famous...

Several methods of analysis for cardinality constrained bin packing

We consider a known variant of bin packing called cardinality constraine...

Stable bin packing of non-convex 3D objects with a robot manipulator

Recent progress in the field of robotic manipulation has generated inter...

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

In the Bin Packing problem one is given n items with weights w_1,…,w_n a...

Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories

Bin Packing with Conflicts (BPC) are problems in which items with compat...

A Constructive Heuristic Algorithm for 3D Bin Packing of Irregular Shaped Items

The three-dimensional bin packing problem (3D-BPP) plays an important ro...