Many genetic algorithms GA have been applied to solve different NP-complete combinatorial optimization problems so far. The striking point of using GA refers to selecting a combination of appropriate patterns in crossover, mutation, and and so forth and fine tuning of some parameters such as crossover probability, mutation probability, and and so forth. One way to design a robust GA is to selec...

The noncentrosomal cortical microtubules (CMTs) of land plants form highly ordered parallel arrays that mediate cell morphogenesis by orienting cellulose deposition. Since new CMTs initiate from dispersed cortical sites at random orientations, parallel array organization is hypothesized to require selective pruning of CMTs that are not in the dominant orientation. Severing of CMTs at crossover ...

This paper presents an ‘adaptive probability of crossover’ technique, as a variation of the differential evolution algorithm (ACDE), for optimal parameter estimation in the general curve-fitting problem. The technique is applied to the determination of orbital elements of a spectroscopic binary system (eta Bootis). In the ACDE, Varying the crossover probability rate (Cr) provides faster converg...

Genetic Algorithms (GAs) emulate the natural evolution process and maintain a population of potential solutions to a given problem. Through the population, GAs implicitly maintain the statistics about the search space. This implicit statistics can be used explicitly to enhance GA’s performance. Inspired by this idea, a statistics-based adaptive non-uniform crossover (SANUX) has been proposed. S...

With the birth of DNA computing, Paun et al. proposed an elegant algorithm to this problem based on the sticky model proposed by Roweis. However, the drawback of this algorithm is that the “exponential curse” is hard to overcome, and therefore its application to large instance is limited. In this s paper, we present a DNA based evolutionary algorithm to solve this problem, which takes advantage...

Using Monte Carlo simulations, we determine the scaling form for the probability distribution of the shortest path l between two lines in a three-dimensional percolation system at criticality; the two lines can have arbitrary positions, orientations, and lengths. We find that the probability distributions can exhibit up to four distinct power-law regimes (separated by crossover regimes) with ex...

In this paper, an improved genetic algorithm for multi-object optimization is proposed. Simulated annealing is used to local search in genetic algorithms. Furthermore, fuzzy reasoning is adopted to modify crossover probability and mutation probability according to characteristics of population in genetic algorithms instead of fixed parameters. And so, it can be convergence to global optimum qui...

The analytical theory of one dimensional, dispersion free miscible displacement of oil by injection gas with nc component has shown that: the MMP is the lowest pressure at which any one of the initial oil, injection gas or crossover key tie lines becomes critical, which means that its length approaches to zero. In this paper, we propose a method for a solving multi component syst...

The thermodynamic properties of fluids can be predicted using the global equations of state. Among these thermodynamic properties of fluids, we choose the densities of the liquid and vapor phases. This paper considers the application of the crossover model to the vapor-liquid rectilinear diameter of sulfurhexafluoride. We also present a comparison of the crossover model equation with ...

the thermodynamic properties of fluids can be predicted using the global equations of state. among these thermodynamic properties of fluids, we choose the densities of the liquid and vapor phases. this paper considers the application of the crossover model to the vapor-liquid rectilinear diameter of sulfurhexafluoride. we also present a comparison of the crossover model equation with the experi...