首页> 外文期刊>Archives of Computational Methods in Engineering >Optimization of Assembly Sequence Planning Using Soft Computing Approaches: A Review
【24h】

Optimization of Assembly Sequence Planning Using Soft Computing Approaches: A Review

机译:使用软计算方法优化装配顺序计划:综述

获取原文
获取原文并翻译 | 示例

摘要

Assembly sequence planning (ASP) is an NP-hard problem that involves finding the most optimum sequence to assemble a product. The potential assembly sequences are too large to be handled effectively using traditional approaches for the complex mechanical product. Because of the problem complexity, ASP optimization is required for the efficient computational approach to determine the best assembly sequence. This topic has attracted many researchers from the computer science, engineering, and mathematics background. This paper presents a review of the research that used soft computing approaches to solve and optimize ASP problem. The review on this topic is important for the future researchers to contribute in ASP. The literature review was conducted through finding related published research papers specifically on ASP that used soft computing approaches. This review focused on ASP modeling approach, optimization algorithms and optimization objectives. Based on the conducted review, several future research directions were drawn. In terms of the problem modeling, future research should emphasize to model the flexible part in ASP. Besides, the consideration of sustainable manufacturing and ergonomic factors in ASP will also be the new directions in ASP research. In addition, a further study on new optimization algorithms is also suggested to obtain an optimal solution in reasonable computational time.
机译:组装顺序计划(ASP)是一个NP难题,涉及找到组装产品的最佳顺序。潜在的组装顺序太大,无法使用复杂机械产品的传统方法有效处理。由于问题复杂,有效的计算方法需要ASP优化才能确定最佳的装配顺序。这个主题吸引了许多来自计算机科学,工程学和数学背景的研究人员。本文对使用软计算方法解决和优化ASP问题的研究进行了综述。对这个主题的回顾对于将来的研究人员为ASP做出贡献很重要。文献综述是通过找到相关的已发表的专门针对使用软计算方法的ASP的研究论文进行的。本文的重点是ASP建模方法,优化算法和优化目标。在进行的审查的基础上,得出了一些未来的研究方向。在问题建模方面,未来的研究应强调对ASP中的柔性部分进行建模。此外,ASP中对可持续生产和人体工程学因素的考虑也将成为ASP研究的新方向。此外,还建议对新的优化算法进行进一步研究,以在合理的计算时间内获得最佳解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号