IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i6p816-d1354766.html
   My bibliography  Save this article

An Improved Moth-Flame Algorithm for Human–Robot Collaborative Parallel Disassembly Line Balancing Problem

Author

Listed:
  • Qi Zhang

    (College of Information Engineering, Shenyang University of Chemical Technology, Shenyang 110142, China)

  • Bin Xu

    (College of Information Engineering, Shenyang University of Chemical Technology, Shenyang 110142, China)

  • Man Yao

    (School of Basic Medicine, He University, Shenyang 110163, China)

  • Jiacun Wang

    (Department of Computer Science and Software Engineering, Monmouth University, West Long Branch, NJ 07764, USA)

  • Xiwang Guo

    (College of Information and Control Engineering, Liaoning Petrochemical University, Fushun 113001, China)

  • Shujin Qin

    (College of Economics and Management, Shangqiu Normal University, Shangqiu 476000, China)

  • Liang Qi

    (Department of Computer Science and Technology, Shandong University of Science and Technology, Qingdao 266590, China)

  • Fayang Lu

    (College of Information and Control Engineering, Liaoning Petrochemical University, Fushun 113001, China)

Abstract

In the context of sustainable development strategies, the recycling of discarded products has become increasingly important with the development of electronic technology. Choosing the human–robot collaborative disassembly mode is the key to optimizing the disassembly process and ensuring maximum efficiency and benefits. To solve the problem of human–robot cooperative parallel dismantling line balance, a mixed integer programming model is established and verified by CPLEX. An improved Moth-Flame Optimization (IMFO) algorithm is proposed to speed up convergence and optimize the disassembly process of various products. The effectiveness of IMFO is evaluated through multiple cases and compared with other heuristics. The results of these comparisons can provide insight into whether IMFO is the most appropriate algorithm for the problem presented.

Suggested Citation

  • Qi Zhang & Bin Xu & Man Yao & Jiacun Wang & Xiwang Guo & Shujin Qin & Liang Qi & Fayang Lu, 2024. "An Improved Moth-Flame Algorithm for Human–Robot Collaborative Parallel Disassembly Line Balancing Problem," Mathematics, MDPI, vol. 12(6), pages 1-17, March.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:6:p:816-:d:1354766
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/6/816/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/6/816/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Seda Hezer & Yakup Kara, 2015. "A network-based shortest route model for parallel disassembly line balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1849-1865, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peng Hu & Feng Chu & Yunfei Fang & Peng Wu, 2022. "Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1423-1446, July.
    2. Jianhua Cao & Xuhui Xia & Lei Wang & Zelin Zhang & Xiang Liu, 2019. "A Novel Multi-Efficiency Optimization Method for Disassembly Line Balancing Problem," Sustainability, MDPI, vol. 11(24), pages 1-16, December.
    3. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    4. Liu, Kanglin & Zhang, Zhi-Hai, 2018. "Capacitated disassembly scheduling under stochastic yield and demand," European Journal of Operational Research, Elsevier, vol. 269(1), pages 244-257.
    5. Fang, Yilin & Liu, Quan & Li, Miqing & Laili, Yuanjun & Pham, Duc Truong, 2019. "Evolutionary many-objective optimization for mixed-model disassembly line balancing with multi-robotic workstations," European Journal of Operational Research, Elsevier, vol. 276(1), pages 160-174.
    6. Süleyman Mete & Faruk Serin & Zeynel Abidin Çil & Erkan Çelik & Eren Özceylan, 2023. "A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time," Annals of Operations Research, Springer, vol. 321(1), pages 371-408, February.
    7. Lixia Zhu & Zeqiang Zhang & Yi Wang & Ning Cai, 2020. "On the end-of-life state oriented multi-objective disassembly line balancing problem," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1403-1428, August.
    8. Ziyan Zhao & Pengkai Xiao & Jiacun Wang & Shixin Liu & Xiwang Guo & Shujin Qin & Ying Tang, 2023. "Improved Brain-Storm Optimizer for Disassembly Line Balancing Problems Considering Hazardous Components and Task Switching Time," Mathematics, MDPI, vol. 12(1), pages 1-19, December.
    9. Hu, Peng & Chu, Feng & Dolgui, Alexandre & Chu, Chengbin & Liu, Ming, 2024. "Integrated multi-product reverse supply chain design and disassembly line balancing under uncertainty," Omega, Elsevier, vol. 126(C).
    10. Ömer Faruk Yılmaz & Büşra Yazıcı, 2022. "Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches," Annals of Operations Research, Springer, vol. 319(2), pages 1793-1843, December.
    11. Diri Kenger, Zülal & Koç, Çağrı & Özceylan, Eren, 2021. "Integrated disassembly line balancing and routing problem with mobile additive manufacturing," International Journal of Production Economics, Elsevier, vol. 235(C).
    12. Tian, Xiaoyu & Zhang, Zhi-Hai, 2019. "Capacitated disassembly scheduling and pricing of returned products with price-dependent yield," Omega, Elsevier, vol. 84(C), pages 160-174.
    13. Yusha Zhou & Xiuping Guo & Dong Li, 2022. "A dynamic programming approach to a multi-objective disassembly line balancing problem," Annals of Operations Research, Springer, vol. 311(2), pages 921-944, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:6:p:816-:d:1354766. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.