Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)

AUTOR(ES)

Mukhacheva, E.A., Belov, G.N., Kartack, V.M., Mukhacheva, A.S.

FONTE

Pesquisa Operacional

DATA DE PUBLICAÇÃO

2000-12

RESUMO

Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method) and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.

Documentos Relacionados

• ESTRATÉGIAS PARALELAS INTELIGENTES PARA O MÉTODO BRANCH-AND-BOUND APLICADAS AO PROBLEMA DO CAIXEIRO VIAJANTE ASSIMÉTRICO
• Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
• Branch-and-bound method application in a single machine earliness/tardiness scheduling problem with a common due date.
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS