Many complex optimization problems in the real world can easily fall into local optimality and fail to find the optimal solution,so more new techniques and methods are needed to solve such challenges.Metaheuristic alg...Many complex optimization problems in the real world can easily fall into local optimality and fail to find the optimal solution,so more new techniques and methods are needed to solve such challenges.Metaheuristic algorithms have received a lot of attention in recent years because of their efficient performance and simple structure.Sine Cosine Algorithm(SCA)is a recent Metaheuristic algorithm that is based on two trigonometric functions Sine&Cosine.However,like all other metaheuristic algorithms,SCA has a slow convergence and may fail in sub-optimal regions.In this study,an enhanced version of SCA named RDSCA is suggested that depends on two techniques:random spare/replacement and double adaptive weight.The first technique is employed in SCA to speed the convergence whereas the second method is used to enhance exploratory searching capabilities.To evaluate RDSCA,30 functions from CEC 2017 and 4 real-world engineering problems are used.Moreover,a nonparametric test called Wilcoxon signed-rank is carried out at 5%level to evaluate the significance of the obtained results between RDSCA and the other 5 variants of SCA.The results show that RDSCA has competitive results with other metaheuristics algorithms.展开更多
Shape and size optimization with frequency constraints is a highly nonlinear problem withmixed design variables,non-convex search space,and multiple local optima.Therefore,a hybrid sine cosine firefly algorithm(HSCFA)...Shape and size optimization with frequency constraints is a highly nonlinear problem withmixed design variables,non-convex search space,and multiple local optima.Therefore,a hybrid sine cosine firefly algorithm(HSCFA)is proposed to acquire more accurate solutions with less finite element analysis.The full attraction model of firefly algorithm(FA)is analyzed,and the factors that affect its computational efficiency and accuracy are revealed.A modified FA with simplified attraction model and adaptive parameter of sine cosine algorithm(SCA)is proposed to reduce the computational complexity and enhance the convergence rate.Then,the population is classified,and different populations are updated by modified FA and SCA respectively.Besides,the random search strategy based on Lévy flight is adopted to update the stagnant or infeasible solutions to enhance the population diversity.Elitist selection technique is applied to save the promising solutions and further improve the convergence rate.Moreover,the adaptive penalty function is employed to deal with the constraints.Finally,the performance of HSCFA is demonstrated through the numerical examples with nonstructural masses and frequency constraints.The results show that HSCFA is an efficient and competitive tool for shape and size optimization problems with frequency constraints.展开更多
The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a...The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a class of signals is mainly well suited to digital processing of increasing practical importance.A low autocorrelation binary sequence(LABS)is a complex combinatorial problem.The main problems of LABS are low Merit Factor(MF)and shorter length sequences.Besides,the maximum possible MF equals 12.3248 as infinity length is unable to be achieved.Therefore,this study implemented two techniques to propose a new metaheuristic algorithm based on Hybrid Modified Sine Cosine Algorithm with Cuckoo Search Algorithm(HMSCACSA)using Inverse Filtering(IF)and clipping method to achieve better results.The proposed algorithms,LABS-IF and HMSCACSA-IF,achieved better results with two large MFs equal to 12.12 and 12.6678 for lengths 231 and 237,respectively,where the optimal solutions belong to the skew-symmetric sequences.The MF outperformed up to 24.335%and 2.708%against the state-of-the-art LABS heuristic algorithm,xLastovka,and Golay,respectively.These results indicated that the proposed algorithm’s simulation had quality solutions in terms of fast convergence curve with better optimal means,and standard deviation.展开更多
This study investigates the scheduling problem ofmultiple agile optical satelliteswith large-scale tasks.This problem is difficult to solve owing to the time-dependent characteristic of agile optical satellites,comple...This study investigates the scheduling problem ofmultiple agile optical satelliteswith large-scale tasks.This problem is difficult to solve owing to the time-dependent characteristic of agile optical satellites,complex constraints,and considerable solution space.To solve the problem,we propose a scheduling method based on an improved sine and cosine algorithm and a task merging approach.We first establish a scheduling model with task merging constraints and observation action constraints to describe the problem.Then,an improved sine and cosine algorithm is proposed to search for the optimal solution with the maximum profit ratio.An adaptive cosine factor and an adaptive greedy factor are adopted to improve the algorithm.Besides,a taskmerging method with a task reallocation mechanism is developed to improve the scheduling efficiency.Experimental results demonstrate the superiority of the proposed algorithm over the comparison algorithms.展开更多
基金supported in part by the Hangzhou Science and Technology Development Plan Project(Grant No.20191203B30).
文摘Many complex optimization problems in the real world can easily fall into local optimality and fail to find the optimal solution,so more new techniques and methods are needed to solve such challenges.Metaheuristic algorithms have received a lot of attention in recent years because of their efficient performance and simple structure.Sine Cosine Algorithm(SCA)is a recent Metaheuristic algorithm that is based on two trigonometric functions Sine&Cosine.However,like all other metaheuristic algorithms,SCA has a slow convergence and may fail in sub-optimal regions.In this study,an enhanced version of SCA named RDSCA is suggested that depends on two techniques:random spare/replacement and double adaptive weight.The first technique is employed in SCA to speed the convergence whereas the second method is used to enhance exploratory searching capabilities.To evaluate RDSCA,30 functions from CEC 2017 and 4 real-world engineering problems are used.Moreover,a nonparametric test called Wilcoxon signed-rank is carried out at 5%level to evaluate the significance of the obtained results between RDSCA and the other 5 variants of SCA.The results show that RDSCA has competitive results with other metaheuristics algorithms.
基金supported by the NationalNatural Science Foundation of China(No.11672098).
文摘Shape and size optimization with frequency constraints is a highly nonlinear problem withmixed design variables,non-convex search space,and multiple local optima.Therefore,a hybrid sine cosine firefly algorithm(HSCFA)is proposed to acquire more accurate solutions with less finite element analysis.The full attraction model of firefly algorithm(FA)is analyzed,and the factors that affect its computational efficiency and accuracy are revealed.A modified FA with simplified attraction model and adaptive parameter of sine cosine algorithm(SCA)is proposed to reduce the computational complexity and enhance the convergence rate.Then,the population is classified,and different populations are updated by modified FA and SCA respectively.Besides,the random search strategy based on Lévy flight is adopted to update the stagnant or infeasible solutions to enhance the population diversity.Elitist selection technique is applied to save the promising solutions and further improve the convergence rate.Moreover,the adaptive penalty function is employed to deal with the constraints.Finally,the performance of HSCFA is demonstrated through the numerical examples with nonstructural masses and frequency constraints.The results show that HSCFA is an efficient and competitive tool for shape and size optimization problems with frequency constraints.
文摘The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a class of signals is mainly well suited to digital processing of increasing practical importance.A low autocorrelation binary sequence(LABS)is a complex combinatorial problem.The main problems of LABS are low Merit Factor(MF)and shorter length sequences.Besides,the maximum possible MF equals 12.3248 as infinity length is unable to be achieved.Therefore,this study implemented two techniques to propose a new metaheuristic algorithm based on Hybrid Modified Sine Cosine Algorithm with Cuckoo Search Algorithm(HMSCACSA)using Inverse Filtering(IF)and clipping method to achieve better results.The proposed algorithms,LABS-IF and HMSCACSA-IF,achieved better results with two large MFs equal to 12.12 and 12.6678 for lengths 231 and 237,respectively,where the optimal solutions belong to the skew-symmetric sequences.The MF outperformed up to 24.335%and 2.708%against the state-of-the-art LABS heuristic algorithm,xLastovka,and Golay,respectively.These results indicated that the proposed algorithm’s simulation had quality solutions in terms of fast convergence curve with better optimal means,and standard deviation.
基金supported by Science and Technology on Complex Electronic System Simulation Laboratory (Funding No.6142401003022109).
文摘This study investigates the scheduling problem ofmultiple agile optical satelliteswith large-scale tasks.This problem is difficult to solve owing to the time-dependent characteristic of agile optical satellites,complex constraints,and considerable solution space.To solve the problem,we propose a scheduling method based on an improved sine and cosine algorithm and a task merging approach.We first establish a scheduling model with task merging constraints and observation action constraints to describe the problem.Then,an improved sine and cosine algorithm is proposed to search for the optimal solution with the maximum profit ratio.An adaptive cosine factor and an adaptive greedy factor are adopted to improve the algorithm.Besides,a taskmerging method with a task reallocation mechanism is developed to improve the scheduling efficiency.Experimental results demonstrate the superiority of the proposed algorithm over the comparison algorithms.