The two-dimensional packing problem (2PP) is one of the main problems encountered in many industries. Proper nested pattern layout can minimize the trim loss and maximize the utilization of the material available. This paper presents a hybrid ant colony algorithm coupled with a simple local search algorithm to solve the two-dimensional bin packing (2BP) and strip packing (2SP) problems with additional constraint, where the items to be packed by levels. The performance of the proposed algorithm is tested over a number of standard benchmark instances from the literature. Computational results indicate that the proposed algorithm is effective for solving these problems.
An Ant Colony Optimization Heuristic for Solving the Two-Dimensional Level Packing Problems
7 Views
7 Downloads