A HEURISTIC ALGORITHM FOR RECTANGULAR PACKING BASED ON BINTREE EXPRESSION
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    in this paper,a method using bintree structure to express the packing space for rectangular packing is proposed. Through the sequential decomposition of the packing space,the optimal packing scheme of varioussized rectangular packing can be obtained by every time putting the optimal packing element that satisfy specular conditions toward cur rentpacking space and locating it at the up-left corner of the current packing space.Different optimal packing schemes that satisfy different demands can be obtained by adjusting the value of the ordering factors KA and KB.In addition,the packing schemes obtained satisfy the guillotine cutting demands in glass industry.The experimental results indicate that the algorithm is flexible and effective.

    Reference
    Related
    Cited by
Get Citation

王爱虎,查建中,王金敏.一种基于二叉树结构表达的矩形物体布局的启发式方法.软件学报,1996,7(4):252-257

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:February 27,1995
  • Adopted:
  • Online:
  • 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