Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes...Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes.It uses a crossover operator to create better offspring chromosomes and thus,converges the population.Also,it uses a mutation operator to explore the unexplored areas by the crossover operator,and thus,diversifies the GA search space.A combination of crossover and mutation operators makes the GA search strong enough to reach the optimal solution.However,appropriate selection and combination of crossover operator and mutation operator can lead to a very good GA for solving an optimization problem.In this present paper,we aim to study the benchmark traveling salesman problem(TSP).We developed several genetic algorithms using seven crossover operators and six mutation operators for the TSP and then compared them to some benchmark TSPLIB instances.The experimental studies show the effectiveness of the combination of a comprehensive sequential constructive crossover operator and insertion mutation operator for the problem.The GA using the comprehensive sequential constructive crossover with insertion mutation could find average solutions whose average percentage of excesses from the best-known solutions are between 0.22 and 14.94 for our experimented problem instances.展开更多
The mutation operator has been seldom improved because researchers hardly suspect its ability to prevent genetic algorithm (GA) from converging prematurely. Due to its importance to GA, the authors of this paper study...The mutation operator has been seldom improved because researchers hardly suspect its ability to prevent genetic algorithm (GA) from converging prematurely. Due to its importance to GA, the authors of this paper study its influence on the diversity of genes in the same locus, and point out that traditional mutation, to some extent, can result in premature convergence of genes (PCG) in the same locus. The above drawback of the traditional mutation operator causes the loss of critical alleles. Inspired by digital technique, we introduce two kinds of boolean operation into GA to develop a novel mutation operator and discuss its contribution to preventing the loss of critical alleles. The experimental results of function optimization show that the improved mutation operator can effectively prevent premature convergence, and can provide a wide selection range of control parameters for GA.展开更多
Let G be a locally compact Vilenkin gro up . We will establish the boundedness in Morrey spaces L p,λ (G) for a la rge class of sublinear operators and linear commutators.
In artificial immune optimization algorithm, the mutation of immune cells has been considered as the key operator that determines the algorithm performance. Traditional immune optimization algorithms have used a singl...In artificial immune optimization algorithm, the mutation of immune cells has been considered as the key operator that determines the algorithm performance. Traditional immune optimization algorithms have used a single mutation operator, typically a Gaussian. Using a variety of mutation operators that can be combined during evolution to generate different probability density function could hold the potential for producing better solutions with less computational effort. In view of this, a linear combination mutation operator of Gaussian and Cauchy mutation is presented in this paper, and a novel clonal selection optimization method based on clonal selection principle is proposed also. The simulation results show the combining mutation strategy can obtain the same performance as the best of pure strategies or even better in some cases.展开更多
The strong type and weak type estimates of parameterized Littlewood-Paley operators on the weighted Herz spaces Kq α,p（ω1,ω2） are considered. The boundednessof the commutators generated by BMO functions and param...The strong type and weak type estimates of parameterized Littlewood-Paley operators on the weighted Herz spaces Kq α,p（ω1,ω2） are considered. The boundednessof the commutators generated by BMO functions and parameterized Littlewood-Paley operators are also obtained.展开更多
To deal with the radio frequency threat posed by modern complex radar networks to aircraft,we researched the unmanned aerial vehicle(UAV)formations radar countermeasures,aiming at the solution of radar jamming resourc...To deal with the radio frequency threat posed by modern complex radar networks to aircraft,we researched the unmanned aerial vehicle(UAV)formations radar countermeasures,aiming at the solution of radar jamming resource allocation under system countermeasures.A jamming resource allocation method based on an improved firefly algorithm(FA)is proposed.Firstly,the comprehensive factors affecting the level of threat and interference efficiency of radiation source are quantified by a fuzzy comprehensive evaluation.Besides,the interference efficiency matrix and the objective function of the allocation model are determined to establish the interference resource allocation model.Finally,A mutation operator and an adaptive heuristic are integtated into the FA algorithm,which searches an interference resource allocation scheme.The simulation results show that the improved FA algorithm can compensate for the deficiencies of the FA algorithm.The improved FA algorithm provides a more scientific and reasonable decision-making plan for aircraft mission allocation and can effectively deal with the battlefield threats of the enemy radar network.Moreover,in terms of convergence accuracy and speed as well as algorithm stability,the improved FA algorithm is superior to the simulated annealing algorithm(SA),the niche genetic algorithm(NGA),the improved discrete cuckoo algorithm(IDCS),the mutant firefly algorithm(MFA),the cuckoo search and fireflies algorithm(CSFA),and the best neighbor firefly algorithm(BNFA).展开更多
This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear c...This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear characteristics of the generators, such as prohibited operating zones, ramp rate limits and non-smooth cost functions of the practical generator operation are considered. The proposed hybrid algorithm is demonstrated for three different systems and the performance is compared with the GA and PSO in terms of solution quality and computation efficiency. Comparison of results proved that the proposed algo- rithm can obtain higher quality solutions efficiently in ED problems. A comprehensive software package is developed using MATLAB.展开更多
基金the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University(IMSIU)(Grant Number IMSIU-RP23030).
文摘Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes.It uses a crossover operator to create better offspring chromosomes and thus,converges the population.Also,it uses a mutation operator to explore the unexplored areas by the crossover operator,and thus,diversifies the GA search space.A combination of crossover and mutation operators makes the GA search strong enough to reach the optimal solution.However,appropriate selection and combination of crossover operator and mutation operator can lead to a very good GA for solving an optimization problem.In this present paper,we aim to study the benchmark traveling salesman problem(TSP).We developed several genetic algorithms using seven crossover operators and six mutation operators for the TSP and then compared them to some benchmark TSPLIB instances.The experimental studies show the effectiveness of the combination of a comprehensive sequential constructive crossover operator and insertion mutation operator for the problem.The GA using the comprehensive sequential constructive crossover with insertion mutation could find average solutions whose average percentage of excesses from the best-known solutions are between 0.22 and 14.94 for our experimented problem instances.
文摘The mutation operator has been seldom improved because researchers hardly suspect its ability to prevent genetic algorithm (GA) from converging prematurely. Due to its importance to GA, the authors of this paper study its influence on the diversity of genes in the same locus, and point out that traditional mutation, to some extent, can result in premature convergence of genes (PCG) in the same locus. The above drawback of the traditional mutation operator causes the loss of critical alleles. Inspired by digital technique, we introduce two kinds of boolean operation into GA to develop a novel mutation operator and discuss its contribution to preventing the loss of critical alleles. The experimental results of function optimization show that the improved mutation operator can effectively prevent premature convergence, and can provide a wide selection range of control parameters for GA.
文摘Let G be a locally compact Vilenkin gro up . We will establish the boundedness in Morrey spaces L p,λ (G) for a la rge class of sublinear operators and linear commutators.
基金This work was supported by the National Natural Science Foundation of China (No50335030)
文摘In artificial immune optimization algorithm, the mutation of immune cells has been considered as the key operator that determines the algorithm performance. Traditional immune optimization algorithms have used a single mutation operator, typically a Gaussian. Using a variety of mutation operators that can be combined during evolution to generate different probability density function could hold the potential for producing better solutions with less computational effort. In view of this, a linear combination mutation operator of Gaussian and Cauchy mutation is presented in this paper, and a novel clonal selection optimization method based on clonal selection principle is proposed also. The simulation results show the combining mutation strategy can obtain the same performance as the best of pure strategies or even better in some cases.
文摘The strong type and weak type estimates of parameterized Littlewood-Paley operators on the weighted Herz spaces Kq α,p（ω1,ω2） are considered. The boundednessof the commutators generated by BMO functions and parameterized Littlewood-Paley operators are also obtained.
文摘To deal with the radio frequency threat posed by modern complex radar networks to aircraft,we researched the unmanned aerial vehicle(UAV)formations radar countermeasures,aiming at the solution of radar jamming resource allocation under system countermeasures.A jamming resource allocation method based on an improved firefly algorithm(FA)is proposed.Firstly,the comprehensive factors affecting the level of threat and interference efficiency of radiation source are quantified by a fuzzy comprehensive evaluation.Besides,the interference efficiency matrix and the objective function of the allocation model are determined to establish the interference resource allocation model.Finally,A mutation operator and an adaptive heuristic are integtated into the FA algorithm,which searches an interference resource allocation scheme.The simulation results show that the improved FA algorithm can compensate for the deficiencies of the FA algorithm.The improved FA algorithm provides a more scientific and reasonable decision-making plan for aircraft mission allocation and can effectively deal with the battlefield threats of the enemy radar network.Moreover,in terms of convergence accuracy and speed as well as algorithm stability,the improved FA algorithm is superior to the simulated annealing algorithm(SA),the niche genetic algorithm(NGA),the improved discrete cuckoo algorithm(IDCS),the mutant firefly algorithm(MFA),the cuckoo search and fireflies algorithm(CSFA),and the best neighbor firefly algorithm(BNFA).
文摘This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear characteristics of the generators, such as prohibited operating zones, ramp rate limits and non-smooth cost functions of the practical generator operation are considered. The proposed hybrid algorithm is demonstrated for three different systems and the performance is compared with the GA and PSO in terms of solution quality and computation efficiency. Comparison of results proved that the proposed algo- rithm can obtain higher quality solutions efficiently in ED problems. A comprehensive software package is developed using MATLAB.
