A simulated annealing approach to the nesting problem in the textile manufacturing industry
From MaRDI portal
Publication:1897378
DOI10.1007/BF02099693zbMath0831.90062OpenAlexW1972299802MaRDI QIDQ1897378
Thomas Lengauer, Ralf Heckmann
Publication date: 18 February 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02099693
Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)
Related Items (8)
Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming ⋮ A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ Fast neighborhood search for two- and three-dimensional nesting problems ⋮ Metaheuristics: A bibliography ⋮ [NO TITLE AVAILABLE] ⋮ A beam search implementation for the irregular shape packing problem ⋮ Computing closely matching upper and lower bounds on textile nesting problems ⋮ The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
Cites Work
- Average-case analysis of cutting and packing in two dimensions
- Determining an upper bound for a class of rectangular packing problems
- Optimal packing and covering in the plane are NP-complete
- Cutting stock problems and solution procedures
- Packing problems
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Some experiments with simulated annealing techniques for packing problems
- The nesting problem in the leather manufacturing industry
- An approach to two-dimensional cutting stock problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Unnamed Item
This page was built for publication: A simulated annealing approach to the nesting problem in the textile manufacturing industry
