Search
Now showing items 1-3 of 3
Particle Swarm Algorithm for Improved Handling of the Mirrored Traveling Tournament Problem
(2021-08)
In this study, we used a particle swarm optimization (PSO) algorithm to address a variation of the non-deterministic polynomial-time NP-hard traveling tournament
problem, which determines the optimal schedule for a double ...
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, ...
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, ...