Now showing items 1-3 of 3

    • Adaptive Large Neighborhood Search for Circle Bin Packing Problem 

      He, Kun; Tole, Kevin; Ni, Fei; Yuan, Yong; Liao, Linyun (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 

      He, Kun; Tole, Kevin; Ni, Fei; Yuan, Yong; Liao, Linyun (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, ...
    • Adaptive simulated annealing with greedy search for the circle bin packing problem 

      Yuan, Yong; Tole, Kevin; Ni, Fei; He, Kun; Xiong, Zhengda; Liu, Jinfa (Pergamon, 2022)
      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 ...