Fast pattern-based algorithms for cutting stock

• Tipo: Artigo em Revista Científica Internacional
• Data: 2014

Autores

Filipe Brandao (Autor) Outra; Joao Pedro Pedroso (Autor) FCUP

Revista

A Revista está pendente de validação pelos Serviços Administrativos.

Título: COMPUTERS & OPERATIONS RESEARCH

Vol. 48

Páginas: 69-80

ISSN: 0305-0548

Indexação

ISI Web of Knowledge - 5 Citações

Scopus - 6 Citações

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Engenharia civil

Outras Informações

ID Authenticus: P-009-BXK

DOI: 10.1016/j.cor.2014.03.003

Abstract (EN): The conventional assignment-based first/best fit decreasing algorithms (FFD/BFD) are not polynomial in the one-dimensional cutting stock input size in its most common format. Therefore, even for small instances with large demands, it is difficult to compute FFD/BFD solutions. We present pattern-based methods that overcome the main problems of conventional heuristics in cutting stock problems by representing the solution in a much more compact format Using our pattern-based heuristics, FFD/BFD solutions for extremely large cutting stock instances, with billions of items, can be found in a very short amount of time.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 12