Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm

Disassembly planning is an effective way to recycle valuable parts or materials from end-of-life products. Due to the parts are easily affected by some unpredictable factors in the real disassembly process (such as defective parts and human factors), there may be failure operations that cannot succe...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Hongyu Liu, Linsheng Zhang
Formato:	article
Lenguaje:	EN
Publicado:	IEEE 2021
Materias:	Disassembly sequence planning success rates of disassembly operations partial disassembly expected profit metaheuristics Electrical engineering. Electronics. Nuclear engineering TK1-9971
Acceso en línea:	https://doaj.org/article/b8744072f3f0453790a9d29effdea4be
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:b8744072f3f0453790a9d29effdea4be
record_format	dspace
spelling	oai:doaj.org-article:b8744072f3f0453790a9d29effdea4be2021-12-03T00:01:22ZOptimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm2169-353610.1109/ACCESS.2021.3101221https://doaj.org/article/b8744072f3f0453790a9d29effdea4be2021-01-01T00:00:00Zhttps://ieeexplore.ieee.org/document/9502136/https://doaj.org/toc/2169-3536Disassembly planning is an effective way to recycle valuable parts or materials from end-of-life products. Due to the parts are easily affected by some unpredictable factors in the real disassembly process (such as defective parts and human factors), there may be failure operations that cannot successfully disassemble the corresponding parts in the real world. Therefore, a partial disassembly sequence planning with uncertainty is proposed in the paper, where the success rates of disassembly operations are formulated to model an expected profit-based disassembly sequence planning. Also, a general variable neighborhood search algorithm is developed to optimize the mathematical model. Meanwhile, in the approach, a heuristic procedure is utilized to obtain a high-quality initial solution, and four different neighborhood structures are introduced to improve the disassembly solution. Its superiority and effectiveness are well illustrated by two case studies and comparison with two existing metaheuristics, i.e., artificial bee colony algorithm and genetic algorithm.Hongyu LiuLinsheng ZhangIEEEarticleDisassembly sequence planningsuccess rates of disassembly operationspartial disassemblyexpected profitmetaheuristicsElectrical engineering. Electronics. Nuclear engineeringTK1-9971ENIEEE Access, Vol 9, Pp 157540-157549 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Disassembly sequence planning success rates of disassembly operations partial disassembly expected profit metaheuristics Electrical engineering. Electronics. Nuclear engineering TK1-9971
spellingShingle	Disassembly sequence planning success rates of disassembly operations partial disassembly expected profit metaheuristics Electrical engineering. Electronics. Nuclear engineering TK1-9971 Hongyu Liu Linsheng Zhang Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm
description	Disassembly planning is an effective way to recycle valuable parts or materials from end-of-life products. Due to the parts are easily affected by some unpredictable factors in the real disassembly process (such as defective parts and human factors), there may be failure operations that cannot successfully disassemble the corresponding parts in the real world. Therefore, a partial disassembly sequence planning with uncertainty is proposed in the paper, where the success rates of disassembly operations are formulated to model an expected profit-based disassembly sequence planning. Also, a general variable neighborhood search algorithm is developed to optimize the mathematical model. Meanwhile, in the approach, a heuristic procedure is utilized to obtain a high-quality initial solution, and four different neighborhood structures are introduced to improve the disassembly solution. Its superiority and effectiveness are well illustrated by two case studies and comparison with two existing metaheuristics, i.e., artificial bee colony algorithm and genetic algorithm.
format	article
author	Hongyu Liu Linsheng Zhang
author_facet	Hongyu Liu Linsheng Zhang
author_sort	Hongyu Liu
title	Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm
title_short	Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm
title_full	Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm
title_fullStr	Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm
title_full_unstemmed	Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm
title_sort	optimizing a disassembly sequence planning with success rates of disassembly operations via a variable neighborhood search algorithm
publisher	IEEE
publishDate	2021
url	https://doaj.org/article/b8744072f3f0453790a9d29effdea4be
work_keys_str_mv	AT hongyuliu optimizingadisassemblysequenceplanningwithsuccessratesofdisassemblyoperationsviaavariableneighborhoodsearchalgorithm AT linshengzhang optimizingadisassemblysequenceplanningwithsuccessratesofdisassemblyoperationsviaavariableneighborhoodsearchalgorithm
_version_	1718374010785366016

Optimizing a Disassembly Sequence Planning With Success Rates of Disassembly Operations via a Variable Neighborhood Search Algorithm

Ejemplares similares