家电科技 ›› 2021, Vol. 0 ›› Issue (4): 34-38.doi: 10.19784/j.cnki.issn1672-0172.2021.04.005

• 论文 • 上一篇    下一篇

基于蚁群算法的废旧手机目标拆卸序列规划研究

王晓东1, 刘广阔1, 李鸿瑞1, 孙华栋1, 符永高2, 李林1   

  1. 1.青岛科技大学机电工程学院 山东青岛 266061;
    2.中国电器科学研究院股份有限公司 广东广州 510300
  • 出版日期:2021-08-01 发布日期:2021-08-09
  • 作者简介:王晓东,硕士。研究方向:绿色制造。地址:青岛科技大学机电工程学院。E-mail:1912748891@qq.com。
  • 基金资助:
    科技部重点研发计划子课题(2020YFB1713001)

Study on target disassemble sequence planning of waste mobile phone base on ant colony algorithm

WANG Xiaodong1, LIU Guangkuo1, LI Hongrui1, SUN Huadong1, FU Yonggao2, LI Lin1   

  1. 1. Qingdao University of Science and Technology College of Mechanical and Electrical Engineering Qingdao 266061;
    2. China Academy of Electrical Appliances Co., Ltd. Guangzhou 510300
  • Online:2021-08-01 Published:2021-08-09

摘要: 为解决废旧手机带来的环境污染和资源浪费问题,对废旧手机目标拆卸进行研究。采用有向图作为拆卸示意图,并制定拆卸模型,创新性的提出了用连接元胞数组表示零件之间的连接关系。针对目标拆卸序列长短不一的特点采用蚁群算法进行寻优,以单位时间产生的利润为优化目标,获得了最优或次优拆卸序列。最后,以华为P7手机为例验证了拆卸模型和应用于拆解序列规划的蚁群算法的可行性。

关键词: 废旧手机, 目标拆卸, 有向图, 蚁群算法

Abstract: To solve the problems of environmental pollution and resource waste caused by wasted mobile phones, the target disassembly of wasted mobile phones has been studied. Using a directed graph as a disassembly schematic diagram, and formulating a disassembly model, innovatively proposed to use a connection cell array to represent the connection relationship between parts. The ant colony algorithm is used to optimize the target disassembly sequence due to the different lengths. The profit generated per unit time is used as the optimization target, and the optimal or suboptimal disassembly sequence is obtained. Finally, a Huawei P7 mobile phone was used as an example to verify the feasibility of the disassembly model and the ant colony algorithm used in disassembly sequence planning.

Key words: Waste mobile phones, Target disassembly, Improved digraph, Ant colony algorithm

中图分类号: