摘要
为解决废旧手机带来的多种环境与资源的问题,本文主要对废旧手机的目标拆解序列规划进行生成优化研究。针对手机零件同时与多个零件相连接的特点,采用适用于手机拆解的有向图拆解模型生成拆解序列,应用连接元胞数组表示连接关系,并依此计算拆解时间,并以拆解时间和拆解利润作为拆解序列的评价指标,用蚁群算法优化拆解序列。同时,以华为P7手机为例进行计算寻优。研究结果表明,有向图拆解模型更适用于手机拆解,与传统拆解模型相比,有向图拆解模型在拆解时间上缩短了23.0%,在单位时间内产生的利润提高了25.7%。该研究提高了废旧手机拆解的拆解利润和拆解效率,为废旧手机拆解商业化提供了理论基础。
To solve the problems of various environments and resources brought about by the increasing number of used mobile phones, the research on the target disassembly sequence planning of used mobile phones is helpful to solve this problem. In view of the characteristics that mobile phone parts are often connected with multiple parts at the same time, a directed graph disassembly model suitable for mobile phone disassembly is proposed based on the directed graph. The connection cell array is used to represent the connection relationship, and ti is used to calculate the disassembly time. Taking the disassembly time and disassembly profit as the evaluation indicators of the disassembly sequence, the ant colony algorithm is used to optimize the disassembly sequence. Finally, taking Huawei P7 mobile phone as an example, the calculation optimization is carried out to verify the feasibility of the directed graph disassembly model and the connection cell array. The results show that the directed graph disassembly model is faster than the traditional disassembly model in disassembly time. It has been shortened by 23.0%, and the revenue per unit time has been increased by 25.7%, indicating that the directed graph disassembly model is more suitable for the disassembly of used mobile phones.
作者
王晓东
刘广阔
尹凤福
储涛
WANG Xiaodong;LIU Guangkuo;YIN Fengfu;CHU Tao(College of Electromechanical Engineering,Qingdao University of Science and Technology,Qingdao 266061,China;School of Business,Qingdao University,Qingdao 266071,China)
出处
《青岛大学学报（工程技术版）》
CAS
2022年第3期23-31,共9页
Journal of Qingdao University(Engineering & Technology Edition)
基金
科技部重点研发计划子课题(2020YFB1713001)。
关键词
废旧手机
有向图拆解模型
连接元胞数组
蚁群算法
used mobile phones
directed graph disassembly model
connection cell array
ant colony algorithm
