Three-Dimensional Packing Algorithm of Single Container Based on Genetic Algorithm
Author:
Jia Shuting,Wang Li
Publisher
Springer Singapore
Reference14 articles.
1. Zhang, G., Yao, E.: The FFD algorithm for the bin packing problem with kernel items. Appl. Math.- J. Chin. Univ. Ser. B 13(3), 335–340 (1998) 2. Alvim, A., Ribeiro, C., Glover, F., Aloise, D.: A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10(2), 205–229 (2004) 3. Loh, K., Golden, B., Wasil, E.: Solving the one-dimensional bin packing problem with a weight annealing heuristic. Comput. Oper. Res. 35(7), 2283–2291 (2006) 4. Claudio, A., Fabrizio, M.: Maximum lateness minimization in one-dimensional bin packing. Omega-Int. J. Manag. Sci. 68, 76–84 (2017) 5. Alvelos, F., Chan, T., Vilaca, P., Gomes, T., Silva, E., De Carvalho, J.: Sequence based heuristics for two-dimensional bin packing problems. Eng. Optim. 41(8), 773–791 (2009)
|
|