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

两阶段法求解1.5维切割问题
引用本文:熊慧,李大卫. 两阶段法求解1.5维切割问题[J]. 机械设计与制造, 2007, 0(11): 30-32
作者姓名:熊慧  李大卫
作者单位:辽宁科技大学,理学院,鞍山,114044
摘    要:切割问题亦称为下料问题.多维切割问题是机加工、木材加工和造纸等行业在生产中经常遇见的实际问题.1.5维切割问题是介于一维和二维切割问题之间的一类问题.针对1.5维切割问题的特殊性,采用两阶段方法进行求解.第一阶段是将1.5维切割问题转化为一维切割问题,第二阶段首先利用一种启发式算法得到一组初始解,然后使用粒子群算法对初始解进行优化,得最终解.

关 键 词:1.5维切割问题  两阶段方法  启发式算法  粒子群算法  两阶段法  求解  切割问题  method  problem  stock  最终解  优化  粒子群算法  使用  初始解  启发式算法  利用  二阶  转化  两阶段方法  一维  中经  生产  行业
文章编号:1001-3997(2007)11-0030-02
收稿时间:2006-12-29
修稿时间:2006-12-29

Using two-stage method to solve 1.5-dimensional cutting stock problem
XIONG Hui,LI Da-wei. Using two-stage method to solve 1.5-dimensional cutting stock problem[J]. Machinery Design & Manufacture, 2007, 0(11): 30-32
Authors:XIONG Hui  LI Da-wei
Abstract:Cutting stock problems can be found in various industries. They arise, for examples, with machining, timber processing, paper-making, etc. 1.5-dimensional cutting stock problem is a problem between one-dimersional cutting and two-dimensional cutting. In this study, a two-stage approach is developed for 1.5-dimensional cutting problem. 1.5-dimensional cutting problem is changed into one-dimensional cutting problem in the first step. An initial solution is obtained by using heuristics algorithm and then optimizes the solution by using particle swarm algorithm in the second stage.
Keywords:1.5-dimensional cutting stock problems   Two-stage method   Heuristics algorithms   Particle swarm algorithm
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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