Disassembly sequence planning of used mobile phones based on multi-population genetic algorithm

Journal Information

J. Hefei Univ. Tech. (Nat. Sci.), Apr.2023, Vol.46 No.4: 438-446

DOI: 10.3969/j.issn.1003-5060.2023.04.002

Authors

YIN Fengfu $ ^{1} $, LIU Guangkuo $ ^{1} $, WANG Xiaodong $ ^{1} $, LI Xinyu $ ^{2} $, LI Lin $ ^{1} $

(1. School of Electromechanical Engineering, Qingdao University of Science and Technology, Qingdao 266061, China; 2. School of Mechanical Engineering, Hefei University of Technology, Hefei 230009, China)

Abstract and Keywords

Abstract: In order to solve the problem of the environmental pollution caused by used smartphones, and efficiently solve the complete disassembly sequences of used smartphones, a multi-population genetic algorithm is proposed for the complete disassembly of used mobile phones. According to the connection characteristics of used smartphones, the disassembly mixed graph model of used smartphones is established to describe the constraint relations while considering the fastener connection relations. A feasibility assessment method for disassembly is proposed, the mathematical model of multi-objective optimization of disassembly time, disassembly profit and disassembly energy consumption is established, and the multi-population genetic algorithm is used for optimization analysis. Taking Xiaomi Mi 5 mobile phone as an example, the three weight coefficients are used to prove that compared with manual experience disassembly, the disassembly profit of each phone after optimization is increased by 0.3035 yuan, the disassembly time is shortened by 30 s, and the labor energy consumption of disassembly is reduced by 0.272 J. In the case of multiple populations, the convergence speed is faster than that of a single population. Meanwhile, compared with parallel disassembly, small precision electronic products such as used smartphones are more suitable for serial disassembly.

Keywords: used smartphone; disassembly model; multi-population genetic algorithm; sequence planning

作者信息

尹凤福 $ ^{1} $，刘广阔 $ ^{1} $，王晓东 $ ^{1} $，李新宇 $ ^{2} $，李林 $ ^{1} $

(1. 青岛科技大学机电工程学院，山东青岛 266061；2. 合肥工业大学机械工程学院，安徽合肥 230009)

摘要和关键词

摘要: 为解决废旧智能手机对环境的污染问题,高效率求解废旧智能手机完全拆卸序列最优方案,文章针对废旧手机完全拆卸提出一种多种群遗传算法。根据废旧智能手机的连接特点,建立废旧智能手机拆卸混合图模型,并利用该模型描述约束关系,同时考虑紧固件的连接关系;提出一种拆卸可行性评估方法,建立拆卸时间、拆卸利润、拆卸能耗等多目标优化数学模型,并利用多种群遗传算法进行优化分析;以“小米5”手机为例验证提出算法的可行性,并分析多目标不同权重系数对生成结果的影响。结果表明:与人工经验拆卸相比,优化后拆卸手机成本利润提高0.3035元/台,拆卸时间缩短30s/台,拆卸人工能耗减少0.272J;多种群比单种群收敛速度更快;相较于并行拆解,废旧智能手机等小型精密电子产品更适合于串行序列拆解。

关键词: 废旧智能手机；拆卸模型；多种群遗传算法；序列规划

Funding

科技部重点研发计划资助项目（2020YFB1713004）

合肥工业大学学报(自然科学版)

Navigation