A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm

DOI10.1080/00207720802630651zbMath1160.93373OpenAlexW2037518929MaRDI QIDQ3626898

R. la Brooy

Publication date: 14 May 2009

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207720802630651

zbMATH Keywords

simulated annealingoptimisationaerospace manufacturing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Application models in control theory (93C95)

Related Items

Ranking inter-relationships between clusters

Cites Work

• Optimization by Simulated Annealing
• Packing problems
• Some experiments with simulated annealing techniques for packing problems
• A typology of cutting and packing problems
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• New approaches for the nesting of two-dimensional shapes for press tool design