A flexible labour division approach to the polygon packing problem based on space allocation
Year of publication: |
1-15 June 2017
|
---|---|
Authors: | Wang, Yingcong ; Xiao, Renbin ; Wang, Huimin |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 55.2017, 11/12 (1/15.6.), p. 3025-3045
|
Subject: | nesting | packing problems | cutting stock problems | space allocation | ant colony's labour division | Packproblem | Packing problem | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm | Allokation | Allocation | Mathematische Optimierung | Mathematical programming |
-
An improved best-fit heuristic for the orthogonal strip packing problem
Verstichel, Jannes, (2013)
-
Henke, Thomas, (2022)
-
Recursive circle packing problems
Pedroso, João Pedro, (2016)
- More ...
-
Perturbation-based thresholding search for packing equal circles and spheres
Lai, Xiangjing, (2023)
-
Yang, Lianfen, (2009)
-
Optimal consensus models for group decision making under linguistic preference relations
Xu, Yejun, (2016)
- More ...