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

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 conside...

Full description

Bibliographic Details
Main Authors:	Mukhacheva E.A., Belov G.N., Kartack V.M., Mukhacheva A.S.
Format:	Article
Language:	English
Published:	Sociedade Brasileira de Pesquisa Operacional 2000-01-01
Series:	Pesquisa Operacional
Subjects:	packing cutting pseudo-values branch-and-bound method
Online Access:	http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200002

id	doaj-08c9b48692f541658e512ba8ede5f254
record_format	Article
spelling	doaj-08c9b48692f541658e512ba8ede5f2542020-11-24T21:27:57ZengSociedade Brasileira de Pesquisa OperacionalPesquisa Operacional0101-74381678-51422000-01-01202153168Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)Mukhacheva E.A.Belov G.N.Kartack V.M.Mukhacheva A.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.http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200002packingcuttingpseudo-valuesbranch-and-bound method
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Mukhacheva E.A. Belov G.N. Kartack V.M. Mukhacheva A.S.
spellingShingle	Mukhacheva E.A. Belov G.N. Kartack V.M. Mukhacheva A.S. Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) Pesquisa Operacional packing cutting pseudo-values branch-and-bound method
author_facet	Mukhacheva E.A. Belov G.N. Kartack V.M. Mukhacheva A.S.
author_sort	Mukhacheva E.A.
title	Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_short	Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_full	Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_fullStr	Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_full_unstemmed	Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_sort	linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (svc) and a modified branch-and-bound method (mbb)
publisher	Sociedade Brasileira de Pesquisa Operacional
series	Pesquisa Operacional
issn	0101-7438 1678-5142
publishDate	2000-01-01
description	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.
topic	packing cutting pseudo-values branch-and-bound method
url	http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200002
work_keys_str_mv	AT mukhachevaea linearonedimensionalcuttingpackingproblemsnumericalexperimentswiththesequentialvaluecorrectionmethodsvcandamodifiedbranchandboundmethodmbb AT belovgn linearonedimensionalcuttingpackingproblemsnumericalexperimentswiththesequentialvaluecorrectionmethodsvcandamodifiedbranchandboundmethodmbb AT kartackvm linearonedimensionalcuttingpackingproblemsnumericalexperimentswiththesequentialvaluecorrectionmethodsvcandamodifiedbranchandboundmethodmbb AT mukhachevaas linearonedimensionalcuttingpackingproblemsnumericalexperimentswiththesequentialvaluecorrectionmethodsvcandamodifiedbranchandboundmethodmbb
_version_	1725972438325395456

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

Similar Items