Abstract

Remanufacturing attains much attention from both industrial and academic sectors due to its beneficial roles in energy conservation and environment protection, where disassembly is a crucial part. To reach the comprehensive sustainability and global optimization of disassembling multiple end-of-life products, this paper suggests a multi-objective multi-product disassembly line balancing problem with considering disassembly profit, energy consumption and noise pollution simultaneously. According to the natures of the problem under consideration, a multi-objective integer programming model is constructed. Its goals are to reach maximum disassembly profit and realize minimum energy consumption while observing noise pollution requirements and resource constraints. Accordingly, a multi-objective group teaching optimization algorithm is specially devised. In it, rank and crowding distance methods are employed to partition the population into two groups. Moreover, precedence preserving crossover and mutation methods are severally used on the two groups to realize the teacher phase. Furthermore, to achieve the student phase, an adaptive local search method is applied to refine solutions in an external archive, and thus its exploitation ability is enhanced. By executing contrast experiments between the devised approach and its powerful competitors on a set of real-world test instances, the experimental results validate that it has highly-adaptive and well-superior performance in tackling the problem of concern.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.