Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Título del documento: Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Revue: Pesquisa operacional
Base de datos: PERIÓDICA
Número de sistema: 000312978
ISSN: 0101-7438
Autores: 1
Instituciones: 1Ufa State Aviation Technical University, Ufá. Rusia
Año:
Periodo: Dic
Volumen: 20
Número: 2
Paginación: 153-168
País: Brasil
Idioma: Inglés
Tipo de documento: Artículo
Enfoque: Experimental
Resumen en inglés 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
Disciplinas: Ciencias de la computación
Palabras clave: Procesamiento de datos,
Empaque,
Corte,
Pseudovalores,
Ramificación y poda,
Algoritmos,
Metodología
Keyword: Computer science,
Data processing,
Packing,
Cutting,
Pseudo-values,
Branch and bound,
Algorithms,
Methodology
Texte intégral: Texto completo (Ver HTML)