In this paper, we propose simulated binary crossover with lognormal probability distribution (SBX-l), a new recombination operator for real-coded GAs. It is a parent-centric operator uses lognormal distribution for spread factor. SBX-l operator with rigid and flexible bound is proposed. Experimental results using test functions, which are commonly used in studies of evolutionary algorithms, are...

This letter presents a simple method to simultaneously optimize a multiplicity of design parameters for the adaptive automatic repeat request strategy previously reported, and subsequently provides a quantitative measurement that reflects the appropriateness of the selected parameters. An exact analytical expression that allows us to compute the throughput crossover probability between the two ...

This paper presents an improved multi-objective evolutionary algorithm (IMOEA) for the design of planar steel frames. By considering constraints as a new objective function, single objective optimization problems turned to multi objective optimization problems. To increase efficiency of IMOEA different Crossover and Mutation are employed. Also to avoid local optima dynamic interference of mutat...

Traveling Salesman Problem (TSP) is an NP-hard Problem, which has many different real life applications. Genetic Algorithms (GA) are robust and probabilistic search algorithms based on the mechanics of natural selection and survival of the fittest that is used to solve optimization and many real life problems. This paper presents Genetic Algorithm for TSP. Moreover it also shows best suitable p...

In the context of Distributed Joint Source-Channel coding (DJSC), we conceive reduced-complexity Turbo Trellis Coded Modulation (TTCM)-aided syndrome-based block decoding for estimating the crossover probability pe of the Binary Symmetric Channel (BSC), which models the correlation between a pair of sources. Our joint decoder achieves an accurate correlation estimation for varying correlation c...

An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number of simulation runs and compared with other algorithms. The experimental results show that the improv...

BACKGROUND In the Superior Yield of the New Strategy of Enoxaparin, Revascularization, and Glycoprotein IIb/IIIa Inhibitors (SYNERGY) study, patients assigned enoxaparin or unfractionated heparin (UFH) were treated with alternative anticoagulant therapy after randomization at physician discretion, a practice made possible because the trial was open label. Using SYNERGY as an example, we demonst...

Computer-aided process planning represents the main link between computer-aided design and manufacturing. One of crucial tasks in is an operation sequencing problem. In order to find optimal plan, problem formulated as NP hard combinatorial To solve this problem, a novel genetic crow search approach (GCSA) proposed paper. The traditional CSA improved by employing strategies such tournament sele...

The benefits of using crossover in crossing fitness gaps have been studied extensively evolutionary computation. Recent runtime results show that majority-vote is particularly efficient at optimizing the well-known Jump benchmark function includes a gap next to global optimum. Also estimation-of-distribution algorithms (EDAs), which use an implicit crossover, are much more on than typical mutat...

We study the finite-size behavior of two-dimensional spin-glass models. We consider the ±J model for two different values of the probability of the antiferromagnetic bonds and the model with Gaussian distributed couplings. The analysis of renormalization-group invariant quantities, the overlap susceptibility, and the two-point correlation function confirms that they belong to the same universal...