火箭壳体加工的虚拟单元重构方法研究
DOI:
作者:
作者单位:

国防科技大学

作者简介:

通讯作者:

中图分类号:

V19

基金项目:

国家自然科学基金项目


Research on Virtual Cellular Reconstruction Method of Rocket Shell Processing
Author:
Affiliation:

National University of Defense Technology

Fund Project:

The National Natural Science Foundation of China

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对火箭壳体加工车间新订单连续到达,排产方案重构频繁的问题,本文首先建立了虚拟单元重构的多目标规划模型:以多批订单总生产时间、运输设备总运输距离以及车间生产设备负荷均衡因素为目标函数,以车间设备和火箭壳体加工工艺限制为约束条件;其次,提出了一种改进的NSGA-Ⅱ算法对模型进行优化求解:针对NSGA-Ⅲ算法局部搜索能力的不足,在NSGA-Ⅱ算法交叉过程中引入“首次改进”和“随机改进”两种局部搜索策略;最后,基于超体积、均匀性两个多目标评价指标对提出的改进NSGA-Ⅱ算法与传统的NSGA-Ⅱ算法以及NSGA-Ⅲ算法进行比较,结合实例验证了改进NSGA-Ⅱ算法在进行火箭壳体虚拟单元重构时更加高效。

    Abstract:

    For new orders arrive continuously in rocket shell processing workshop and production scheduling scheme refactoring frequently, this paper establishes the mathematical model of multi-objective constraint virtual unit production. It takes the total production time of multiple orders, the total transportation distance of transportation equipment and load balancing factors of workshop production equipment as objective functions, workshop equipment and rocket shell processing technology as constraint conditions. Then, an improved NSGA-Ⅱ algorithm is come up with to solve the mathematical model. In order to improve the NSGA-Ⅱ algorithm’s local search ability, both the “first improvement” strategy and the “random improvement” strategy are introduced in interlace operation. Finally, the improved NSGA-Ⅱ algorithm is compared with the NSGA-Ⅱ algorithm and the NSGA-Ⅲ algorithm on the hypervolume and the spacing in a instance. As a result, the improved NSGA-Ⅲ algorithm performs more efficiently on virtual Cellular reconstruction of rocket shell processing.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2021-03-17
  • 最后修改日期:2021-07-23
  • 录用日期:2021-07-30
  • 在线发布日期:
  • 出版日期: