GPU-based computing for nesting problems: the importance of sequences in static selection approaches
In this paper, we address the irregular strip packing problem (or nesting problem) where irregular shapes have to be placed on strips representing a piece of material whose width is constant and length is virtually unlimited. We explore a constructive heuristic that relies on the use of graphical pr...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2015
|
| Texto completo: | http://hdl.handle.net/1822/53284 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/53284 |