Habibi, M. K. Khakim and Battaïa, Olga and Cung, Van-Dat and Dolgui, Alexandre
An efficient two-phase iterative heuristic for Collection-Disassembly problem.
(2017)
Computers & Industrial Engineering, 110. 505-514. ISSN 0360-8352
|
(Document in English)
PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 1MB |
Official URL: http://dx.doi.org/10.1016/j.cie.2017.06.031
Abstract
Closing the loop in the supply chains is one of the mandatory conditions for more sustainable development. The Collection-Disassembly Problem appears in the reverse part of the closed-loop supply chains. Its aim is to coordinate the activities of collection of end-of-life products from collection centres and their subsequent disassembly. The disassembly step is required for efficient remanufacturing and recycling of returned products. The Collection-Disassembly problem integrates such optimization problems as dynamic lot-sizing and vehicle routing in general cases. In this paper, we develop a Two-Phase Iterative Heuristic to efficiently address large size instances. The numerical tests show that the heuristic provides good solutions under acceptable computational time.
Repository Staff Only: item control page