A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm
From MaRDI portal
Publication:3626898
Recommendations
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle
- A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
Cites work
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
- A typology of cutting and packing problems
- New approaches for the nesting of two-dimensional shapes for press tool design
- Optimization by simulated annealing
- Packing problems
- Some experiments with simulated annealing techniques for packing problems
Cited in
(5)- Composite stock cutting through simulated annealing
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- scientific article; zbMATH DE number 2089828 (Why is no real title available?)
- Optimal packing using the multiple mating method
- Ranking inter-relationships between clusters
This page was built for publication: A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626898)