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

- The Collection-Disassembly Problem is considered in the reverse supply chains.
- A two-phase iterative heuristic is developed to address large scale instances.
- The proposed heuristic provides good solutions under acceptable computational time.

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.