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

求解矩形条带装箱问题的动态匹配启发式算法.PDF

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．