The sparrow search algorithm(SSA)is a newly proposed meta-heuristic optimization algorithm based on the sparrowforaging principle.Similar to other meta-heuristic algorithms,SSA has problems such as slowconvergence spe...The sparrow search algorithm(SSA)is a newly proposed meta-heuristic optimization algorithm based on the sparrowforaging principle.Similar to other meta-heuristic algorithms,SSA has problems such as slowconvergence speed and difficulty in jumping out of the local optimum.In order to overcome these shortcomings,a chaotic sparrow search algorithm based on logarithmic spiral strategy and adaptive step strategy(CLSSA)is proposed in this paper.Firstly,in order to balance the exploration and exploitation ability of the algorithm,chaotic mapping is introduced to adjust the main parameters of SSA.Secondly,in order to improve the diversity of the population and enhance the search of the surrounding space,the logarithmic spiral strategy is introduced to improve the sparrow search mechanism.Finally,the adaptive step strategy is introduced to better control the process of algorithm exploitation and exploration.The best chaotic map is determined by different test functions,and the CLSSA with the best chaotic map is applied to solve 23 benchmark functions and 3 classical engineering problems.The simulation results show that the iterative map is the best chaotic map,and CLSSA is efficient and useful for engineering problems,which is better than all comparison algorithms.展开更多
To improve the disassembly efficiency of a U-shaped disassembly line and reduce the potentially harmful effects on the environment and human health,we study the multi-product U-shaped disassembly line balancing proble...To improve the disassembly efficiency of a U-shaped disassembly line and reduce the potentially harmful effects on the environment and human health,we study the multi-product U-shaped disassembly line balancing problem with a fixed number of stations(MUDLBPF).Firstly,we formulate a mathematical model aimed at minimizing cycle time,balancing loads,and reducing hazard indicators.Secondly,a multi-objective variable neighborhood search(MOVNS)algorithm is proposed.A multi-segment encoding method is proposed to maintain the independence of different products.Considering the characteristics of multiple products,a two-stage decoding method is presented.The method includes product assignment and task assignment.To optimize decoding efficiency,a minimum deviation method is put forward to generate feasible solutions.A segmented neighborhood structure containing seven operators is developed to improve the search efficiency.Finally,numerical experiments are performed and the results show that the MOVNS can solve the MUDLBPF effectively and efficiently.展开更多
基金The Science Foundation of Shanxi Province,China(2020JQ-481,2021JM-224)Aero Science Foundation of China(201951096002).
摘要The sparrow search algorithm(SSA)is a newly proposed meta-heuristic optimization algorithm based on the sparrowforaging principle.Similar to other meta-heuristic algorithms,SSA has problems such as slowconvergence speed and difficulty in jumping out of the local optimum.In order to overcome these shortcomings,a chaotic sparrow search algorithm based on logarithmic spiral strategy and adaptive step strategy(CLSSA)is proposed in this paper.Firstly,in order to balance the exploration and exploitation ability of the algorithm,chaotic mapping is introduced to adjust the main parameters of SSA.Secondly,in order to improve the diversity of the population and enhance the search of the surrounding space,the logarithmic spiral strategy is introduced to improve the sparrow search mechanism.Finally,the adaptive step strategy is introduced to better control the process of algorithm exploitation and exploration.The best chaotic map is determined by different test functions,and the CLSSA with the best chaotic map is applied to solve 23 benchmark functions and 3 classical engineering problems.The simulation results show that the iterative map is the best chaotic map,and CLSSA is efficient and useful for engineering problems,which is better than all comparison algorithms.
基金supported by the National Natural Science Foundation of China(No.52175449).
摘要To improve the disassembly efficiency of a U-shaped disassembly line and reduce the potentially harmful effects on the environment and human health,we study the multi-product U-shaped disassembly line balancing problem with a fixed number of stations(MUDLBPF).Firstly,we formulate a mathematical model aimed at minimizing cycle time,balancing loads,and reducing hazard indicators.Secondly,a multi-objective variable neighborhood search(MOVNS)algorithm is proposed.A multi-segment encoding method is proposed to maintain the independence of different products.Considering the characteristics of multiple products,a two-stage decoding method is presented.The method includes product assignment and task assignment.To optimize decoding efficiency,a minimum deviation method is put forward to generate feasible solutions.A segmented neighborhood structure containing seven operators is developed to improve the search efficiency.Finally,numerical experiments are performed and the results show that the MOVNS can solve the MUDLBPF effectively and efficiently.