A variable neighborhood search algorithm for the leather nesting problem
The leather nesting problem is a cutting and packing optimization problem that consists in finding the best layout for a set of irregular pieces within a natural leather hide with an irregular surface and contour. In this paper, we address a real application of this problem related to the production...
Main Author: | |
---|---|
Other Authors: | , , |
Format: | article |
Language: | eng |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/15192 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/15192 |