An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations.
Hao ZhangQiang LiuLijun WeiJiawei ZengJiewu LengDuxi YanPublished in: Comput. Oper. Res. (2022)
Keyphrases
- packing problem
- three dimensional
- search algorithm
- multi dimensional
- irregularly shaped
- lower bound
- genetic algorithm
- arbitrarily shaped
- bin packing
- variable sized
- combinatorial optimization
- global search
- job shop scheduling problem
- search space
- neighborhood search
- irregular isothetic grids
- tabu search
- simulated annealing
- multiresolution
- optimal solution
- case study