Sequence based heuristics for two-dimensional bin packing problems

This article addresses several variants of the two-dimensional bin packing problem. In the most basic version of the problem it is intended to pack a given number of rectangular items with given sizes in rectangular bins in such a way that the number of bins used is minimized. Different heuristic ap...

ver descrição completa

Detalhes bibliográficos
Autor principal: Alvelos, Filipe Pereira e (author)
Outros Autores: Chan, Tak Ming (author), Vilaça, Paulo (author), Gomes, Tiago Manuel Ribeiro (author), Silva, Elsa (author), Carvalho, J. M. Valério de (author)
Formato: article
Idioma:eng
Publicado em: 2009
Assuntos:
Cutting and packing
Guillotine constraints
Greedy heuristics
Local search
variable neighbourhood descent
Science & Technology
Texto completo:http://hdl.handle.net/1822/26830
País:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/26830

Texto Completo

http://hdl.handle.net/1822/26830

Registos relacionados