首页> 外文期刊>International Journal of Production Research >An improved ant colony optimisation algorithm for three-tier supply chain scheduling based on networked manufacturing
【24h】

An improved ant colony optimisation algorithm for three-tier supply chain scheduling based on networked manufacturing

机译:基于网络化制造的三级供应链调度蚁群优化算法

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

摘要

This paper presents a study on supply chain scheduling from the perspective of networked manufacturing (NM). According to feature analysis of supply chain scheduling based on NM, we comprehensively consider the combined benefits of cost, time, and satisfaction level for customised services. In order to derive a scheduling strategy among supply chain members based on NM, we formulate a three-tier supply chain scheduling model composed of manufacturer, collaborative design enterprise and customer. Three objective functions time function, cost function and delay punishment function - are employed for model development. We also take into account multi-objective optimisation under the constraint of product capacity. By using an improved ant colony optimisation algorithm, we add different pheromone concentrations to selected nodes that are obtained from feasible solutions and we confine pheromone concentrations ι within the minimum value ι_(min) and the maximum value ι_(min) , thus obtaining optimal results. The results obtained by applying the proposed algorithm to a real-life example show that the presented scheduling optimisation algorithm has better convergence, efficiency, and stability than conventional ant colony optimisation. In addition, by comparing with other methods, the output results indicate that the proposed algorithm also has better solutions.
机译:本文从网络制造(NM)的角度提出了关于供应链调度的研究。根据基于NM的供应链调度的特征分析,我们综合考虑了定制服务的成本,时间和满意度的综合好处。为了推导基于NM的供应链成员之间的调度策略,我们制定了一个由制造商,协同设计企业和客户组成的三层供应链调度模型。模型开发采用了三个目标函数时间函数,成本函数和延迟惩罚函数。我们还考虑了在产品产能约束下的多目标优化。通过使用改进的蚁群优化算法,我们将不同的信息素浓度添加到从可行解中获得的选定节点,并将信息素浓度η限制在最小值ι_(min)和最大值ι_(min)内,从而获得最佳结果。通过将所提出的算法应用于实际示例中的结果表明,所提出的调度优化算法具有比常规蚁群优化更好的收敛性,效率和稳定性。另外,通过与其他方法的比较,输出结果表明该算法也具有较好的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号