Solving packing problems by a distributed global optimization algorithm
From MaRDI portal
Publication:1955364
DOI10.1155/2012/931092zbMath1264.90147OpenAlexW2166152607WikidataQ58912703 ScholiaQ58912703MaRDI QIDQ1955364
Nian-Ze Hu, Han-Lin Li, Jung-Fa Tsai
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/931092
Applications of graph theory (05C90) Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Uses Software
Cites Work
- An algorithm for the two-dimensional assortment problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A particular approach for the three-dimensional packing problem with additional constraints
- Three-dimensional packings with rotations
- Three-dimensional bin packing problem with variable bin height
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An analytical model for the container loading problem
- An approximately global optimization method for assortment problems
- An efficient approach for the multi-pallet loading problem
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- A global search framework for practical three-dimensional packing with variable carton orientations
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- An improved typology of cutting and packing problems
- An efficient deterministic optimization approach for rectangular packing problems
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A three-dimensional pallet loading method for single-size boxes
- A distributed global optimization method for packing problems
