A variable neighborhood search algorithm for the leather nesting problem
From MaRDI portal
Publication:1954576
DOI10.1155/2012/254346zbMath1264.90145WikidataQ58911337 ScholiaQ58911337MaRDI QIDQ1954576
Cláudio Alves, Telmo Pinto, Pedro Brás, José M. Valério de Carvalho
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/254346
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Variable neighbourhood search: methods and applications
- Variable neighborhood search
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- The nesting problem in the leather manufacturing industry
- Neighborhood structures for the container loading problem: a VNS implementation
- An improved typology of cutting and packing problems
- A Maximal-Space Algorithm for the Container Loading Problem
- An algebra of polygons through the notion of negative shapes