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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.