A 2-exchange heuristic for nesting problems

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

Autores

Gomes, AM (Autor) Outra; Oliveira, JF (Autor) FEUP

Revista

Título: European Journal of Operational Research

Vol. 141 Nº 2

Páginas: 359-370

ISSN: 0377-2217

Editora: Elsevier

Indexação

ISI Web of Knowledge - 70 Citações

ISI Web of Science

Scopus - 97 Citações

COMPENDEX

Classificação Científica

CORDIS: Ciências Físicas > Matemática > Matemática aplicada > Investigação operacional

FOS: Ciências da engenharia e tecnologias > Biotecnologia industrial

Outras Informações

ID Authenticus: P-000-N3G

DOI: 10.1016/s0377-2217(02)00130-3

Abstract (EN): This paper describes a new heuristic for the nesting problem based on a 2-exchange neighbourhood generation strategy. This mechanism guides the search through the solution space consisting of the sequences of pieces and relies on a low-level placement heuristic to actually convert one sequence in a feasible layout. The placement heuristic is based on a bottom-left greedy procedure with the ability to fill holes in the middle of the layout at a later stage. Several variants of the 2-exchange nesting heuristic were implemented and tested with different initial solution ranking criteria, different strategies for selecting the next solution, and different neighbourhood sizes. The computational experiments were based on data sets published in the literature. In most of the cases, the 2-exchange nesting algorithm generated better solutions than the best known solutions.

Idioma: Inglês

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

Nº de páginas: 12