A novel heuristic search algorithm called seeker op- timization algorithm （SOA） is proposed for the real-parameter optimization. The proposed SOA is based on simulating the act of human searching. In the SOA, search...A novel heuristic search algorithm called seeker op- timization algorithm （SOA） is proposed for the real-parameter optimization. The proposed SOA is based on simulating the act of human searching. In the SOA, search direction is based on empir- ical gradients by evaluating the response to the position changes, while step length is based on uncertainty reasoning by using a simple fuzzy rule. The effectiveness of the SOA is evaluated by using a challenging set of typically complex functions in compari- son to differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms. The simulation results show that the performance of the SOA is superior or comparable to that of the other algorithms.展开更多
The Firefly Algorithm(FA)is a highly efficient population-based optimization technique developed by mimicking the flashing behavior of fireflies when mating.This article proposes a method based on Differential Evoluti...The Firefly Algorithm(FA)is a highly efficient population-based optimization technique developed by mimicking the flashing behavior of fireflies when mating.This article proposes a method based on Differential Evolution(DE)/current-to-best/1 for enhancing the FA's movement process.The proposed modification increases the global search ability and the convergence rates while maintaining a balance between exploration and exploitation by deploying the global best solution.However,employing the best solution can lead to premature algorithm convergence,but this study handles this issue using a loop adjacent to the algorithm's main loop.Additionally,the suggested algorithm’s sensitivity to the alpha parameter is reduced compared to the original FA.The GbFA surpasses both the original and five-version of enhanced FAs in finding the optimal solution to 30 CEC2014 real parameter benchmark problems with all selected alpha values.Additionally,the CEC 2017 benchmark functions and the eight engineering optimization challenges are also utilized to evaluate GbFA’s efficacy and robustness on real-world problems against several enhanced algorithms.In all cases,GbFA provides the optimal result compared to other methods.Note that the source code of the GbFA algorithm is publicly available at https://www.optim-app.com/projects/gbfa.展开更多
A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK ...A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.展开更多
An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective f...An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.展开更多
Selection, crossover, and mutation are three main operators of the canonical genetic algorithm (CGA). This paper presents a new approach to the genetic algorithm. This new approach applies only to mutation and selecti...Selection, crossover, and mutation are three main operators of the canonical genetic algorithm (CGA). This paper presents a new approach to the genetic algorithm. This new approach applies only to mutation and selection operators. The paper proves that the search process of the non-crossover genetic algorithm (NCGA) is an ergodic homogeneous Markov chain. The proof of its convergence to global optimum is presented. Some nonlinear multi-modal optimization problems are applied to test the efficacy of the NCGA. NP-hard traveling salesman problem (TSP) is cited here as the benchmark problem to test the efficiency of the algorithm. The simulation result shows that NCGA achieves much faster convergence speed than CGA in terms of CPU time. The convergence speed per epoch of NCGA is also faster than that of CGA.展开更多
An adaptive genetic algorithm with diversity-guided mutation, which combines adaptive probabilities of crossover and mutation was proposed. By means of homogeneous finite Markov chains, it is proved that adaptive gene...An adaptive genetic algorithm with diversity-guided mutation, which combines adaptive probabilities of crossover and mutation was proposed. By means of homogeneous finite Markov chains, it is proved that adaptive genetic algorithm with diversity-guided mutation and genetic algorithm with diversity-guided mutation converge to the global optimum if they maintain the best solutions, and the convergence of adaptive genetic algorithms with adaptive probabilities of crossover and mutation was studied. The performances of the above algorithms in optimizing several unimodal and multimodal functions were compared. The results show that for multimodal functions the average convergence generation of the adaptive genetic algorithm with diversity-guided mutation is about 900 less than that of (adaptive) genetic algorithm with adaptive probabilities and genetic algorithm with diversity-guided mutation, and the adaptive genetic algorithm with diversity-guided mutation does not lead to premature convergence. It is also shown that the better balance between overcoming premature convergence and quickening convergence speed can be gotten.展开更多
A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems a...A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems and minimization of factor of safety in slope stability analysis. The new algorithm combines the global exploration ability of the GSA to converge rapidly to a near optimum solution. In addition, it uses the accurate local exploitation ability of the SQP to accelerate the search process and find an accurate solution. A set of five well-known benchmark optimization problems was used to validate the performance of the GSA-SQP as a global optimization algorithm and facilitate comparison with the classical GSA. In addition, the effectiveness of the proposed method for slope stability analysis was investigated using three ease studies of slope stability problems from the literature. The factor of safety of earth slopes was evaluated using the Morgenstern-Price method. The numerical experiments demonstrate that the hybrid algorithm converges faster to a significantly more accurate final solution for a variety of benchmark test functions and slope stability problems.展开更多
The advent of Big Data has rendered Machine Learning tasks more intricate as they frequently involve higher-dimensional data.Feature Selection(FS)methods can abate the complexity of the data and enhance the accuracy,g...The advent of Big Data has rendered Machine Learning tasks more intricate as they frequently involve higher-dimensional data.Feature Selection(FS)methods can abate the complexity of the data and enhance the accuracy,generalizability,and interpretability of models.Meta-heuristic algorithms are often utilized for FS tasks due to their low requirements and efficient performance.This paper introduces an augmented Forensic-Based Investigation algorithm(DCFBI)that incorporates a Dynamic Individual Selection(DIS)and crisscross(CC)mechanism to improve the pursuit phase of the FBI.Moreover,a binary version of DCFBI(BDCFBI)is applied to FS.Experiments conducted on IEEE CEC 2017 with other metaheuristics demonstrate that DCFBI surpasses them in search capability.The influence of different mechanisms on the original FBI is analyzed on benchmark functions,while its scalability is verified by comparing it with the original FBI on benchmarks with varied dimensions.BDCFBI is then applied to 18 real datasets from the UCI machine learning database and the Wieslaw dataset to select near-optimal features,which are then compared with six renowned binary metaheuristics.The results show that BDCFBI can be more competitive than similar methods and acquire a subset of features with superior classification accuracy.展开更多
During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution qual...During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.展开更多
A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is very different from the traditional evolutionary algorithm and the two novel features are the u...A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is very different from the traditional evolutionary algorithm and the two novel features are the unique of selecting strategy and the determination of individuals that are selected to crossover and mutate. We use DEA to solve a lot of global optimization problems that are nonlinear, multimodal and multidimensional and obtain satisfactory results.展开更多
Crow Search Algorithm(CSA)is a swarm-based single-objective optimizer proposed in recent years,which tried to inspire the behavior of crows that hide foods in different locations and retrieve them when needed.The orig...Crow Search Algorithm(CSA)is a swarm-based single-objective optimizer proposed in recent years,which tried to inspire the behavior of crows that hide foods in different locations and retrieve them when needed.The original version of the CSA has simple parameters and moderate performance.However,it often tends to converge slowly or get stuck in a locally optimal region due to a missed harmonizing strategy during the exploitation and exploration phases.Therefore,strategies of mutation and crisscross are combined into CSA(CCMSCSA)in this paper to improve the performance and provide an efficient optimizer for various optimization problems.To verify the superiority of CCMSCSA,a set of comparisons has been performed reasonably with some well-established metaheuristics and advanced metaheuristics on 15 benchmark functions.The experimental results expose and verify that the proposed CCMSCSA has meaningfully improved the convergence speed and the ability to jump out of the local optimum.In addition,the scalability of CCMSCSA is analyzed,and the algorithm is applied to several engineering problems in a constrained space and feature selection problems.Experimental results show that the scalability of CCMSCSA has been significantly improved and can find better solutions than its competitors when dealing with combinatorial optimization problems.The proposed CCMSCSA performs well in almost all experimental results.Therefore,we hope the researchers can see it as an effective method for solving constrained and unconstrained optimization problems.展开更多
Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a ...Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a celestial body. Some optimal trajectories ofEJS, EMS, EVEJS and EVVEJS flying sequences are obtained using five global optimization algorithms： DE, PSO, DP, the hybrid algorithm PSODE and another hybrid algorithm, DPDE. DE is proved to be supe- rior to other non-hybrid algorithms in the trajectory optimi- zation problem. The hybrid algorithm of PSO and DE can improve the optimization performance of DE, which is vali- dated by the mission to Saturn with given swingby sequences. Finally, the optimization results of four different swingby sequences are compared with those of the ACT of ESA.展开更多
Evolutionary computation is a kind of adaptive non--numerical computation method which is designed tosimulate evolution of nature. In this paper, evolutionary algorithm behavior is described in terms of theconstructio...Evolutionary computation is a kind of adaptive non--numerical computation method which is designed tosimulate evolution of nature. In this paper, evolutionary algorithm behavior is described in terms of theconstruction and evolution of the sampling distributions over the space of candidate solutions. Iterativeconstruction of the sampling distributions is based on the idea of the global random search of generationalmethods. Under this frame, propontional selection is characterized as a gobal search operator, and recombination is characerized as the search process that exploits similarities. It is shown-that by properly constraining the search breadth of recombination operators, weak convergence of evolutionary algorithms to aglobal optimum can be ensured.展开更多
In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we ...In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we prove that the pure random search converges to the global minimum in probability and its time has geometry distribution. We also analyze the pure adaptive search by this framework and turn out that the pure adaptive search converges to the global minimum in probability and its time has Poisson distribution.展开更多
This paper presents a new stochastic algorithm for box constrained global optimization problem. Bacause the level set of objective function is always not known, the authors designed a region containing the current mi...This paper presents a new stochastic algorithm for box constrained global optimization problem. Bacause the level set of objective function is always not known, the authors designed a region containing the current minimum point to replace it, and in order to fit the level set well, this region would be walking and contracting in the running process. Thus, the new algorithm is named as region's walk and contraction(RWC). Some numerical experiments for the RWC were conducted, which indicate good property of the algorithm.展开更多
Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network m...Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network model of environmental information in the workspace for a robot and used this model to establish the relationship between a collision avoidance path and the output of the model. Then the two-dimensional coding for the path via-points was converted to one-dimensional one and the fitness of both the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results showed that the proposed method is correct and effective.展开更多
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.展开更多
A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problem...A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.展开更多
In order to solve the problem that the krill herd(KH)algorithm is premature due to the decrease of population diversity,a new hybrid vortex search KH(VSKH)algorithm has been developed to deal with the global optimizat...In order to solve the problem that the krill herd(KH)algorithm is premature due to the decrease of population diversity,a new hybrid vortex search KH(VSKH)algorithm has been developed to deal with the global optimization problem.The improvement is that a new hybrid vortex search(HVS)operator is added into the updating process of the krill for the purpose of dealing with optimization problems more efficiently.Using 20 benchmark functions for comparison experiments,the results show that the VSKH algorithm has higher accuracy.展开更多
基金supported by the National Natural Science Foundation of China(60870004)
文摘A novel heuristic search algorithm called seeker op- timization algorithm （SOA） is proposed for the real-parameter optimization. The proposed SOA is based on simulating the act of human searching. In the SOA, search direction is based on empir- ical gradients by evaluating the response to the position changes, while step length is based on uncertainty reasoning by using a simple fuzzy rule. The effectiveness of the SOA is evaluated by using a challenging set of typically complex functions in compari- son to differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms. The simulation results show that the performance of the SOA is superior or comparable to that of the other algorithms.
文摘The Firefly Algorithm(FA)is a highly efficient population-based optimization technique developed by mimicking the flashing behavior of fireflies when mating.This article proposes a method based on Differential Evolution(DE)/current-to-best/1 for enhancing the FA's movement process.The proposed modification increases the global search ability and the convergence rates while maintaining a balance between exploration and exploitation by deploying the global best solution.However,employing the best solution can lead to premature algorithm convergence,but this study handles this issue using a loop adjacent to the algorithm's main loop.Additionally,the suggested algorithm’s sensitivity to the alpha parameter is reduced compared to the original FA.The GbFA surpasses both the original and five-version of enhanced FAs in finding the optimal solution to 30 CEC2014 real parameter benchmark problems with all selected alpha values.Additionally,the CEC 2017 benchmark functions and the eight engineering optimization challenges are also utilized to evaluate GbFA’s efficacy and robustness on real-world problems against several enhanced algorithms.In all cases,GbFA provides the optimal result compared to other methods.Note that the source code of the GbFA algorithm is publicly available at https://www.optim-app.com/projects/gbfa.
文摘A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.
基金This project is supported by Provincial Science Foundation of Hebei (No.01213553).
文摘An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.
文摘Selection, crossover, and mutation are three main operators of the canonical genetic algorithm (CGA). This paper presents a new approach to the genetic algorithm. This new approach applies only to mutation and selection operators. The paper proves that the search process of the non-crossover genetic algorithm (NCGA) is an ergodic homogeneous Markov chain. The proof of its convergence to global optimum is presented. Some nonlinear multi-modal optimization problems are applied to test the efficacy of the NCGA. NP-hard traveling salesman problem (TSP) is cited here as the benchmark problem to test the efficiency of the algorithm. The simulation result shows that NCGA achieves much faster convergence speed than CGA in terms of CPU time. The convergence speed per epoch of NCGA is also faster than that of CGA.
文摘An adaptive genetic algorithm with diversity-guided mutation, which combines adaptive probabilities of crossover and mutation was proposed. By means of homogeneous finite Markov chains, it is proved that adaptive genetic algorithm with diversity-guided mutation and genetic algorithm with diversity-guided mutation converge to the global optimum if they maintain the best solutions, and the convergence of adaptive genetic algorithms with adaptive probabilities of crossover and mutation was studied. The performances of the above algorithms in optimizing several unimodal and multimodal functions were compared. The results show that for multimodal functions the average convergence generation of the adaptive genetic algorithm with diversity-guided mutation is about 900 less than that of (adaptive) genetic algorithm with adaptive probabilities and genetic algorithm with diversity-guided mutation, and the adaptive genetic algorithm with diversity-guided mutation does not lead to premature convergence. It is also shown that the better balance between overcoming premature convergence and quickening convergence speed can be gotten.
文摘A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems and minimization of factor of safety in slope stability analysis. The new algorithm combines the global exploration ability of the GSA to converge rapidly to a near optimum solution. In addition, it uses the accurate local exploitation ability of the SQP to accelerate the search process and find an accurate solution. A set of five well-known benchmark optimization problems was used to validate the performance of the GSA-SQP as a global optimization algorithm and facilitate comparison with the classical GSA. In addition, the effectiveness of the proposed method for slope stability analysis was investigated using three ease studies of slope stability problems from the literature. The factor of safety of earth slopes was evaluated using the Morgenstern-Price method. The numerical experiments demonstrate that the hybrid algorithm converges faster to a significantly more accurate final solution for a variety of benchmark test functions and slope stability problems.
基金supported by Special Fund of Fundamental Scientific Research Business Expense for Higher School of Central Government(ZY20180119)the Natural Science Foundation of Zhejiang Province(LZ22F020005)+1 种基金the Natural Science Foundation of Hebei Province(D2022512001)National Natural Science Foundation of China(42164002,62076185).
文摘The advent of Big Data has rendered Machine Learning tasks more intricate as they frequently involve higher-dimensional data.Feature Selection(FS)methods can abate the complexity of the data and enhance the accuracy,generalizability,and interpretability of models.Meta-heuristic algorithms are often utilized for FS tasks due to their low requirements and efficient performance.This paper introduces an augmented Forensic-Based Investigation algorithm(DCFBI)that incorporates a Dynamic Individual Selection(DIS)and crisscross(CC)mechanism to improve the pursuit phase of the FBI.Moreover,a binary version of DCFBI(BDCFBI)is applied to FS.Experiments conducted on IEEE CEC 2017 with other metaheuristics demonstrate that DCFBI surpasses them in search capability.The influence of different mechanisms on the original FBI is analyzed on benchmark functions,while its scalability is verified by comparing it with the original FBI on benchmarks with varied dimensions.BDCFBI is then applied to 18 real datasets from the UCI machine learning database and the Wieslaw dataset to select near-optimal features,which are then compared with six renowned binary metaheuristics.The results show that BDCFBI can be more competitive than similar methods and acquire a subset of features with superior classification accuracy.
基金Projects(50275150,61173052)supported by the National Natural Science Foundation of China
文摘During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.
文摘A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is very different from the traditional evolutionary algorithm and the two novel features are the unique of selecting strategy and the determination of individuals that are selected to crossover and mutate. We use DEA to solve a lot of global optimization problems that are nonlinear, multimodal and multidimensional and obtain satisfactory results.
基金Natural Science Foundation of Zhejiang Province(LZ22F020005)National Natural Science Foundation of China(42164002,62076185 and,U1809209)National Key R&D Program of China(2018YFC1503806).
文摘Crow Search Algorithm(CSA)is a swarm-based single-objective optimizer proposed in recent years,which tried to inspire the behavior of crows that hide foods in different locations and retrieve them when needed.The original version of the CSA has simple parameters and moderate performance.However,it often tends to converge slowly or get stuck in a locally optimal region due to a missed harmonizing strategy during the exploitation and exploration phases.Therefore,strategies of mutation and crisscross are combined into CSA(CCMSCSA)in this paper to improve the performance and provide an efficient optimizer for various optimization problems.To verify the superiority of CCMSCSA,a set of comparisons has been performed reasonably with some well-established metaheuristics and advanced metaheuristics on 15 benchmark functions.The experimental results expose and verify that the proposed CCMSCSA has meaningfully improved the convergence speed and the ability to jump out of the local optimum.In addition,the scalability of CCMSCSA is analyzed,and the algorithm is applied to several engineering problems in a constrained space and feature selection problems.Experimental results show that the scalability of CCMSCSA has been significantly improved and can find better solutions than its competitors when dealing with combinatorial optimization problems.The proposed CCMSCSA performs well in almost all experimental results.Therefore,we hope the researchers can see it as an effective method for solving constrained and unconstrained optimization problems.
基金supported by the National Natural Science Foundation of China (10832004 and 10672084).
文摘Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a celestial body. Some optimal trajectories ofEJS, EMS, EVEJS and EVVEJS flying sequences are obtained using five global optimization algorithms： DE, PSO, DP, the hybrid algorithm PSODE and another hybrid algorithm, DPDE. DE is proved to be supe- rior to other non-hybrid algorithms in the trajectory optimi- zation problem. The hybrid algorithm of PSO and DE can improve the optimization performance of DE, which is vali- dated by the mission to Saturn with given swingby sequences. Finally, the optimization results of four different swingby sequences are compared with those of the ACT of ESA.
文摘Evolutionary computation is a kind of adaptive non--numerical computation method which is designed tosimulate evolution of nature. In this paper, evolutionary algorithm behavior is described in terms of theconstruction and evolution of the sampling distributions over the space of candidate solutions. Iterativeconstruction of the sampling distributions is based on the idea of the global random search of generationalmethods. Under this frame, propontional selection is characterized as a gobal search operator, and recombination is characerized as the search process that exploits similarities. It is shown-that by properly constraining the search breadth of recombination operators, weak convergence of evolutionary algorithms to aglobal optimum can be ensured.
文摘In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we prove that the pure random search converges to the global minimum in probability and its time has geometry distribution. We also analyze the pure adaptive search by this framework and turn out that the pure adaptive search converges to the global minimum in probability and its time has Poisson distribution.
文摘This paper presents a new stochastic algorithm for box constrained global optimization problem. Bacause the level set of objective function is always not known, the authors designed a region containing the current minimum point to replace it, and in order to fit the level set well, this region would be walking and contracting in the running process. Thus, the new algorithm is named as region's walk and contraction(RWC). Some numerical experiments for the RWC were conducted, which indicate good property of the algorithm.
基金Project supported by the National Natural Science Foundation of China (No. 60105003) and the Natural Science Foundation of Zhejiang Province (No. 600025), China
文摘Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network model of environmental information in the workspace for a robot and used this model to establish the relationship between a collision avoidance path and the output of the model. Then the two-dimensional coding for the path via-points was converted to one-dimensional one and the fitness of both the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results showed that the proposed method is correct and effective.
文摘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.
基金the Science and Technology Planning Project of Hunan Province(No.2011TP4016-3)the Construct Program of the Key Discipline(Technology of Computer Application)in Xiangnan University
文摘A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.
基金Supported by the National Natural Science Foundation of China(11871383,71471140)。
文摘In order to solve the problem that the krill herd(KH)algorithm is premature due to the decrease of population diversity,a new hybrid vortex search KH(VSKH)algorithm has been developed to deal with the global optimization problem.The improvement is that a new hybrid vortex search(HVS)operator is added into the updating process of the krill for the purpose of dealing with optimization problems more efficiently.Using 20 benchmark functions for comparison experiments,the results show that the VSKH algorithm has higher accuracy.
基金Supported by National Natural Science Foundation of P.R.China(50275150)National Research Foundation for the Doctoral Program of Higher Education of P.R.China(20040533035)
