首页> 外文期刊>International Journal of Computer Integrated Manufacturing >Application of modified multi-objective particle swarm optimisation algorithm for flexible process planning problem
【24h】

Application of modified multi-objective particle swarm optimisation algorithm for flexible process planning problem

机译:改进多目标粒子群优化算法在柔性工艺规划问题中的应用

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Process planning belongs to one of the most essential functions of the modern manufacturing system. Moreover, flexible process planning implies the ability of a system to adapt to changing requirements and thereby provide alternative ways of performing manufacturing operations on a part. Variety of manufacturing resources including variety of alternative machines, alternative tools, as well as tool access direction (TAD) leads to the fact that most of the parts in modern manufacturing systems have various flexible process plans. Therefore, obtaining optimal process plan from all available alternatives has become a very important task in the domain of flexible process planning research. In this article, a method based on modified particle swarm optimisation (mPSO) has been developed to solve this nondeterministic polynomial-hard combinatorial optimisation problem, and the following issues have been addressed: (i) the AND/OR network representation has been adopted to describe various types of flexibility, i.e. machine flexibility, tool flexibility, TAD flexibility, process flexibility and sequence flexibility; (ii) the particle encoding/decoding scheme has been proposed and traditional PSO algorithm has been modified with crossover, mutation and shift operator and (iii) optimal operation sequence has been found by performing multi-objective optimisation procedure concerning minimisation of the production time and production cost. In order to verify the performance of the proposed mPSO algorithm, five independent experiments have been carried out and comparisons with other meta-heuristic algorithms have been made. The experimental results show that the proposed algorithm has achieved satisfactory improvement in terms of efficiency and effectiveness.
机译:工艺规划是现代制造系统最重要的功能之一。此外,灵活的工艺规划意味着系统能够适应不断变化的需求,从而提供对零件执行制造操作的替代方法。各种制造资源,包括各种替代机器、替代工具以及工具访问方向 (TAD),导致现代制造系统中的大多数零件都具有各种灵活的工艺计划。因此,从所有可用的备选方案中获取最佳工艺方案已成为柔性工艺规划研究领域的一项非常重要的任务。本文提出了一种基于修正粒子群优化(mPSO)的方法来解决这种非确定性多项式-硬组合优化问题,并解决了以下问题:(i)采用AND/OR网络表示来描述各种类型的灵活性,即机器灵活性、工具灵活性、TAD灵活性、工艺灵活性和序列灵活性;(ii)提出了粒子编解码方案,并对传统的PSO算法进行了修改,采用交叉、突变和移位算子,(iii)通过执行多目标优化程序,找到了最优的操作顺序,以最小化生产时间和生产成本。为了验证所提mPSO算法的性能,进行了5个独立实验,并与其他元启发式算法进行了比较。实验结果表明,所提算法在效率和有效性方面取得了令人满意的提升。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号