Beam search for sequencing point operations in flat plate manufacturing
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
The harpy speech recognition system.
The harpy speech recognition system.
Optimization in computer-aided pattern packing (marking, envelopes)
Optimization in computer-aided pattern packing (marking, envelopes)
Computers and Operations Research
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
Computers and Operations Research
A review of the application of swarm intelligence algorithms to 2D cutting and packing problem
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Algorithms for nesting with defects
Discrete Applied Mathematics
Hi-index | 0.00 |
This paper investigates the irregular shape packing problem. We represent the problem as an ordered list of pieces to be packed where the order is decoded by a placement heuristic. A placement heuristic from the literature is presented and modified with a more powerful nofit polygon generator and new evaluation criteria. We implement a beam search algorithm to search over the packing order. Using this approach many parallel partial solutions can be generated and compared. Computational results for benchmark problems show that the algorithm generates highly competitive solutions in significantly less time than the best results currently in the literature.