scholarly journals The lightweight genetic search algorithm: an efficient genetic algorithm for small search range problems

2002 ◽  
Author(s):  
Chun-Hung Lin ◽  
Ja-Ling Wu
Keyword(s):  
Genetic Algorithm ◽  
Search Algorithm ◽  
Search Range ◽  
Genetic Search ◽  
Genetic Search Algorithm

Based on GA Mixed with Trust Region Method Solving Nonlinear Least Square Problems

2011 ◽  
Vol 141 ◽  
pp. 92-97
Author(s):  
Miao Hu ◽  
Tai Yong Wang ◽  
Bo Geng ◽  
Qi Chen Wang ◽  
Dian Peng Li
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Trust Region Method ◽  
Trust Region ◽  
Least Square ◽  
Search Range ◽  
Genetic Search ◽  
Region Method ◽  
Unconstrained Optimization Problems ◽  
Least Square Problems

Nonlinear least square is one of the unconstrained optimization problems. In order to solve the least square trust region sub-problem, a genetic algorithm (GA) of global convergence was applied, and the premature convergence of genetic algorithms was also overcome through optimizing the search range of GA with trust region method (TRM), and the convergence rate of genetic algorithm was increased by the randomness of the genetic search. Finally, an example of banana function was established to verify the GA, and the results show the practicability and precision of this algorithm.

An Improved Genetic Algorithm of Web Services Composition with QOS

2012 ◽  
Vol 532-533 ◽  
pp. 1836-1840 ◽  
Author(s):  
Yan Yan Zhang ◽  
Hai Ling Xiong ◽  
Yong Chun Zhang
Keyword(s):  
Genetic Algorithm ◽  
Web Services ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Experimental Result ◽  
Web Services Composition ◽  
Improved Genetic Algorithm ◽  
Search Range ◽  
Services Composition ◽  
Fitness Value

A web service composition method based on the adaptive genetic operator was proposed to deal with the issues of the lack of adaptability and the easy-premature phenomena in web services composition genetic algorithm. Adaptive crossover and mutation operator were designed according to the individual adaptability and evolution stage for enlarging local search range and increasing convergent speed. Moreover, use for reference the idea of taboo table in taboo search algorithm, we can inhibit the algorithm from converging to false optimal solution untimely; meanwhile, an evolution strategy was adopted to prevent the loss of composite service with high fitness value. The experimental result shows that better composite services can be gotten through the improved algorithm; moreover the convergence speed has also been improved.

Structures, stabilities and aromatic properties of endohedrally transition metal doped boron clusters M@B22, M = Sc and Ti: a theoretical study

2020 ◽  
Vol 22 (15) ◽  
pp. 8077-8087 ◽  
Author(s):  
Christian A. Celaya ◽  
Fernando Buendía ◽  
Alan Miralrio ◽  
Lauro Oliver Paz-Borbón ◽  
Marcela Beltran ◽  
...  
Keyword(s):  
Density Functional Theory ◽  
Density Functional ◽  
Theoretical Study ◽  
Search Algorithm ◽  
Density Functional Theory Calculations ◽  
Functional Theory ◽  
Genetic Search ◽  
Boron Clusters ◽  
Metal Doped ◽  
Genetic Search Algorithm

A genetic search algorithm in conjunction with density functional theory calculations was used to determine the lowest-energy minima of the pure B22 cluster and thereby to evaluate the capacity of its isomers to form endohedrally doped cages.

Sign in / Sign up

Export Citation Format

Share Document