• Article
  • | |
  • Metrics
  • |
  • Reference [14]
  • |
  • Related [20]
  • |
  • Cited by [10]
  • | |
  • Comments
    Abstract:

    This paper presents an effective nesting method for leather manufacturing, such as automobile interior decoration, etc. After the profiles of leather sheets and stencils are obtained, they are discretized to make the processing independent of the distinct geometry. The constraints of profiles are thoroughly considered. A heuristic bottom-left placement strategy is employed to sequentially place stencils on sheets. The optimal placement sequence and rotation are deterimined using a simulated annealing based genetic algorithm (SABGA). A natural concise encoding method is developed to satisfy the possible requirements of the leather nesting problem. Experimental results show that the proposed mehtod not only can be applied to the normal two-dimensional nesting problems, but also can be especially suited for the placement of multiple two-dimensionally irregular stencils on multiple two-dimensionally irregular sheets as well.

    Reference
    [1]Hopper E, Turton BCH. A review of the application of mete-heuristic algorithms to 2D regular and irregular strip packing problems. Artificial Intelligence Review, 2001,16:257-300.
    [2]Bennell JA, Dowsland KA, Dowsland WB. The irregular cutting-stock problem-A new procedure for deriving the no-fit polygon. Computers and Operations Research, 2001,28(3):271-287.
    [3]Gomes AM, Oliveira JF. A 2-exchange heuristic for nesting problems. European Journal of Operational Research, 2002,141(3):359 -370.
    [4]Heistermann J, Lengauer T. The nesting problem in the leather manufacturing industry. Annals of Operational Research, 1995,57: 147-173.
    [5]Xing WX, Xie JX. Modern Optimization Calculation Methods. Beijing: Tshinghua University Press, 2000 (in Chinese).
    [6]Reeves CR. Modern Heuristic Techniques for Combinational Problems. Oxford: Blackwell Scientific Publications, 1993.
    [7]Heckmann R, Lengauer T. A simulated annealing approach to the nesting problem in the textile manufacturing industry. Annals of Operational Research, 1995,57:103-133.
    [8]Heckmann R, Lengauer T. Computing closely mathing upper and lower bounds on textile nesting problems. European Journal of Operational Research, 1999,108(3):473-489.
    [9]Jain S, Chang HG. Two-Dimensional packing problems using genetic algorithms. Engineering with Copmuters, 1998,14(3): 206-213.
    [10]Cui Y. The Processing and Analysis for Images. Beijing: The Science and Technique Publisher, 2000. 65-86 (in Chinese).
    [11]Babu AR, Babu NR. Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Int'l Journal Produce Research, 1999,37(7):1625-1643.
    [12]Liu Y. Simulated Annealing with a Potential Function with Discontinuous Gradient and an Adaptive Simulated. Beijing: Peking University Press, 1999. 15-80.
    [13]邢文训,谢金星.现代优化计算方法.北京:清华大学出版社,2000.
    [14]崔屹.图像处理与分析.北京:科学技术出版社,2000.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

张玉萍,张春丽,蒋寿伟.皮料优化排样的有效方法.软件学报,2005,16(2):316-323

Copy
Share
Article Metrics
  • Abstract:5037
  • PDF: 10258
  • HTML: 0
  • Cited by: 0
History
  • Received:October 24,2003
  • Revised:April 01,2004
You are the first2034841Visitors
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