Heuristic Solution Methods for the Selective Disassembly Sequencing Problem under Sequence-Dependent Costs

被引:2
|
作者
Jeunet, Jully [1 ]
Della Croce, Federico [2 ,3 ]
Salassa, Fabio [2 ]
机构
[1] PSL Res Univ, Univ Paris Dauphine, CNRS, UMR 7243, Pl Marechal de Lattre de Tassigny, F-75775 Paris 16, France
[2] Politecn Torino, Dipartimento Ingn Gest & Prod DIGEP, Corso Duca Abruzzi 24, I-10129 Turin, Italy
[3] CNR, IEIIT, Turin, Italy
来源
IFAC PAPERSONLINE | 2019年 / 52卷 / 13期
关键词
Disassembly; Product recovery; Maintenance; Greedy algorithms; Matheuristics; OPTIMUM; SEARCH;
D O I
10.1016/j.ifacol.2019.11.481
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码:1908 / 1913
页数:6
相关论文
共 50 条