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

Abstract

First paper to introduce the circle bin packing problem with circular items (CBPP-CI).• Define a tangent occupying action and propose a greedy constructive algorithm for CBPP-CI.• Design two new operations, circle perturbation and sector perturbation, to generate neighbor solutions.• Propose an adaptive simulated annealing algorithm with greedy search that obtains competitive results.• Build two sets with a total of 52 new benchmark instances with 20 to 100 circular items.