Welcome![Sign In][Sign Up]
Location:
Search - strip packing

Search list

[Special EffectsKnap

Description: 矩形条带装箱问题(RSPP)是指将一组矩形装入在一个宽度固定高度不限的矩形容器中,以期 获得最小装箱高度.RSPP理论上属于NP难问题,在新闻组版、布料下料以及金属切割等工业领域中 有着广泛的应用.为解决该问题,采用了一种混合算法,即将一种新的启发式算法—— 动态匹配算 法—— 与遗传算法结合起来.混合算法中,动态匹配算法能根据4类启发式规则动态选择与装填区域相 匹配的下一个待装矩形,同时将装箱后所需容器高度用遗传算法的进化策略进行优化.对2组标准测试 问题的计算结果表明,相对于文献中的已有算法,提出的算法更加有效.-Given a set of small rectangular pieces of different sizes and a rectangular container of fixed width and infinite length,the rectangular strip packing problem (RSPP) consists of orthogonally placing all the pieces within the container,without overlapping,such that the overall length of the packing is minimized. RSPP belongs to NP—hard problem in theory and has many industrial applications such as the composition of news,the cutting of elothing and the cutting of metal,etc.To solve the rectangular strip packing problem ,a hybrid algorithm ,which combines a novel heuristic algorithm- dynamic—fit heuristic algorithm (DFHA),with the genetic algorithm,is adopted. The DFHA algorithm can dynamically select the better-fit rectangle for packing,according to the width—fit first(W FF)rule,the height—fit first(HFF) rule,the placeable first(PF) rule,and the biggest— rectangle first(BRF)rule,and the evolutionary capability of genetic algorithm is used to optimize the height of the packing
Platform: | Size: 477184 | Author: 郭事业 | Hits:

[Software Engineeringyc

Description: 矩形件排样问题的遗传算法求解,很详细的一份资料。-Genetic Algorithm for the Rectangular Strip Packing Problem, a very detailed information.
Platform: | Size: 37888 | Author: Jason | Hits:

[matlab二维矩形条带装箱问题的底部左齐择优匹配算法

Description: 针对二维矩形条带装箱问题提出了一种启发式布局算法,即底部左齐择优匹配算法(lowest—level left align bestfit,简称LLABF).LLABF算法遵循最佳匹配优先原则,该原则综合考虑完全匹配优先、宽度匹配优先、高度匹配优先、组合宽度匹配优先及可装入优先等启发式规则.与BL(bottom-left),IBL(improved-bottom-left)与BLF(bottom—left-fill)等启发算法不同的是,LLABF能够在矩形装入过程中自动选择与可装区域匹配的下一个待装矩形.计算结果表明,LLABF结合遗传算法(genetie algorithm,简称GA)解决二维条带装箱问题更加有效.(A heuristic placement algorithm for two-dimensional rectangular strip packing problem is proposed, which is called bottom-level left align best fit algorithm (LLABF). Different from BL (bottom-left), IBL (improved-bottom-left) and BLF (bottom-left-fill) heuristic algorithms, LLABF can automatically select the next rectangle to be loaded that matches the mountable region during the rectangular loading process. Genetie algorithm (GA) is more effective to solve the two-dimensional strip packing problem.)
Platform: | Size: 580608 | Author: Mr_WX | Hits:

CodeBus www.codebus.net