An improved multi-objective discrete bees algorithm for robotic disassembly line balancing problem in remanufacturing

Liu, Jiayi; Zhou, Zude; Pham, Duc Truong; Xu, Wenjun; Yan, Junwei; Liu, Aiming; Ji, Chunqian; Liu, Quan

doi:10.1007/s00170-018-2183-7

Cited by 102 publications

(29 citation statements)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(11) Since the key and the shaft are tightly connected, during the actual disassembly process may need auxiliary. This paper assumes flat pliers use can achieve smooth disassembly; (12) This article is a fixed workstation disassembly, and the workstation has no idle time.…”

Section: Research Problem and Methodsmentioning

confidence: 99%

Optimization of Three-Dimensional Disassembly Line with Green and Economic Objectives Using I-ACO

Rahali¹,

Zeghlache²,

Benalia³

et al. 2018

AMA_C

View full text Add to dashboard Cite

Although the problem of disassembly line balance has been studied in depth, there are fewer starting points from green, economy and position as the basis for path planning. This paper considers the disassembly path from the three perspective. For green perspective, even if the product doesn't have the economic value, the toxic solid and liquid must be excluded; For economic, the re-utilize value of the disassembled object is fewer, the complete disassembly will abandon; Furthermore, the three-dimensional information is difficult to obtain. In this paper, the reducer drawn by Solidworks to obtain the position and mass, and then the improved R-AOG (Rectangle-AND/OR Graph) used to represent the directional relationship of large-scale component disassembly. And use R-AOG de-sign Allowedk, Lastly, compare I-ACO with other ACO to prove the efficiency and quality, and ap-plies it to the reducer disassembly planning to obtain the optimal disassembly path, these experimental results help company to better plan the disassembly line, reduce the maintenance threshold of the reducer, and also beneficial to build automated disassembly lines.

show abstract

Section: Research Problem and Methodsmentioning

confidence: 99%

Optimization of Three-Dimensional Disassembly Line with Green and Economic Objectives Using I-ACO

Rahali¹,

Zeghlache²,

Benalia³

et al. 2018

AMA_C

View full text Add to dashboard Cite

show abstract

“…(10) Before the algorithm runs, disassembly tools have prepared: T1Wrench, TScrewdriver, T2Wrench, TPlier, TClamp, THammer; (11) Since the key and the shaft are tightly connected, during the actual disassembly process may need auxiliary. This paper assumes flat pliers use can achieve smooth disassembly; (12) This article is a fixed workstation disassembly, and the workstation has no idle time.…”

Section: Research Problem and Methodsmentioning

confidence: 99%

“…At present, the research on the disassembly line objective function focuses on minimum workstation, the minimum idle time of workstation, workstation disassembly smooth index, minimum disassembly direction changes, and acquisition of high-value parts [12][13][14][15][16][17][18][19]. The research target of this paper is optimization the three-dimensional disassembly line with green and economic objectives.…”

Section: Mathematical Modelmentioning

confidence: 99%

Sliding Mode Control Based on Backstepping Approach for a Double Star Induction Motor (DSIM)

Rahali¹,

Zeghlache²,

Benalia³

et al. 2018

AMA_C

View full text Add to dashboard Cite

Although the problem of disassembly line balance has been studied in depth, there are fewer starting points from green, economy and position as the basis for path planning. This paper considers the disassembly path from the three perspective. For green perspective, even if the product doesn't have the economic value, the toxic solid and liquid must be excluded; For economic, the re-utilize value of the disassembled object is fewer, the complete disassembly will abandon; Furthermore, the three-dimensional information is difficult to obtain. In this paper, the reducer drawn by Solidworks to obtain the position and mass, and then the improved R-AOG (Rectangle-AND/OR Graph) used to represent the directional relationship of large-scale component disassembly. And use R-AOG design Allowedk, Lastly, compare I-ACO with other ACO to prove the efficiency and quality, and applies it to the reducer disassembly planning to obtain the optimal disassembly path, these experimental results help company to better plan the disassembly line, reduce the maintenance threshold of the reducer, and also beneficial to build automated disassembly lines.

show abstract

“…Nowadays, metaheuristic algorithms are generally preferred [7]. Some prominent studies when looking at the applications in recent years; disassembly sequence planning with a hybrid method integrating fuzzy simulation and arti cial bee colony [8], exible process planning with a genetic algorithm for Product Recovery Optimization [9], a disassembly sequence planning with multiobjective ant colony algorithm for CNC machine tools [10], a tensorial memetic algorithm for disassembly sequence planning in product refurbishment [11], planning for disassembly using discrete arti cial bee colony [12], a disassembly sequence planning with genetic algorithm for hydropower station [7], robotic disassembly sequence planning using discrete bees algorithm [13], an improved multi-objective discrete bees algorithm for robotic disassembly [14], collaborative optimisation of robotic disassembly sequence planning using improved discrete bees algorithm [15].…”

Section: Introductionmentioning

confidence: 99%

Using Online Bees Algorithm for Real-time Permutation Flow Shop Problem in Car Disassembly Line

Şahin¹,

Wang²

2021

Preprint

View full text Add to dashboard Cite

The automobile disassembly line is a typical permutation flow shop problem (PFSP). In the automobile disassembly line, the goal of the research is to minimize the completion time of scheduling with optimizing the disassembly order of vehicles. However, disassembly time was uncertain at the initial stage as the consuming time of cars’ specific sequence only could be roughly estimated, which make the PFSP in automobile disassembly line unlike the traditional ones. In this study, the real-time PFSP problem in automobile disassembly line was defined and well solved with the proposed online Bees Algorithm (O-BA). The algorithm has been prepared in Matlab/Simulink to work in real-time. Time consumed by each component of each vehicle was roughly estimated based on engineer’s experience. First optimisation was carried out to decide the disassembly order of vehicles to be disassembled. When each component was disassembled, the real consuming time value was updated with the detecting system which was realized in Simulink. Then the O-BA was activated and created the new solution for the disassembly order of vehicles which were still not entering the disassembly line. The proposed O-BA algorithm has an online structure and conducted the optimisation with distinguishing whether the vehicles to be disassembled were entering the disassembly line. The result shows the O-BA with the detecting system was succeeded in realizing real-time PFSP in the disassembly line. Moreover, the method proposed in this study was suitable for solving the same kind of real-time PFSP in the assembly line or disassembly line.

show abstract

An improved multi-objective discrete bees algorithm for robotic disassembly line balancing problem in remanufacturing

Cited by 102 publications

References 58 publications

Optimization of Three-Dimensional Disassembly Line with Green and Economic Objectives Using I-ACO

Optimization of Three-Dimensional Disassembly Line with Green and Economic Objectives Using I-ACO

Sliding Mode Control Based on Backstepping Approach for a Double Star Induction Motor (DSIM)

Using Online Bees Algorithm for Real-time Permutation Flow Shop Problem in Car Disassembly Line

Contact Info

Product

Resources

About