Description: 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
- [LinPacker-0.0.12] - LinPacker optimization is a rectangular
- [BinPacking] - this is the most difficult of a process,
- [packing5] - Rectangular Nesting with bl algorithm. W
- [tanxinfazhuangxiang] - Data structure in the bin-packing proble
- [no2] - Two-dimensional irregular parts nesting
- [jzxdzxwt] - Container loading algorithm design repor
- [diffevol-1.10] - Differential Evolution Strategy C++ sour
- [PPD] - Packing using FFD algorithm programming
File list (Check if you may need any files):
求解矩形条带装箱问题的动态匹配启发式算法.PDF
Download