Publishing Service

Polishing & Checking

Journal of Zhejiang University SCIENCE A

ISSN 1673-565X(Print), 1862-1775(Online), Monthly

A novel approach for parallel disassembly design based on a hybrid fuzzy-time model

Abstract: This paper investigates the problem of parallel disassembly with the consideration of fuzziness. A novel approach is proposed based on optimized dispatching for parallel disassembly in which disassembly time is characterized by the fuzzy sets due to inevitable uncertainties. The proposed approach consists of three parts: in the first part, the fuzzy time-based dispatching disassembly process model is established; in the second part, the boundary conditions of the fuzzy time and the disassembly are derived, and the components’ disassembly order and available stations are encoded together to find the optimal disassembly path; in the final part, the approach is optimized by using genetic algorithm (GA) to minimize the total time and cost, and the solution is compared with other algorithms. Finally, a case study for a hydraulic press disassembly is presented to verify the effectiveness and feasibility of the proposed approach.

Key words: Disassembly sequence planning, Dispatching disassembly process, Fuzzy time, Genetic algorithm (GA)

Chinese Summary  <29> 一种基于混合模糊模型的新型并行拆卸设计 方法

目的:解决考虑模糊环境条件影响下的复杂机械产品并行拆卸路径规划问题,并给出成本和模糊时间最优的拆卸方案。
创新点:建立混合模糊模型,引入三角模糊数表示拆卸工序加工时间,提高拆卸路径规划的环境适应性;采用并行加工方法,尽可能地提高生产资源利用效率,缩短加工时间和降低加工成本;使用混合编码方式,用同一条染色体表示拆卸工序和工位信息,简化模型表达和运算;在遗传算法中引入高斯变异方法,提高算法的收敛速度。
方法:1. 引入一个包含N个工位和L个零部件的拆卸序列规划问题,提出混合模糊拆卸模型实现对此问题的数学描述;2. 采用包含高斯变异算子的遗传算法,对结果进行优化计算,以得到最短的模糊加工时间和加工成本;3. 将本文所述方法的计算结果与快速搜索随机树算法的运行结果进行比较。
结论:在算法分别迭代50次、100次和150次的情况下,本文所述方法得到的最优解均优于快速搜索随机树算法的解,并且运行时间均短于快速搜索随机树算法。

关键词组:并行拆卸;序列规划;模糊时间;遗传算法


Share this article to: More

Go to Contents

References:

<Show All>

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





DOI:

10.1631/jzus.A1500155

CLC number:

TB491

Download Full Text:

Click Here

Downloaded:

2381

Download summary:

<Click Here> 

Downloaded:

1991

Clicked:

4500

Cited:

3

On-line Access:

2015-09-03

Received:

2015-05-29

Revision Accepted:

2015-08-21

Crosschecked:

2015-08-25

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952276; Fax: +86-571-87952331; E-mail: jzus@zju.edu.cn
Copyright © 2000~ Journal of Zhejiang University-SCIENCE