An Online Genetic Algorithm for Automated Disassembly Sequence Generation

In this study, we propose an intelligent automated disassembly cell for online (real time) selective disassembly. The cell is composed of an industrial robotic manipulator, a camera, range-sensing and component segmentation visual algorithms. The cell prototype allows for robotic sensory-driven disassembly under uncertainty. An online genetic algorithm model for selective disassembly is also proposed for optimal and near/optimal disassembly sequencing.

Download Full-text

Model of mobility state of parts: The automation of feasibility test in disassembly sequence generation

Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science ◽

10.1177/0954406216654196 ◽

2016 ◽

Vol 231 (20) ◽

pp. 3702-3714 ◽

Cited By ~ 2

Author(s):

Louisa Issaoui ◽

Nizar Aifaoui ◽

Abdelmajid Benamara

Keyword(s):

Research Subject ◽

Design Models ◽

Computer Aid ◽

Sequence Generation ◽

Disassembly Sequence ◽

Mobility Matrix ◽

Design Mechanism ◽

Selective Disassembly ◽

Feasibility Test ◽

Disassembly Sequencing

Disassembly sequencing is a concurrent research subject in design for life-cycle. Many past and recent researches are made to give practical methods for disassembly sequencing. The problem of assembly information’s modeling is one of the important sub-problems of disassembly simulation. The problem includes connection determination, disassembly direction identification, and part mobility state definition. In the present paper, the authors propose a new representation model of disassembly directions, starting from geometric and assembly data of computer aid design models. This model is based on a mobility matrix definition for every part. This matrix is also called disassembly direction matrix. The model gives information about the mobility state of a part during disassembly sequencing by updating its mobility matrix. Mobility state data are used in a practical computing of disassembly sequence feasibility. In this paper, theoretical explication of this modeling is given and validated by computational results. In the validation section, the model is applied to a computer aid design mechanism using a selective disassembly.

Download Full-text

A Heuristic Approach for Disassembly Sequencing Problem for Robotic Disassembly Operations

Prototyping of Robotic Systems - Advances in Computational Intelligence and Robotics ◽

10.4018/978-1-4666-0176-5.ch015 ◽

2012 ◽

pp. 438-447

Author(s):

Ahmed ElSayed ◽

Elif A. Kongar ◽

Surendra M. Gupta

Keyword(s):

Genetic Algorithm ◽

Value Added ◽

Recovery Process ◽

Electronic Products ◽

Sequencing Problem ◽

Material Recovery ◽

Disassembly Sequence ◽

Robotic Disassembly ◽

Efficient Recovery ◽

Disassembly Sequencing

Electronic products enter the waste stream rapidly due to technological enhancements. Their parts and material recovery involve significant economic and environmental gain. To regain the value added to such products a certain level of disassembly may be required. Disassembly operations are often expensive and the complexity of determining the best disassembly sequence increases as the number of parts in a product grows. Therefore, it is necessary to develop methodologies for obtaining optimal or near optimal disassembly sequences to ensure efficient recovery process. To that end, this chapter introduces a Genetic Algorithm based methodology to develop disassembly sequencing for end-of-life products. A numerical example is presented to provide and demonstrate better understating and functionality of the algorithm.

Download Full-text

Automated Disassembly Sequence Prediction for Industry 4.0 Using Enhanced Genetic Algorithm

Computers Materials & Continua ◽

10.32604/cmc.2021.018014 ◽

2021 ◽

Vol 69 (2) ◽

pp. 2531-2548

Author(s):

Anil Kumar Gulivindala ◽

M. V. A. Raju Bahubalendruni ◽

R. Chandrasekar ◽

Ejaz Ahmed ◽

Mustufa Haider Abidi ◽

...

Keyword(s):

Genetic Algorithm ◽

Industry 4.0 ◽

Sequence Prediction ◽

Disassembly Sequence ◽

Automated Disassembly

Download Full-text

Research on Disassembly Sequence Planning in DFD

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.516-517.1865 ◽

2012 ◽

Vol 516-517 ◽

pp. 1865-1869

Author(s):

Yuan Zheng Yu

Keyword(s):

Software Development ◽

Heuristic Algorithm ◽

Top Down ◽

Disassembly Sequence Planning ◽

Sequence Generation ◽

Mapping Sequence ◽

Disassembly Sequence ◽

Planning Procedure ◽

Construction Model ◽

Disassembly Sequencing

The problems of automatic disassembly direction computation and disassembly sequencing must be solved in DFD. The computation rules have been set based on freedom intersection. Applying constraints elimination and assembly construction mapping, sequence generation has been realized by heuristic algorithm. To simplify the planning procedure, a modulized construction model has been developed for top-down computation. The principle could be applied for CAD software development in DFD.

Download Full-text