基于块结构的二维排样问题的研究-软件工程专业论文.docxVIP

基于块结构的二维排样问题的研究-软件工程专业论文.docx

  1. 1、本文档共56页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
但在合理的计算时间仍能获得较高的材料利用率;将二者的求解算法与线 但在合理的计算时间仍能获得较高的材料利用率;将二者的求解算法与线 性规划算法结合求解二维下料问题时,均可在合理的计算时间内获取最优 的下料方案,这将对实际的生产实践起到一定的现实指导作用。 关键词:二维排样问题CUB排样方式DMS排样方式动态规划背包问 题 万方数据 RESEARCH RESEARCH ON THE PROBLEM OF TWO D I MENS l ONAL LAYOUT BASED ON BLOCK STRUCTURE ABSTRACT Two dimensional optimization problem of rectangular blanks refers to a layout problem,which needs to let a set of rectangular blanks lay in the limited area with no overlap to realize the optimized utilization of resource.It is mainly applied in the machinery manufacturing,clothing,wood,and other manufacturing areas.To solve the large scale cutting problem,we usually use linear programming to solve iteratively.During the each iteration,we need to call the algorithm of solving the unconstrained two—dimensional cutting problem optimizeimize thethe obiobiectiveive function,andtunctlon and toto obtainObtam thetlae optimal)timal solutionSO UtlOn ofOI tile problem.So a good layout algorithm directly determines the quality of the solution to the problem.Designing a reasonable and efficient optimization algorithm will have a very deep practical significance to the production practice. In this paper,we will study the unconstrained two-dimensional problem based on the block structure.Two kinds of the specific type layout patterns based on block structure are presented.Those are called Double—rows and Multi Segment pattem and Complex Uniform Block pattem,which are called DMS and CUB for short respectively in the passage.In this paper two algorithms of generating two layouts are introduced in detail,which are respectively called 川 万方数据 GenDMS GenDMS and GenCUB for short. The algorithms were tested through three group benchmark problems. Through analyzing of the experimental results of the comparison,we can get the following conclusions.In the process of using the DMS pattem to deal with the cutting problem combined with sheafing machine Can simplify the cutting process,shorten the calculation time,and also improve t

您可能关注的文档

文档评论(0)

131****9843 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档