Abstract
An effective method for disassembling large-sized waste products is to utilise two-sided disassembly lines. A mixed-integer programming model for two-sided disassembly lines is constructed in this study. The model considers four optimisation objectives: the number of mated-stations, idle index, demand index, and hazard index. The model redefines the hazard and demand indexes and adds new time constraints to the mated-station. In view of the complexity of the problem, a multi-objective improved whale algorithm is proposed, in which two different crossover operators are designed to simulate the predatory behaviour of whales to improve the efficiency of the solution. Then, a disturbance factor is introduced to reduce the probability of the population falling into a local optimum. The validity of the model and the effectiveness of the algorithm are verified by comparing the calculation results of the GUROBI solver with those of the proposed algorithm for two-sided disassembly line examples of different sizes. Subsequently, the algorithm is used to solve large-scale linear problems, and the results are compared with those of other algorithms to verify the superiority of the proposed algorithm. Finally, the model and algorithm are applied to a two-sided disassembly of an engine, and several optimal allocation schemes are obtained.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
