首页> 外文期刊>Journal of Industrial Engineering International >Optimizing a multi-product closed-loop supply chain using NSGA-II, MOSA, and MOPSO meta-heuristic algorithms
【24h】

Optimizing a multi-product closed-loop supply chain using NSGA-II, MOSA, and MOPSO meta-heuristic algorithms

机译:使用NSGA-II,MOSA和MOPSO元启发式算法优化多产品闭环供应链

获取原文
       

摘要

This study aims to discuss the solution methodology for a closed-loop supply chain (CLSC) network that includes the collection of used products as well as distribution of the new products. This supply chain is presented on behalf of the problems that can be solved by the proposed meta-heuristic algorithms. A mathematical model is designed for a CLSC that involves three objective functions of maximizing the profit, minimizing the total risk and shortages of products. Since three objective functions are considered, a multi-objective solution methodology can be advantageous. Therefore, several approaches have been studied and an NSGA-II algorithm is first utilized, and then the results are validated using an MOSA and MOPSO algorithms. Priority-based encoding, which is used in all the algorithms, is the core of the solution computations. To compare the performance of the meta-heuristics, random numerical instances are evaluated by four criteria involving mean ideal distance, spread of non-dominance solution, the number of Pareto solutions, and CPU time. In order to enhance the performance of the algorithms, Taguchi method is used for parameter tuning. Finally, sensitivity analyses are performed and the computational results are presented based on the sensitivity analyses in parameter tuning.
机译:本研究旨在讨论闭环供应链(CLSC)网络的解决方案方法,其中包括二手产品的收集以及新产品的分销。提出的供应链代表可以通过提出的元启发式算法解决的问题。为CLSC设计了一个数学模型,该模型涉及三个目标功能,即最大化利润,最小化总风险和产品短缺。由于考虑了三个目标函数,因此多目标解决方案方法可能是有利的。因此,已经研究了几种方法,并且首先使用了NSGA-II算法,然后使用MOSA和MOPSO算法对结果进行了验证。在所有算法中使用的基于优先级的编码是解决方案计算的核心。为了比较元启发式算法的性能,将通过四个标准对随机数值实例进行评估,其中包括平均理想距离,非优势解的传播,帕累托解的数量和CPU时间。为了提高算法的性能,使用Taguchi方法进行参数调整。最后,进行灵敏度分析,并基于参数调整中的灵敏度分析给出计算结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号