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 条
  • [21] Product cooperative disassembly sequence and task planning based on genetic algorithm
    Yongting Tian
    Xiufen Zhang
    Zehua Liu
    Xingyue Jiang
    Junfang Xue
    [J]. The International Journal of Advanced Manufacturing Technology, 2019, 105 : 2103 - 2120
  • [22] Parallel disassembly sequence planning for complex products based on genetic algorithm
    Zhang, Xiufen
    Yu, Gang
    Wang, Lei
    Sa, Rina
    [J]. Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2015, 27 (07): : 1327 - 1333
  • [23] An enhanced genetic algorithm for automated assembly planning
    Smith, GC
    Smith, SSF
    [J]. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2002, 18 (5-6) : 355 - 364
  • [24] A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
    Can B. Kalayci
    Olcay Polat
    Surendra M. Gupta
    [J]. Annals of Operations Research, 2016, 242 : 321 - 354
  • [25] A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
    Kalayci, Can B.
    Polat, Olcay
    Gupta, Surendra M.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2016, 242 (02) : 321 - 354
  • [26] Disassembly sequence plan generation using a branch-and-bound algorithm
    Güngör, A
    Gupta, SM
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (03) : 481 - 509
  • [27] Parallel disassembly sequence planning using improved ant colony algorithm
    Yufei Xing
    Dongmei Wu
    Ligang Qu
    [J]. The International Journal of Advanced Manufacturing Technology, 2021, 113 : 2327 - 2342
  • [28] Parallel disassembly sequence planning using improved ant colony algorithm
    Xing, Yufei
    Wu, Dongmei
    Qu, Ligang
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2021, 113 (7-8): : 2327 - 2342
  • [29] Disassembly Sequence Planning of Used Smartphone Based on Dual-population Genetic Algorithm
    Yin F.
    Du Z.
    Li L.
    Liang Z.
    An R.
    Wang R.
    Liu G.
    [J]. Li, Lin (ll@qust.edu.cn), 1600, Chinese Mechanical Engineering Society (57): : 226 - 235
  • [30] Optimizing the Product Locations in Automated Cube Storage Warehouse Using an Enhanced Genetic Algorithm
    Ha, Won Yong
    Cho, Gi Yang
    Han, Chung Sik
    Lee, Hojun
    [J]. ROBOT INTELLIGENCE TECHNOLOGY AND APPLICATIONS 6, 2022, 429 : 578 - 588