Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with ...Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses （e.g., Logistic map, Tent map, and Chebyshev map）, a new adaptive mutative scale chaos optimization algorithm （AMSCOA） is proposed by using the chaos model x = sin（2/x）. In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken： 1） the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2） the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.展开更多
In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of ...In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of the first carrier wave’s search for the optimal point in implementing the sophisticated searching during the second carrier wave is faster and more accurate. In addition, the concept of using the carrier wave three times is proposed and put into practice to tackle the multi-variables opti- mization problems, where the searching for the optimal point of the last several variables is frequently worse than the first several ones.展开更多
By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite co...By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.展开更多
In order to avoid such problems as low convergent speed and local optimalsolution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In thisalgorithm, a mutative scale chaos optimization strateg...In order to avoid such problems as low convergent speed and local optimalsolution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In thisalgorithm, a mutative scale chaos optimization strategy is operated on the population after agenetic operation. And according to the searching process, the searching space of the optimalvariables is gradually diminished and the regulating coefficient of the secondary searching processis gradually changed which will lead to the quick evolution of the population. The algorithm hassuch advantages as fast search, precise results and convenient using etc. The simulation resultsshow that the performance of the method is better than that of simple genetic algorithms.展开更多
In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA, thus forming chaotic anneal genetic algorithm (CAGA). Chaos ergodicity is used to initialize the population, and ...In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA, thus forming chaotic anneal genetic algorithm (CAGA). Chaos ergodicity is used to initialize the population, and chaotic anneal mutation operator is used as the substitute for the mutation operator in SGA. CAGA is a unified framework of the existing chaotic mutation methods. To validate the proposed algorithm, three algorithms, i. e. Baum-Welch, SGA and CAGA, are compared on training hidden Markov model (HMM) to recognize the hand gestures. Experiments on twenty-six alphabetical gestures show the CAGA validity.展开更多
This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second met...This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second method of searching the excellent solution. The search direction is improved by chaos optimization algorithm and realizes the selective acceptance of wrong solution. The experimental result shows that the presented algorithm can be used in the partitioning of hardware/software of reconfigurable system. It effectively reduces the local extremum problem,and search speed as well as performance of partitioning is improved.展开更多
The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to de...The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to deal with the problem of multi-targets data association separately. Based on the analysis of the limitation of chaos optimization and genetic algorithm, a new chaos genetic optimization combination algorithm was presented. This new algorithm first applied the "rough" search of chaos optimization to initialize the population of GA, then optimized the population by real-coded adaptive GA. In this way, GA can not only jump out of the "trap" of local optimal results easily but also increase the rate of convergence. And the new method can also avoid the complexity and time-consumed limitation of conventional way. The simulation results show that the combination algorithm can obtain higher correct association percent and the effect of association is obviously superior to chaos optimization or genetic algorithm separately. This method has better convergence property as well as time property than the conventional ones.展开更多
The welding of medium and thick plates has a wide range of applications in the engineering field.Industrial welding robots are gradually replacing traditional welding operations due to their significant advantages,suc...The welding of medium and thick plates has a wide range of applications in the engineering field.Industrial welding robots are gradually replacing traditional welding operations due to their significant advantages,such as high welding quality,high work efficiency,and effective reduction of labor intensity.Ensuring the accuracy of the welding trajectory for the welding robot is crucial for guaranteeing welding quality.In this paper,the author uses the chaos sparrow search algorithm to optimize the trajectory of a multi-layer and multi-pass welding robot for medium and thick plates.Firstly,the Sparrow Search Algorithm(SSA)is improved by introducing tent chaotic mapping and Gaussian mutation of the inertia weight factor.Secondly,in order to prevent the welding robot arm from colliding with obstacles in the welding environment during the welding process,maintain the stability of the welding robot,and ensure the continuous stability of the changes in each joint angle,joint angular velocity,and angular velocity of the joint angle,a welding robot model is established by improving the Denavit-Hartenberg parameter method.A multi-objective optimization fitness function is used to optimize the trajectory of the welding robot,minimizing time and energy consumption.Thirdly,the optimization and convergence performance of SSA and Chaos Sparrow Search Algorithm(CSSA)are compared through 10 benchmark test functions.Based on the six sets of test functions,the CSSA algorithm consistently maintains superior optimization performance and has excellent stability,with a faster decline in the convergence curve compared to the SSA algorithm.Finally,the accuracy of welding is tested through V-shaped multi-layer and multi-pass welding experiments.The experimental results show that the CSSA algorithm has a strong superiority in trajectory optimization of multi-layer and multi-pass welding for medium and thick plates,with an accuracy rate of 99.5%.It is an effective optimization method that can meet the actual needs of production.展开更多
Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been prop...Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been proposed. The Hiking Optimization Algorithm (HOA) have been used in multiple fields. However, HOA suffers from local optimization, slow convergence, and low efficiency of late iteration search when solving cloud task scheduling problems. Thus, this paper proposes an improved HOA called CMOHOA. It collaborates with multi-strategy to improve HOA. Specifically, Chebyshev chaos is introduced to increase population diversity. Then, a hybrid speed update strategy is designed to enhance convergence speed. Meanwhile, an adversarial learning strategy is introduced to enhance the search capability in the late iteration. Different scenarios of scheduling problems are used to test the CMOHOA’s performance. First, CMOHOA was used to solve basic cloud computing task scheduling problems, and the results showed that it reduced the average total cost by 10% or more. Secondly, CMOHOA has been applied to edge fog cloud scheduling problems, and the results show that it reduces the average total scheduling cost by 2% or more. Finally, CMOHOA reduced the average total cost by 7% or more in scheduling problems for information transmission.展开更多
A genetic algorithm based on the nested intervals chaos search (NICGA) hasbeen given. Because the nested intervals chaos search is introduced into the NICGA to initialize thepopulation and to lead the evolution of the...A genetic algorithm based on the nested intervals chaos search (NICGA) hasbeen given. Because the nested intervals chaos search is introduced into the NICGA to initialize thepopulation and to lead the evolution of the population, the NICGA has the advantages of decreasingthe population size, enhancing the local search ability, and improving the computational efficiencyand optimization precision. In a multi4ayer feed forward neural network model for predicting thesilicon content in hot metal, the NICGA was used to optimize the connection weights and thresholdvalues of the neural network to improve the prediction precision. The application results show thatthe precision of predicting the silicon content has been increased.展开更多
Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and infor...Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed Parallel Genetic Algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm, asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Information exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory programming model is set up and solved by CMPPGA with satisfactory results returned.展开更多
To enhance the diversity and distribution uniformity of initial population,as well as to avoid local extrema in the Chimp Optimization Algorithm(CHOA),this paper improves the CHOA based on chaos initialization and Cau...To enhance the diversity and distribution uniformity of initial population,as well as to avoid local extrema in the Chimp Optimization Algorithm(CHOA),this paper improves the CHOA based on chaos initialization and Cauchy mutation.First,Sin chaos is introduced to improve the random population initialization scheme of the CHOA,which not only guarantees the diversity of the population,but also enhances the distribution uniformity of the initial population.Next,Cauchy mutation is added to optimize the global search ability of the CHOA in the process of position(threshold)updating to avoid the CHOA falling into local optima.Finally,an improved CHOA was formed through the combination of chaos initialization and Cauchy mutation(CICMCHOA),then taking fuzzy Kapur as the objective function,this paper applied CICMCHOA to natural and medical image segmentation,and compared it with four algorithms,including the improved Satin Bowerbird optimizer(ISBO),Cuckoo Search(ICS),etc.The experimental results deriving from visual and specific indicators demonstrate that CICMCHOA delivers superior segmentation effects in image segmentation.展开更多
This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos'randomness,ergodicity and regularity. Its prope...This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos'randomness,ergodicity and regularity. Its property of global asymptotical convergence has been proved with Markov chains in this paper. CGA was applied to the optimization of complex benchmark functions and artificial neural network's (ANN) training. In solving the complex benchmark functions,CGA needs less iterative number than GA and other chaotic optimization algorithms and always finds the optima of these functions. In training ANN,CGA uses less iterative number and shows strong generalization. It is proved that CGA is an efficient and convenient chaotic optimization algorithm.展开更多
Through replacing Gaussian mutation operator in real-coded genetic algorithm with a chaotic mapping, wepresent a genetic algorithm with chaotic mutation. To examine this new algorithm, we applied our algorithm to func...Through replacing Gaussian mutation operator in real-coded genetic algorithm with a chaotic mapping, wepresent a genetic algorithm with chaotic mutation. To examine this new algorithm, we applied our algorithm to functionoptimization problems and obtained good results. Furthermore the orbital points' distribution of chaotic mapping andthe effects of chaotic mutation with different parameters were studied in order to make the chaotic mutation mechanismbe utilized efficiently.展开更多
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.展开更多
This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to ...This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to estimate the chance of a random fuzzy event and the optimistic value to a random fuzzy variable.In CQHBA,each bee carries a group of quantum bits representing a solution.Chaos optimization searches space around the selected best-so-far food source.In the marriage process,random interferential discrete quantum crossover is done between selected drones and the queen.Gaussian quantum mutation is used to keep the diversity of whole population.New methods of computing quantum rotation angles are designed based on grads.A proof of con-vergence for CQHBA is developed and a theoretical analysis of the computational overhead for the algorithm is presented.Numerical examples are presented to demonstrate its superiority in robustness and stability,efficiency of computational complexity,success rate,and accuracy of solution quality.CQHBA is manifested to be highly robust under various conditions and capable of handling most random fuzzy programmings with any parameter settings,variable initializations,system tolerance and confidence level,perturbations,and noises.展开更多
An improved real-coded genetic algorithm is pro-posed for global optimization of functionsl.The new algo-rithm is based om the judgement of the searching perfor-mance of basic real-coded genetic algorithm.The opera-t...An improved real-coded genetic algorithm is pro-posed for global optimization of functionsl.The new algo-rithm is based om the judgement of the searching perfor-mance of basic real-coded genetic algorithm.The opera-tions of basic real-coded genetic algorithm are briefly dis-cussed and selected.A kind of chaos sequence is described in detail and added in the new algorithm ad a disturbance factor.The strategy of field partition is also used to im-prove the strcture of the new algorithm.Numerical ex-periment shows that the mew genetic algorithm can find the global optimum of complex funtions with satistaiting precision.展开更多
A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorith...A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase I. Adjustment strategy of steplength and intensive searches in Phase II are employed. The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.展开更多
Till now,several novel metaheuristic algorithms are proposed for global search.But only specific algorithms have become popular or attracted researchers,who are efficient in solving global optimization problems as wel...Till now,several novel metaheuristic algorithms are proposed for global search.But only specific algorithms have become popular or attracted researchers,who are efficient in solving global optimization problems as well as real-world application problems.The Social Group Optimization(SGO)algorithm is a new metaheuristic bioinspired algorithm inspired by human social behavior that attracted researchers due to its simplicity and problem-solving capability.In this study,to deal with the problems of low accuracy and local convergence in SGO,the chaos theory is introduced into the evolutionary process of SGO.Since chaotic mapping has certainty,ergodicity,and stochastic property,by replacing the constant value of the self-introspection parameter with chaotic maps,the proposed chaotic social group optimization algorithm increases its convergence rate and resulting precision.The proposal chaotic SGO is validated through 13 benchmark functions and after that 9 structural engineering design problems have been solved.The simulated results have been noticed as competent with that of state-of-art algorithms regarding convergence quality and accuracy,which certifies that improved SGO with chaos is valid and feasible.展开更多
The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algo...The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algorithm called OLCHWOA,incorporating a chaos mechanism and an opposition-based learning strategy.This algorithm introduces chaotic initialization and opposition-based initialization operators during the population initialization phase,thereby enhancing the quality of the initial whale population.Additionally,including an elite opposition-based learning operator significantly improves the algorithm’s global search capabilities during iterations.The work and contributions of this paper are primarily reflected in two aspects.Firstly,an improved whale algorithm with enhanced development capabilities and a wide range of application scenarios is proposed.Secondly,the proposed OLCHWOA is used to optimize the hyperparameters of the Long Short-Term Memory(LSTM)networks.Subsequently,a prediction model for Realized Volatility(RV)based on OLCHWOA-LSTM is proposed to optimize hyperparameters automatically.To evaluate the performance of OLCHWOA,a series of comparative experiments were conducted using a variety of advanced algorithms.These experiments included 38 standard test functions from CEC2013 and CEC2019 and three constrained engineering design problems.The experimental results show that OLCHWOA ranks first in accuracy and stability under the same maximum fitness function calls budget.Additionally,the China Securities Index 300(CSI 300)dataset is used to evaluate the effectiveness of the proposed OLCHWOA-LSTM model in predicting RV.The comparison results with the other eight models show that the proposed model has the highest accuracy and goodness of fit in predicting RV.This further confirms that OLCHWOA effectively addresses real-world optimization problems.展开更多
基金Hunan Provincial Natural Science Foundation of China (No. 06JJ50103)the National Natural Science Foundationof China (No. 60375001)
文摘Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses （e.g., Logistic map, Tent map, and Chebyshev map）, a new adaptive mutative scale chaos optimization algorithm （AMSCOA） is proposed by using the chaos model x = sin（2/x）. In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken： 1） the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2） the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.
基金Project supported by the National Natural Science Foundation of China (No. 60474064), and the Natural Science Foundation of Zhejiang Province (No. Y105694), China
文摘In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of the first carrier wave’s search for the optimal point in implementing the sophisticated searching during the second carrier wave is faster and more accurate. In addition, the concept of using the carrier wave three times is proposed and put into practice to tackle the multi-variables opti- mization problems, where the searching for the optimal point of the last several variables is frequently worse than the first several ones.
基金Project(60874114) supported by the National Natural Science Foundation of China
文摘By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.
文摘In order to avoid such problems as low convergent speed and local optimalsolution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In thisalgorithm, a mutative scale chaos optimization strategy is operated on the population after agenetic operation. And according to the searching process, the searching space of the optimalvariables is gradually diminished and the regulating coefficient of the secondary searching processis gradually changed which will lead to the quick evolution of the population. The algorithm hassuch advantages as fast search, precise results and convenient using etc. The simulation resultsshow that the performance of the method is better than that of simple genetic algorithms.
文摘In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA, thus forming chaotic anneal genetic algorithm (CAGA). Chaos ergodicity is used to initialize the population, and chaotic anneal mutation operator is used as the substitute for the mutation operator in SGA. CAGA is a unified framework of the existing chaotic mutation methods. To validate the proposed algorithm, three algorithms, i. e. Baum-Welch, SGA and CAGA, are compared on training hidden Markov model (HMM) to recognize the hand gestures. Experiments on twenty-six alphabetical gestures show the CAGA validity.
基金Sponsored by the Natural Science Foundation of Heilongjiang Province( Grant No B2007-07)Industrial Research Projects in Qiqihaer( Grant No GYGG-09009)
文摘This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second method of searching the excellent solution. The search direction is improved by chaos optimization algorithm and realizes the selective acceptance of wrong solution. The experimental result shows that the presented algorithm can be used in the partitioning of hardware/software of reconfigurable system. It effectively reduces the local extremum problem,and search speed as well as performance of partitioning is improved.
文摘The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to deal with the problem of multi-targets data association separately. Based on the analysis of the limitation of chaos optimization and genetic algorithm, a new chaos genetic optimization combination algorithm was presented. This new algorithm first applied the "rough" search of chaos optimization to initialize the population of GA, then optimized the population by real-coded adaptive GA. In this way, GA can not only jump out of the "trap" of local optimal results easily but also increase the rate of convergence. And the new method can also avoid the complexity and time-consumed limitation of conventional way. The simulation results show that the combination algorithm can obtain higher correct association percent and the effect of association is obviously superior to chaos optimization or genetic algorithm separately. This method has better convergence property as well as time property than the conventional ones.
基金support by Ningxia Key R&D projects“Integration and demonstration application of intelligent finishing system for large casting riser robot”(No.2021BEE03002)Ningxia Natural Science Foundation Project“Research on detection and location of large casting welding seam based on depth learning”(No.2020AAC03201).
文摘The welding of medium and thick plates has a wide range of applications in the engineering field.Industrial welding robots are gradually replacing traditional welding operations due to their significant advantages,such as high welding quality,high work efficiency,and effective reduction of labor intensity.Ensuring the accuracy of the welding trajectory for the welding robot is crucial for guaranteeing welding quality.In this paper,the author uses the chaos sparrow search algorithm to optimize the trajectory of a multi-layer and multi-pass welding robot for medium and thick plates.Firstly,the Sparrow Search Algorithm(SSA)is improved by introducing tent chaotic mapping and Gaussian mutation of the inertia weight factor.Secondly,in order to prevent the welding robot arm from colliding with obstacles in the welding environment during the welding process,maintain the stability of the welding robot,and ensure the continuous stability of the changes in each joint angle,joint angular velocity,and angular velocity of the joint angle,a welding robot model is established by improving the Denavit-Hartenberg parameter method.A multi-objective optimization fitness function is used to optimize the trajectory of the welding robot,minimizing time and energy consumption.Thirdly,the optimization and convergence performance of SSA and Chaos Sparrow Search Algorithm(CSSA)are compared through 10 benchmark test functions.Based on the six sets of test functions,the CSSA algorithm consistently maintains superior optimization performance and has excellent stability,with a faster decline in the convergence curve compared to the SSA algorithm.Finally,the accuracy of welding is tested through V-shaped multi-layer and multi-pass welding experiments.The experimental results show that the CSSA algorithm has a strong superiority in trajectory optimization of multi-layer and multi-pass welding for medium and thick plates,with an accuracy rate of 99.5%.It is an effective optimization method that can meet the actual needs of production.
基金supported by the National Natural Science Foundation of China (52275480)the Guizhou Provincial Science and Technology Program of Qiankehe Zhongdi Guiding ([2023]02)+1 种基金the Guizhou Provincial Science and Technology Program of Qiankehe Platform Talent Project (GCC[2023]001)the Guizhou Provincial Science and Technology Project of Qiankehe Platform Project (KXJZ[2024]002).
文摘Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been proposed. The Hiking Optimization Algorithm (HOA) have been used in multiple fields. However, HOA suffers from local optimization, slow convergence, and low efficiency of late iteration search when solving cloud task scheduling problems. Thus, this paper proposes an improved HOA called CMOHOA. It collaborates with multi-strategy to improve HOA. Specifically, Chebyshev chaos is introduced to increase population diversity. Then, a hybrid speed update strategy is designed to enhance convergence speed. Meanwhile, an adversarial learning strategy is introduced to enhance the search capability in the late iteration. Different scenarios of scheduling problems are used to test the CMOHOA’s performance. First, CMOHOA was used to solve basic cloud computing task scheduling problems, and the results showed that it reduced the average total cost by 10% or more. Secondly, CMOHOA has been applied to edge fog cloud scheduling problems, and the results show that it reduces the average total scheduling cost by 2% or more. Finally, CMOHOA reduced the average total cost by 7% or more in scheduling problems for information transmission.
文摘A genetic algorithm based on the nested intervals chaos search (NICGA) hasbeen given. Because the nested intervals chaos search is introduced into the NICGA to initialize thepopulation and to lead the evolution of the population, the NICGA has the advantages of decreasingthe population size, enhancing the local search ability, and improving the computational efficiencyand optimization precision. In a multi4ayer feed forward neural network model for predicting thesilicon content in hot metal, the NICGA was used to optimize the connection weights and thresholdvalues of the neural network to improve the prediction precision. The application results show thatthe precision of predicting the silicon content has been increased.
文摘Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed Parallel Genetic Algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm, asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Information exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory programming model is set up and solved by CMPPGA with satisfactory results returned.
基金This work is supported by Natural Science Foundation of Anhui under Grant 1908085MF207,KJ2020A1215,KJ2021A1251 and 2023AH052856the Excellent Youth Talent Support Foundation of Anhui underGrant gxyqZD2021142the Quality Engineering Project of Anhui under Grant 2021jyxm1117,2021kcszsfkc307,2022xsxx158 and 2022jcbs043.
文摘To enhance the diversity and distribution uniformity of initial population,as well as to avoid local extrema in the Chimp Optimization Algorithm(CHOA),this paper improves the CHOA based on chaos initialization and Cauchy mutation.First,Sin chaos is introduced to improve the random population initialization scheme of the CHOA,which not only guarantees the diversity of the population,but also enhances the distribution uniformity of the initial population.Next,Cauchy mutation is added to optimize the global search ability of the CHOA in the process of position(threshold)updating to avoid the CHOA falling into local optima.Finally,an improved CHOA was formed through the combination of chaos initialization and Cauchy mutation(CICMCHOA),then taking fuzzy Kapur as the objective function,this paper applied CICMCHOA to natural and medical image segmentation,and compared it with four algorithms,including the improved Satin Bowerbird optimizer(ISBO),Cuckoo Search(ICS),etc.The experimental results deriving from visual and specific indicators demonstrate that CICMCHOA delivers superior segmentation effects in image segmentation.
基金Sponsored by the National Natural Science Foundation of China(Grant No. 60674024)the Initial Foundation of Civil Aviation University of China(Grant No. 06QD04x)
文摘This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos'randomness,ergodicity and regularity. Its property of global asymptotical convergence has been proved with Markov chains in this paper. CGA was applied to the optimization of complex benchmark functions and artificial neural network's (ANN) training. In solving the complex benchmark functions,CGA needs less iterative number than GA and other chaotic optimization algorithms and always finds the optima of these functions. In training ANN,CGA uses less iterative number and shows strong generalization. It is proved that CGA is an efficient and convenient chaotic optimization algorithm.
文摘Through replacing Gaussian mutation operator in real-coded genetic algorithm with a chaotic mapping, wepresent a genetic algorithm with chaotic mutation. To examine this new algorithm, we applied our algorithm to functionoptimization problems and obtained good results. Furthermore the orbital points' distribution of chaotic mapping andthe effects of chaotic mutation with different parameters were studied in order to make the chaotic mutation mechanismbe utilized 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 National High Technology Research and Development Program of China(863 Program)(No.2007AA041603)National Natural Science Foundation of China(No.60475035)+2 种基金Key Technologies Research and Development Program Foundation of Hunan Province of China(No.2007FJ1806)Science and Technology Research Plan of National University of Defense Technology(No.CX07-03-01)Top Class Graduate Student Innovation Sustentation Fund of National University of Defense Technology(No.B070302.)
文摘This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to estimate the chance of a random fuzzy event and the optimistic value to a random fuzzy variable.In CQHBA,each bee carries a group of quantum bits representing a solution.Chaos optimization searches space around the selected best-so-far food source.In the marriage process,random interferential discrete quantum crossover is done between selected drones and the queen.Gaussian quantum mutation is used to keep the diversity of whole population.New methods of computing quantum rotation angles are designed based on grads.A proof of con-vergence for CQHBA is developed and a theoretical analysis of the computational overhead for the algorithm is presented.Numerical examples are presented to demonstrate its superiority in robustness and stability,efficiency of computational complexity,success rate,and accuracy of solution quality.CQHBA is manifested to be highly robust under various conditions and capable of handling most random fuzzy programmings with any parameter settings,variable initializations,system tolerance and confidence level,perturbations,and noises.
文摘An improved real-coded genetic algorithm is pro-posed for global optimization of functionsl.The new algo-rithm is based om the judgement of the searching perfor-mance of basic real-coded genetic algorithm.The opera-tions of basic real-coded genetic algorithm are briefly dis-cussed and selected.A kind of chaos sequence is described in detail and added in the new algorithm ad a disturbance factor.The strategy of field partition is also used to im-prove the strcture of the new algorithm.Numerical ex-periment shows that the mew genetic algorithm can find the global optimum of complex funtions with satistaiting precision.
文摘A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase I. Adjustment strategy of steplength and intensive searches in Phase II are employed. The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.
文摘Till now,several novel metaheuristic algorithms are proposed for global search.But only specific algorithms have become popular or attracted researchers,who are efficient in solving global optimization problems as well as real-world application problems.The Social Group Optimization(SGO)algorithm is a new metaheuristic bioinspired algorithm inspired by human social behavior that attracted researchers due to its simplicity and problem-solving capability.In this study,to deal with the problems of low accuracy and local convergence in SGO,the chaos theory is introduced into the evolutionary process of SGO.Since chaotic mapping has certainty,ergodicity,and stochastic property,by replacing the constant value of the self-introspection parameter with chaotic maps,the proposed chaotic social group optimization algorithm increases its convergence rate and resulting precision.The proposal chaotic SGO is validated through 13 benchmark functions and after that 9 structural engineering design problems have been solved.The simulated results have been noticed as competent with that of state-of-art algorithms regarding convergence quality and accuracy,which certifies that improved SGO with chaos is valid and feasible.
基金The National Natural Science Foundation of China(Grant No.81973791)funded this research.
文摘The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algorithm called OLCHWOA,incorporating a chaos mechanism and an opposition-based learning strategy.This algorithm introduces chaotic initialization and opposition-based initialization operators during the population initialization phase,thereby enhancing the quality of the initial whale population.Additionally,including an elite opposition-based learning operator significantly improves the algorithm’s global search capabilities during iterations.The work and contributions of this paper are primarily reflected in two aspects.Firstly,an improved whale algorithm with enhanced development capabilities and a wide range of application scenarios is proposed.Secondly,the proposed OLCHWOA is used to optimize the hyperparameters of the Long Short-Term Memory(LSTM)networks.Subsequently,a prediction model for Realized Volatility(RV)based on OLCHWOA-LSTM is proposed to optimize hyperparameters automatically.To evaluate the performance of OLCHWOA,a series of comparative experiments were conducted using a variety of advanced algorithms.These experiments included 38 standard test functions from CEC2013 and CEC2019 and three constrained engineering design problems.The experimental results show that OLCHWOA ranks first in accuracy and stability under the same maximum fitness function calls budget.Additionally,the China Securities Index 300(CSI 300)dataset is used to evaluate the effectiveness of the proposed OLCHWOA-LSTM model in predicting RV.The comparison results with the other eight models show that the proposed model has the highest accuracy and goodness of fit in predicting RV.This further confirms that OLCHWOA effectively addresses real-world optimization problems.
