Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Document title: Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Journal: Pesquisa operacional
Database: PERIÓDICA
System number: 000312978
ISSN: 0101-7438
Authors: 1
Institutions: 1Ufa State Aviation Technical University, Ufá. Rusia
Year:
Season: Dic
Volumen: 20
Number: 2
Pages: 153-168
Country: Brasil
Language: Inglés
Document type: Artículo
Approach: Experimental
English abstract 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
Disciplines: Ciencias de la computación
Keyword: 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
Full text: Texto completo (Ver HTML)