A beam search approach to solve the convex irregular bin packing problem with guillotine cuts
Year of publication: |
1 October 2018
|
---|---|
Authors: | Bennell, J.A. ; Cabo, M. ; MartÃnez-Sykora, Antonio |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 270.2018, 1 (1.10.), p. 89-102
|
Subject: | Cutting | Packing | Heuristics | Beam search | Guillotine cuts | Theorie | Theory | Heuristik | Packproblem | Packing problem | Mathematische Optimierung | Mathematical programming |
-
A general heuristic for two-dimensional nesting problems with limited-size containers
Mundin, Leandro R., (2018)
-
A hybrid evolutionary algorithm for the two-dimensional packing problem
Kierkosz, Igor, (2014)
-
Irregular packing problems : a review of mathematical models
Leao, Aline A. S., (2020)
- More ...
-
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
Song, X., (2006)
-
Incorporating uncertainty in competitive bidding
Chapman, C.B., (2000)
-
Jostling for position: Local improvement for irregular cutting patterns
Dowsland, K.A., (1998)
- More ...