基于蟑螂算法的产品拆卸序列规划

Product disassembly sequence planning based on cockroach swarm optimization

文章为研究废弃产品的拆卸序列规划,首先建立了产品拆卸模型混合图,描述零部件之间的连接关系和优先关系,推导出可拆卸性条件;其次,通过几何推理生成产品可行的初始拆卸序列,建立目标函数并构建适合拆卸序列规划的蟑螂算法;依据初始拆卸序列和其他控制参数,结合蟑螂算法对拆卸序列进行优化得到最优解;最后,通过实例验证了该方法的可行性及高效性。

In order to optimize disassembly sequence for waste or malfunctioning products, a product disassem- bly hybrid graph model is established, which describes the connection and precedence relationships between the product parts. The disassembly condition is deduced based on the hybrid graph modal. Then, all the feasible disassembly sequences are obtained through the geometry inference metho＆ The target function is constituted and the cockroach swarm optimization algorithm which suits the disassembly sequence planning is constructed. Further, by inputting some disassembly sequences and other controlling parameters, the optimal valid disassembly sequence can be obtained based on the cockroach swarm optimization. Finally, a case study is given to illustrate the validity of the proposed method and prove that the cockroach swarm optimization is superior to the particle swarm optimization.