Browsing Institute of Computing and Informatics (ICI) by Subject "adaptive large neighborhood search"
Now showing items 1-2 of 2
-
Adaptive Large Neighborhood Search for Circle Bin Packing Problem
(2020)We address a new variant of packing problem called the circle bin packing problem (CBPP), which is to find a dense packing of circle items to multiple square bins so as to minimize the number of used bins. To this end, ... -
Adaptive large neighborhood search for solving the circle bin packing problem
(Pergamon, 2021)We address a new variant of packing problem called the circle bin packing problem (CBPP), which is to find a dense packing of circle items to multiple square bins so as to minimize the number of used bins. To this end, ...