In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objectiv...In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.展开更多
Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select...Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.展开更多
An improved genetic algorithm for searching optimal parameters in n-dimensional space is presented, which encodes movement direction and distance and searches from coarse to precise. The algorithm can realize global o...An improved genetic algorithm for searching optimal parameters in n-dimensional space is presented, which encodes movement direction and distance and searches from coarse to precise. The algorithm can realize global optimization and improve the search efficiency, and can be applied effectively in industrial optimization, data mining and pattern recognition.展开更多
The underground water quality model with non-linear inversion problem is ill-posed, and boils down to solving the minimum of nonlinear function. Genetic algorithms are adopted in a number of individuals of groups by i...The underground water quality model with non-linear inversion problem is ill-posed, and boils down to solving the minimum of nonlinear function. Genetic algorithms are adopted in a number of individuals of groups by iterative search to find the optimal solution of the problem, the encoding strings as its operational objective, and achieving the iterative calculations by the genetic operators. It is an effective method of inverse problems of groundwater, with incomparable advantages and practical significances.展开更多
This paper discusses the convergence rates about a class of evolutionary algorithms in general search spaces by means of the ergodic theory in Markov chain and some techniques in Banach algebra. Under certain conditio...This paper discusses the convergence rates about a class of evolutionary algorithms in general search spaces by means of the ergodic theory in Markov chain and some techniques in Banach algebra. Under certain conditions that transition probability functions of Markov chains corresponding to evolutionary algorithms satisfy, the authors obtain the convergence rates of the exponential order. Furthermore, they also analyze the characteristics of the conditions which can be met by genetic operators and selection strategies.展开更多
This paper is concerned with evolving objects method for software design that can adapt to the changing environments and requirements automatically. We present system architecture with objects library, where there are...This paper is concerned with evolving objects method for software design that can adapt to the changing environments and requirements automatically. We present system architecture with objects library, where there are objects based on domain ontologies. We define some genetic operators for objects, and discuss how to apply these genetic operators on objects to get new objects, which can satisfy new requirements.展开更多
文摘In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.
文摘Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.
文摘An improved genetic algorithm for searching optimal parameters in n-dimensional space is presented, which encodes movement direction and distance and searches from coarse to precise. The algorithm can realize global optimization and improve the search efficiency, and can be applied effectively in industrial optimization, data mining and pattern recognition.
文摘The underground water quality model with non-linear inversion problem is ill-posed, and boils down to solving the minimum of nonlinear function. Genetic algorithms are adopted in a number of individuals of groups by iterative search to find the optimal solution of the problem, the encoding strings as its operational objective, and achieving the iterative calculations by the genetic operators. It is an effective method of inverse problems of groundwater, with incomparable advantages and practical significances.
基金This work is supported by the National Natural Science Foundation of ChinaVisiting Scholar Foundation of Key Lab, in Univers
文摘This paper discusses the convergence rates about a class of evolutionary algorithms in general search spaces by means of the ergodic theory in Markov chain and some techniques in Banach algebra. Under certain conditions that transition probability functions of Markov chains corresponding to evolutionary algorithms satisfy, the authors obtain the convergence rates of the exponential order. Furthermore, they also analyze the characteristics of the conditions which can be met by genetic operators and selection strategies.
文摘This paper is concerned with evolving objects method for software design that can adapt to the changing environments and requirements automatically. We present system architecture with objects library, where there are objects based on domain ontologies. We define some genetic operators for objects, and discuss how to apply these genetic operators on objects to get new objects, which can satisfy new requirements.
