A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm
DOI10.1080/00207720802630651zbMATH Open1160.93373OpenAlexW2037518929MaRDI QIDQ3626898FDOQ3626898
Authors: R. la Brooy 
Publication date: 14 May 2009
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720802630651
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
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Application models in control theory (93C95)
Cites Work
- Optimization by simulated annealing
- A typology of cutting and packing problems
- Packing problems
- Some experiments with simulated annealing techniques for packing problems
- New approaches for the nesting of two-dimensional shapes for press tool design
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
Cited In (5)
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)
