期刊文献+

两阶段法求解1.5维切割问题

Using two-stage method to solve 1.5-dimensional cutting stock problem
下载PDF
导出
摘要 切割问题亦称为下料问题。多维切割问题是机加工、木材加工和造纸等行业在生产中经常遇见的实际问题。1.5维切割问题是介于一维和二维切割问题之间的一类问题。针对1.5维切割问题的特殊性,采用两阶段方法进行求解。第一阶段是将1.5维切割问题转化为一维切割问题,第二阶段首先利用一种启发式算法得到一组初始解,然后使用粒子群算法对初始解进行优化,得最终解。 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.
作者 熊慧 李大卫
出处 《机械设计与制造》 北大核心 2007年第11期30-32,共3页 Machinery Design & Manufacture
基金 辽宁省教育厅高等学校科学研究项目(05L008)
关键词 1.5维切割问题 两阶段方法 启发式算法 粒子群算法 1.5-dimensional cutting stock problems Two-stage method Heuristics algorithms Particle swarm algorithm
  • 相关文献

参考文献7

  • 1贾志欣,殷国富,胡晓兵,舒斌.一维下料方案的遗传算法优化[J].西安交通大学学报,2002,36(9):967-970. 被引量:34
  • 2黄崇斌,胡吉全.板材优化下料矩形综合法[J].起重运输机械,1999(6):28-37. 被引量:5
  • 3J. Beasley,A population heuristic for constrained two-dimensional non-guillotine cutting [M],European Journal of Operational Research, 2004,156:601-627.
  • 4李明,宋成芳,周泽魁.二维不规则零件排样问题的粒子群算法求解[J].江南大学学报(自然科学版),2005,4(3):266-269. 被引量:10
  • 5Tugba Sarac, A Genetic algorithm for 1.5 dimensional assortment problems with multiple objectives [M], Springer-Verlag, Berlin, Hei delberg, 2003.
  • 6J.Kennedy,R.Eberhart,Particle swarm optimization[C],Proceedings of the 1995 IEEE International Conference on Neural Network,1995:1942- 1948.
  • 7P.C.Fourie,Particle swarms in size and shape optimization[C].In:Sny man,J.A.(ed.) Proe.Workshop on Multidisciplinary Design Optimization (held at University of Pretoria,South Africa),2002:97-106.

二级参考文献12

  • 1孙国正,优化设计及应用,1992年
  • 2陈秀宁,械优化设计,1991年
  • 3Hopper E, Turton B. A genetic algorithm for a 2D industrial packing problem[J]. Computers and Industrial Engineering, 1999, 37(1-2): 375-378.
  • 4Kennedy J, Eberhart R C. Particle swarm optimization[A]. Proc IEEE Int'l Conf. on Neural Networks[C]. Piscataway:IEEE Service Center, 1995, 1942-1948.
  • 5Eberhart R C, Shi Y. Particle swarm optimization: development, applications and resources[A]. Proc Congress on Evolutionary Computation[C].Seoul:IEEE Service Center, 2001, 81-86.
  • 6Eberhart R C, Shi Y. Comparing inertia weights and constriction factors in particle swarm optimization[A]. Proc Congress on Evolutionary Computation[C]. San Diego:IEEE Service Center, 2000, 84-88.
  • 7Jokobs S. On genetic algorithms for the packing of polygons[J]. European Journal of Operational Research, 1996, 88(1): 165-181.
  • 8文祥斌.钢材下料的最优化[J].重型汽车,1998(6):15-17. 被引量:1
  • 9苗延义.应用线性规划优化C_(62A)敞车制动管下料[J].机车车辆工艺,1999(2):21-24. 被引量:1
  • 10曹炬,胡修彪.大规模矩形件优化排样的遗传算法[J].锻压机械,1999,34(4):17-20. 被引量:14

共引文献45

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部