Research Article
A Hybrid Demon Algorithm for the Two-Dimensional Orthogonal Strip Packing Problem
LS() | (1) sort all unpacked pieces by non-increasing ordering of length size to obtain X; | (2) ← HeuristicPacking(X); | (3) for to do | (4) for to do | (5) swap the order of pieces and in and obtain a new ordering ; | (6) ← HeuristicPacking(); | (7) if then | (8) ; | (9) ; |
|