Automated Disassembly Sequence Prediction for Industry 4.0 Using Enhanced Genetic Algorithm

被引:13
|
作者
Gulivindala, Anil Kumar [1 ]
Bahubalendruni, M. V. A. Raju [1 ]
Chandrasekar, R. [1 ,2 ]
Ahmed, Ejaz [2 ]
Abidi, Mustufa Haider [3 ]
Al-Ahmari, Abdulrahman [4 ]
机构
[1] Natl Inst Technol, Dept Mech Engn, Ind Robot & Mfg Automat Lab, Kariakal 609609, India
[2] Natl Inst Technol, Dept Comp Sci Engn, Kariakal 609609, India
[3] King Saud Univ, Adv Mfg Inst, Raytheon Chair Syst Engn, Riyadh 11421, Saudi Arabia
[4] King Saud Univ, Coll Engn, Ind Engn Dept, Riyadh 11421, Saudi Arabia
来源
CMC-COMPUTERS MATERIALS & CONTINUA | 2021年 / 69卷 / 02期
关键词
Automation; internet of things; disassembly sequence planning; priori cross over operator; enhanced GA; disassembly predicates; OPTIMIZATION;
D O I
10.32604/cmc.2021.018014
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The evolution of Industry 4.0 made it essential to adopt the Internet of Things (IoT) and Cloud Computing (CC) technologies to perform activities in the new age of manufacturing. These technologies enable collecting, storing, and retrieving essential information from the manufacturing stage. Data collected at sites are shared with others where execution automatedly occurs. The obtained information must be validated at manufacturing to avoid undesirable data losses during the de-manufacturing process. However, information sharing from the assembly level at the manufacturing stage to disassembly at the product end-of-life state is a major concern. The current research validates the information optimally to offer a minimum set of activities to complete the disassembly process. An optimal disassembly sequence plan (DSP) can possess valid information to organize the necessary actions in manufacturing. However, finding an optimal DSP is complex because of its combinatorial nature. The genetic algorithm (GA) is a widely preferred artificial intelligence (AI) algorithm to obtain a near-optimal solution for the DSP problem. The converging nature at local optima is a limitation in the traditional GA. This study improvised the GA workability by integrating with the proposed priori crossover operator. An optimality function is defined to reduce disassembly effort by considering directional changes as parameters. The enhanced GA method is tested on a real-time product to evaluate the performance. The obtained results reveal that diversity control depends on the operators employed in the disassembly attributes. The proposed method's solution can be stored in the cloud and shared through IoT devices for effective resource allocation and disassembly for maximum recovery of the product. The effectiveness of the proposed enhanced GA method is determined by making a comparative assessment with traditional GA and other AI methods at different population sizes.
引用
收藏
页码:2531 / 2548
页数:18
相关论文
共 50 条
  • [1] AN ONLINE GENETIC ALGORITHM FOR AUTOMATED DISASSEMBLY SEQUENCE GENERATION
    ElSayed, A.
    Kongar, E.
    Gupta, S. M.
    Sobh, T.
    [J]. PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2011, VOL 3, PTS A AND B, 2012, : 657 - 664
  • [2] Intelligent Planning Using Genetic Algorithm for Automated Disassembly
    Parsa, Soran
    Saadat, Mozafar
    [J]. ADVANCES IN MANUFACTURING TECHNOLOGY XXXII, 2018, 8 : 189 - 194
  • [3] Industry 4.0 - automated line balancing in the factory of the future - by using a software solution based on the genetic algorithm
    Schlichting, Silvan
    Grube, Mathias
    [J]. ZWF Zeitschrift fuer Wirtschaftlichen Fabrikbetrieb, 2015, 110 (03): : 154 - 157
  • [4] A genetic algorithm for product disassembly sequence planning
    Wang Hui
    Xiang Dong
    Duan Guanghong
    [J]. NEUROCOMPUTING, 2008, 71 (13-15) : 2720 - 2726
  • [5] Genetic algorithm for product disassembly sequence planning
    Wang Hui
    Xiang Dong
    Duan Guanghong
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF INTELLIGENT SYSTEMS, 2006, : 448 - +
  • [6] Using genetic/simulated annealing algorithm to solve disassembly sequence planning
    Wu Hao
    Zuo Hongfu
    [J]. JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2009, 20 (04) : 906 - 912
  • [7] Using genetic/simulated annealing algorithm to solve disassembly sequence planning
    Wu Hao & Zuo Hongfu Coll.of Civil Aviation
    [J]. Journal of Systems Engineering and Electronics, 2009, 20 (04) : 906 - 912
  • [8] Disassembly sequence planning based on a genetic algorithm
    Kheder, Maroua
    Trigui, Moez
    Aifaoui, Nizar
    [J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 2015, 229 (12) : 2281 - 2290
  • [9] Robotic disassembly sequence planning using enhanced discrete bees algorithm in remanufacturing
    Liu, Jiayi
    Zhou, Zude
    Duc Truong Pham
    Xu, Wenjun
    Ji, Chunqian
    Liu, Quan
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (09) : 3134 - 3151
  • [10] Disassembly Sequence Planning Based on Improved Genetic Algorithm
    Chen, JiaZhao
    Zhang, YuXiang
    Liao, HaiTao
    [J]. ADVANCES IN MULTIMEDIA, SOFTWARE ENGINEERING AND COMPUTING, VOL 2, 2011, 129 : 471 - 476