YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Multi-Objective Evolutionary Algorithm With Machine Learning and Local Search for an Energy-Efficient Disassembly Line Balancing Problem in Remanufacturing

    Source: Journal of Manufacturing Science and Engineering:;2023:;volume( 145 ):;issue: 005::page 51002-1
    Author:
    Tian, Guangdong
    ,
    Zhang, Cheng
    ,
    Zhang, Xuesong
    ,
    Feng, Yixiong
    ,
    Yuan, Gang
    ,
    Peng, Tao
    ,
    Pham, Duc Truong
    DOI: 10.1115/1.4056573
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: Product disassembly is a vital element of recycling and remanufacturing processes. The disassembly line balancing problem (DLBP), i.e., how to assign a set of tasks to a disassembly workstation, is crucial for a product disassembly process. Based on the importance of energy efficiency in product disassembly and the trend toward green remanufacturing, this study proposes an optimization model for a multi-objective disassembly line balancing problem that aims to minimize the idle rate, smoothness, cost, and energy consumption during the disassembly operation. Due to the complex nature of the optimization problem, a discrete whale optimization algorithm is proposed in this study, which is developed as an extension of the whale optimization algorithm. To enable the algorithm to solve discrete optimization problems, we propose coding and decoding methods that combine the features of DLBP. First of all, the initial disassembly solution is obtained by using K-means clustering to speed up the exchange of individual information. After that, new methods for updating disassembly sequences are developed, in which a local search strategy is introduced to increase the accuracy of the algorithm. Finally, the algorithm is used to solve the disassembly problem of a worm reducer and the first 12 feasible task allocation options in the Pareto frontier are shown. A comparison with typically existing algorithms confirms the high performance of the proposed whale optimization algorithm, which has a good balance of solution quality and efficiency.
    • Download: (743.4Kb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Multi-Objective Evolutionary Algorithm With Machine Learning and Local Search for an Energy-Efficient Disassembly Line Balancing Problem in Remanufacturing

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/4292275
    Collections
    • Journal of Manufacturing Science and Engineering

    Show full item record

    contributor authorTian, Guangdong
    contributor authorZhang, Cheng
    contributor authorZhang, Xuesong
    contributor authorFeng, Yixiong
    contributor authorYuan, Gang
    contributor authorPeng, Tao
    contributor authorPham, Duc Truong
    date accessioned2023-08-16T18:39:07Z
    date available2023-08-16T18:39:07Z
    date copyright1/19/2023 12:00:00 AM
    date issued2023
    identifier issn1087-1357
    identifier othermanu_145_5_051002.pdf
    identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4292275
    description abstractProduct disassembly is a vital element of recycling and remanufacturing processes. The disassembly line balancing problem (DLBP), i.e., how to assign a set of tasks to a disassembly workstation, is crucial for a product disassembly process. Based on the importance of energy efficiency in product disassembly and the trend toward green remanufacturing, this study proposes an optimization model for a multi-objective disassembly line balancing problem that aims to minimize the idle rate, smoothness, cost, and energy consumption during the disassembly operation. Due to the complex nature of the optimization problem, a discrete whale optimization algorithm is proposed in this study, which is developed as an extension of the whale optimization algorithm. To enable the algorithm to solve discrete optimization problems, we propose coding and decoding methods that combine the features of DLBP. First of all, the initial disassembly solution is obtained by using K-means clustering to speed up the exchange of individual information. After that, new methods for updating disassembly sequences are developed, in which a local search strategy is introduced to increase the accuracy of the algorithm. Finally, the algorithm is used to solve the disassembly problem of a worm reducer and the first 12 feasible task allocation options in the Pareto frontier are shown. A comparison with typically existing algorithms confirms the high performance of the proposed whale optimization algorithm, which has a good balance of solution quality and efficiency.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleMulti-Objective Evolutionary Algorithm With Machine Learning and Local Search for an Energy-Efficient Disassembly Line Balancing Problem in Remanufacturing
    typeJournal Paper
    journal volume145
    journal issue5
    journal titleJournal of Manufacturing Science and Engineering
    identifier doi10.1115/1.4056573
    journal fristpage51002-1
    journal lastpage51002-12
    page12
    treeJournal of Manufacturing Science and Engineering:;2023:;volume( 145 ):;issue: 005
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian