Recursive Heuristic Algorithm for the 2D Rectangular Strip Packing Problem
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The paper presents a novel and effective heuristic algorithm for the two-dimensional rectangular strippacking problem. This algorithm is mainly based on the bestfit value and tree recursive search rules and selects themaximal fitness rectangle to the packing the space. The computational results on a large number of Benchmarkproblems have shown that this algorithm is more effective than the existing novel algorithm.

    Reference
    Related
    Cited by
Get Citation

彭碧涛,周永务.求解2D条带矩形Packing问题的迭代启发式算法.软件学报,2012,23(10):2600-2611

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 11,2011
  • Revised:January 20,2012
  • Adopted:
  • Online: September 30,2012
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063