Packaging optimization using the dynamic vector fields method

DOI10.1002/NME.6161MaRDI QIDQ6554510zbMATH OpenFDO

Authors Christopher Carrick, I. Y. Kim

Publication date 12 June 2024

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NME.6161

zbMATH Keywords

layout optimizationpackaging optimizationpacking densitypacking optimizationvector fields

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Optimal packing using the multiple mating method
• Multistage approach to solving the optimization problem of packing nonconvex polyhedra
• Packing optimization of free-form objects in engineering design
• A global optimization point of view to handle non-standard object packing problems
• scientific article; zbMATH DE number 2083807

Cites work

• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
• Facility layout optimization using simulation and genetic algorithms
• scientific article; zbMATH DE number 4133847 (Why is no real title available?)
• scientific article; zbMATH DE number 108350 (Why is no real title available?)
• On genetic algorithms for the packing of polygons
• Packing equal circles in a square: A deterministic global optimization approach
• Recent advances on two-dimensional bin packing problems
• Solution approaches to irregular nesting problems
• Some experiments with simulated annealing techniques for packing problems
• The geometry of nesting problems: a tutorial
• Two-Dimensional Finite Bin-Packing Algorithms

This page was built for publication: Packaging optimization using the dynamic vector fields method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554510)