首页 | 本学科首页   官方微博 | 高级检索  
     

矩形件排样优化的双向双原算法
引用本文:郭文兰,张彤.矩形件排样优化的双向双原算法[J].哈尔滨理工大学学报,2008,13(2):39-42.
作者姓名:郭文兰  张彤
作者单位:1. 哈尔滨理工大学,计算机科学与技术学院,黑龙江,哈尔滨,150080
2. 哈尔滨工业大学,国家大学科技园,黑龙江,哈尔滨,150001
摘    要:针对矩形件排样优化问题,分析了传统近似算法的主要缺陷,并在此基础上提出了一种新的排样算法-双向双原算法.该算法的主要思想是:首先采用局部最优原则,将板材划分成两段,然后将该分割点设定为两个待排区域的原点,最后采用改进的近似算法对其进行排样.实际排样结果表明,双向双原算法既满足了实际生产的工艺要求,又提高了板材的利用率,获得了比近似算法更好的排样结果.

关 键 词:优化排样问题  分割点  近似算法
文章编号:1007-2683(2008)02-0039-04
修稿时间:2007年3月16日

The Bi-directional and Double-original Algorithm for the Rectangles Cutting Stock Problem
GUO Wen-lan,ZHANG Tong.The Bi-directional and Double-original Algorithm for the Rectangles Cutting Stock Problem[J].Journal of Harbin University of Science and Technology,2008,13(2):39-42.
Authors:GUO Wen-lan  ZHANG Tong
Abstract:To solve the rectangles Cutting Stock Problem,this paper proposes a new algorithm-the Bi-directional and Double-original algorithm,based on analyzing the main disadvantage of the traditional approximate algorithm.The main idea of the Bi-directional and Double-original algorithm is to divide the stock into two parts using the local optimal principle,and set the division point as the original of the two layout region which is layout using improved approximate algorithm.The experimental results show that the Bi-directional and double-original algorithm not only fulfills the technical requirements,but also increases the utilization ratio of the plate.Therefore,it can get a more satisfying optimized result than approximate algorithm.
Keywords:cutting stock problem  division point  approximate algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号