期刊文献+

计算机辅助排样技术基础分析

Research on the Basic Technology for Computer Aided Nesting
下载PDF
导出
摘要 本文分析了计算机辅助排样(CAN)的基础技术,它包括计算机技术、数学、图形学、人工智能等。其中计算机技术是CAN的下层基础,为计算机辅助排样提供前提性条件;数学、图形学、人工智能是CAN的上层基础,为CAN算法设计提供理论依据,并分析了相应的各类排样算法的层次性关系。 This paper describes the fundermental technology such as computer technology, math, graphics, artificial intelligence etc. for computer aided nesting (CAN). They can be divided two levels. One is the underlayer basic, such as the computer technology, which provides preconditions for CAN. The other is the superlayer basic, such as math, graphics, artificial intelligence which pro- vide theory for designing CAN arithmetic. According the research, this paper also summarized packing types and their CAN methods.
机构地区 浙江林学院
出处 《现代机械》 2007年第5期64-66,共3页 Modern Machinery
关键词 排样 算法 计算机技术 图形学 人工智能 nesting arithmetic computer technology graphics artificial intelligence
  • 相关文献

参考文献10

  • 1P.C.Gilmore,R.E.Gomory.Muhistage Cutting Stock Problems of Two and More Dimensions[J].Operations Res,1965,13:94-120
  • 2洪灵,胡树根,王耘,宋小文.分布式计算在平面不规则零件排样中的应用[J].现代机械,2005(2):9-10. 被引量:2
  • 3P.K.Agrawal.Minimizing Trim Loss in Cutting Rectangular Blanks of a Single Size Form a Rectangular Sheet Using Orthogonal Guillotine Cuts[J].European Journal of Operational Research,1993,96(3):410-422
  • 4Y Cui,R Zhou.Generating Optimal Cutting Patterns for Rectangular Blanks of a Single Size[J].Journal of the Operational Research Society,2002,53:1338-1346
  • 5M.Z.Arslanov.Continued Fractions in Optimal Cutting of a Rectangular Sheet Into Equal Small Rectangles[J].European Journal of Operational Research,2000,125-287
  • 6A.G.Tamowski,J.Terno,et al.A Polynomial Time Algorithm for the Guillotine Pallel Loading Problem[J].INFOR,1994,32:275-287
  • 7崔耀东,张春玲,赵谊.同尺寸矩形毛坯排样的连分数分支定界算法[J].计算机辅助设计与图形学学报,2004,16(2):252-256. 被引量:21
  • 8洪灵,王耘.一种不规则零件排样的快速解码算法[J].计算机辅助设计与图形学学报,2005,17(11):2465-2470. 被引量:11
  • 9E.Hopper,B.C.H.Turton.An Empirical Investigation of Metaheuristic and Heuristic Algorithm for a 2D Packing Problem[J].European Journal of Operations Research,2001,128:34-57
  • 10Francis,T.Y.Chong,et al.Pattern Nesting on Irregular-shaped Stock Using Genetic Algorithms[J].Engineering Application of Artiflcial IntelHgence,2002,15(6):551-558

二级参考文献19

  • 1曹炬,周济.冲裁件排样最优化的数字模型及算法[J].锻压技术,1993,18(6):21-24. 被引量:17
  • 2林好转.平行线分割一步平移法排样算法的研究[J].锻压技术,1994,19(5):33-35. 被引量:39
  • 3Baker B S, E G Coffman, R L Rivest. Orthogonal packing in two dimensions[J]. SIAM Journal on Computing, 1980, 9(4): 846~855.
  • 4Jakobs S. On genetic algorithms for the packing of polygons[J]. European Journal of Operational Research, 1996, 88(1): 165~181.
  • 5Ramesh Babu A, Ramesh Babu N. A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms[J]. Computer-Aided Design, 2001, 33(12): 879~891.
  • 6Tay, Francis E. H. Chong, T. Y. Lee. F. C. Pattern nesting on irregular-shaped stock using genetic algorithms[J]. Engineering Application of Artificial Intelligence, 2002, 15(6): 551~558.
  • 7Cheng C H, Feiring B R, Cheng T C E. Cutting stock problem-A survey[J]. International Journal of Production Economics, 1994, 36(3): 291~305
  • 8Healy P, Creavin M, Kuusik A. An optimal algorithm for rectangle placement[J]. Operations Research Letters, 1999, 24: 73~80
  • 9Leung T W, Yung C H, Troutt M D. Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem[J]. Computers & Engineering, 2001, 40: 201~214
  • 10Cung V D, Hifi M, Cun B L. Constrained two-dimensional cutting stock problems-A best-first branch-and-bound algorithm[J]. International Transactions in Operational Research, 2000, 7: 185~210

共引文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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