Logo BSU

Please use this identifier to cite or link to this item: http://elib.bsu.by/handle/123456789/97745
Title: А heuristic algorithm for two-dimensional strip packing problem
Authors: Dayong, Cao
Kotov, V. M.
Keywords: ЭБ БГУ::ОБЩЕСТВЕННЫЕ НАУКИ::Информатика
Issue Date: 2011
Publisher: Минск : БГУ
Citation: Технологии информатизации и управления : сб. науч. ст. Вып. 2 . – Минск, 2011. – С.
Abstract: In this paper, we construct an improved best-fit heuristic algorithm for two-dimensional rectangular strip packing problem (2D-RSPP), and compare it with some heuristic and metaheuristic algorithms from literatures. The experimental results show that BFBCC could produce satisfied packing layouts than these methods, especially for the large problem of 50 items or more, BFBCC could get better results in shorter time.
URI: http://elib.bsu.by/handle/123456789/97745
ISBN: 978-985-518-582-7
Appears in Collections:Создание информационной образовательной среды учебного заведения и технологии дистанционного обучения

Files in This Item:
File Description SizeFormat 
Dayong_Kotov.pdf998,06 kBAdobe PDFView/Open


PlumX

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.