An efficient two-phase iterative heuristic for Collection-Disassembly problem

Citation data:

Computers & Industrial Engineering, ISSN: 0360-8352, Vol: 110, Page: 505-514

Publication Year:
2017
Usage 77
Abstract Views 75
Link-outs 2
Captures 12
Readers 12
Social Media 89
Shares, Likes & Comments 89
Citations 1
Citation Indexes 1
DOI:
10.1016/j.cie.2017.06.031
Author(s):
M. K. Khakim Habibi; Olga Battaïa; Van-Dat Cung; Alexandre Dolgui
Publisher(s):
Elsevier BV
Tags:
Computer Science; Engineering
article description
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.