期刊文献+

基于强化学习的群体进化算法求解双边多目标同步并行拆解线平衡问题 被引量:1

Reinforcement Learning-based Swarm Evolutionary Algorithm To Solve Two-sided Multi-objective Synchronous Parallel Disassembly Line Balancing Problem
原文传递
导出
摘要 双碳背景下,工业制造领域朝着绿色、节能的方向转型,对废旧产品进行回收拆解以及再制造有利于推动高质量发展。论文针对大型复杂产品拆解过程中难以改变拆卸方向的问题,并综合考虑实际拆卸过程中任务之间存在的多种约束类型,研究了同步并行模式下的双边拆解线平衡问题(two-sided disassembly line balancing problem, TDLBP)。首先引入双边布局的拆解线模式,定义了与优先和或优先关系,建立了TDLBP的数学模型以优化产线布置、经济效益和安全环保三个方面共六个指标。然后提出了一种基于强化学习的群体进化算法,采用Q-learing利用所学知识选择迭代中的最佳算子,通过拥挤距离筛选Pareto解集,利用精英保留策略加速算法收敛,进而高效获取近似最优的拆解方案。最后通过求解小规模算例并对比分析,验证了所提出算法的有效性和优越性,并进行大规模案例的应用。 Under the background of dual carbon,the industrial manufacturing field is transforming in the direction of green and energy-saving.The recycling,disassembling and remanufacturing of waste products is conducive to promoting high-quality development.Aiming at the problem that it is difficult to change the disassembly direction during the disassembly process of large and complex products,and comprehensively considering the various constraints that exist between tasks in the actual disassembly process,the paper studies the two-sided disassembly line balancing problem(TDLBP)in the synchronous parallel mode.Firstly,the disassembly line mode of two-sided layout is introduced,and the relationship of and priority and or priority is defined,and the mathematical model of TDLBP is established to optimize the layout of the production line,economic benefits,safety and environmental protection with a total of six indicators.Then,a swarm evolutionary algorithm based on reinforcement learning is proposed.Q-learning is used to select the best operator in the iteration by using the knowledge learned,the Pareto solution set is screened by the crowding distance,and the elite retention strategy is used to accelerate the convergence of the algorithm,so as to efficiently obtain the approximate optimal disassembly scheme.Finally,the effectiveness and superiority of the proposed algorithm are verified by solving small-scale cases and comparative analysis,and the application of large-scale case is carried out.
作者 郭洪飞 陆鑫宇 任亚平 张超勇 李建庆 GUO Hongfei;LU Xinyu;REN Yaping;ZHANG Chaoyong;LI Jianqing(School of Intelligent Systems Science and Engineering,Jinan University,Zhuhai 519070;Institute of Physical Internet,Jinan University,Zhuhai 519070;School of Management,Jinan University,Guangzhou 510632;State Key Lab of Digital Manufacturing Equipment and Technology,Huazhong University of Science and Technology,Wuhan 430074;School of Computer Science and Engineering,Macao University of Science and Technology,Macao 999078)
出处 《机械工程学报》 EI CAS CSCD 北大核心 2023年第7期355-366,共12页 Journal of Mechanical Engineering
基金 国家自然科学基金(52205526,52205538) 科技部国家外国专家(G2021199026L) 广州市基础研究计划基础与应用基础研究(202201010284) 广东省研究生教育创新计划(82620516) 广州市创新领军团队(201909010006) 广东省“质量工程”建设(210308)资助项目。
关键词 双边拆解线 同步并行 强化学习 群体进化算法 PARETO two-sided disassembly line synchronous parallel reinforcement learning swarm evolutionary algorithm Pareto
  • 相关文献

参考文献6

二级参考文献37

  • 1郭伟祥,刘光复,刘志峰,黄海鸿.产品材料回收经济性分析与决策[J].农业机械学报,2006,37(12):150-154. 被引量:13
  • 2王峻峰,李世其,刘继红.面向绿色制造的产品选择拆卸技术研究[J].计算机集成制造系统,2007,13(6):1097-1102. 被引量:20
  • 3SRINIVASAN H,GADH R. A geometric algorithm for single selective disassembly using the wave propagation abstraction[J]. Computer Aided Design,1998,30(8):603-613.
  • 4GARCìA MA,LARRè A,LòPEZ B,et al. Reducing the complexity of geometric selective disassembly[C]// Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems,2000,Takamatsu,Japan,2000:1474-1479.
  • 5CHUNG Chulho,PENG Qingjin. An integrated approach to selective disassembly sequence planning[J]. Robotics and Computer Integrated Manufacturing,2005,21(4-5):475-485.
  • 6SMITH S S,CHEN Weihsiang. Rule-based recursive selective disassembly sequence planning for green design[J]. Advanced Engineering Informatics,2011,25:77-87.
  • 7KARA S,POMPRASITPOL P,KEBEMICK H. A selective disassembly methodology for end-of-life products[J]. Assembly Automation,2005,25(2):124-134.
  • 8DORIGO M,GAMBARDELLA L M. Ant colony system:A cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation,1997,1(1):53-66.
  • 9FAILLI F,DINI G. Ant colony systems in assembly planning:A new approach to sequence detection and optimization[C]//Proceedings of the 2nd CIRP International Seminar on Intelligent Computation in Manufacturing Engineering,2000,Toronto,Ontario,Canada:Elsevier Press,2000:227-232.
  • 10DEB K,PRATAP A,AGARWAL S. A fast and elitist multi-objective genetic algorithm:NSGA-II[J]. IEEE Transactions on Evolutionary Computation,2002,6(2): 182-197.

共引文献53

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部