Heuristic Solution Methods for the Selective Disassembly Sequencing Problem under Sequence-Dependent Costs. Issue 13 (2019)

• Record Type: Journal Article
• Authors: Jeunet, Jully; Croce, Federico Della; Salassa, Fabio
• Is Part Of: IFAC-PapersOnLine. Volume 52:Issue 13(2019)
• Page Start: 1908
• Page End: 1913
• Publication Date: 2019
• Subjects: Disassembly -- Product recovery -- Maintenance -- Greedy algorithms -- Matheuristics; Automatic control -- Periodicals; 629.805
• DOI: 10.1016/j.ifacol.2019.11.481
• Languages: English
• ISSNs: 2405-8963

Abstract

Abstract: This paper addresses the disassembly sequencing problem for selective and sequential disassembly under sequence-dependent costs. As optimal formulations fail to handle real-world cases, we develop a randomized greedy algorithm and a matheuristic to solve efficiently medium to large-sized instances. Contrary to metaheuristics that have been widely adopted to solve this problem, our approach only needs a very few number of parameters to be set and proved to be robust with respect to their values.