IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i11p3220-3234.html
   My bibliography  Save this article

A fast branch, bound and remember algorithm for disassembly line balancing problem

Author

Listed:
  • Zixiang Li
  • Zeynel Abidin Çil
  • Süleyman Mete
  • Ibrahim Kucukkoc

Abstract

In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution method employs the memory-based dominance rule to eliminate the reduplicated sub-problems by storing all the searched sub-problems and to utilise cyclic best-first search strategy to obtain high-quality complete solutions fast. In this paper, minimising the number of stations is taken as the performance measure. The proposed methodology is tested on a set of 260 instances and compared with the mathematical model using CPLEX solver and five well-known metaheuristics. Computational results show that the proposed method is capable of obtaining the optimal solutions for all the tested instances with less than 0.1 seconds on average. Additionally, comparative study demonstrates that the proposed method is the state-of-the-art algorithm and outperforms the CPLEX solver and metaheuristics in terms of both solution quality and search speed aspects.

Suggested Citation

  • Zixiang Li & Zeynel Abidin Çil & Süleyman Mete & Ibrahim Kucukkoc, 2020. "A fast branch, bound and remember algorithm for disassembly line balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 58(11), pages 3220-3234, June.
    • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:11:p:3220-3234
    DOI: 10.1080/00207543.2019.1630774
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1630774
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2019.1630774?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Junyong Liang & Shunsheng Guo & Yunfei Zhang & Wenfang Liu & Shengwen Zhou, 2021. "Energy-Efficient Optimization of Two-Sided Disassembly Line Balance Considering Parallel Operation and Uncertain Using Multiobjective Flatworm Algorithm," Sustainability, MDPI, vol. 13(6), pages 1-23, March.
    2. 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.
    3. Santiago Valdés Ravelo, 2022. "Approximation algorithms for simple assembly line balancing problems," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 432-443, March.
    4. Çil, Zeynel Abidin & Öztop, Hande & Diri Kenger, Zülal & Kizilay, Damla, 2023. "Integrating distributed disassembly line balancing and vehicle routing problem in supply chain: Integer programming, constraint programming, and heuristic algorithms," International Journal of Production Economics, Elsevier, vol. 265(C).
    5. 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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:58:y:2020:i:11:p:3220-3234. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.