Dimensional crossover in the Kondo necklace model is analyzed using the bond-operator method at zero and finite temperatures. Explicit relations describing quasi-two-dimensional properties are obtained by asymptotically solving the resulting equations. The crossover from two dimensions (2d) to three dimensions (3d) is investigated, turning on the electronic hopping ([Formula: see text]) of cond...

Proper coloring of the vertices of a graph with minimum number of colors has always been of great interest of researchers in the field of soft computing. Genetic Algorithm (GA) and its application as the solution method to the Graph Coloring problem have been appreciated and worked upon by the scientists almost for the last two decades. Various genetic operators such as crossover and mutation h...

This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance measures is a crucial point for analytical measures of problem difficulty, such as fitness distance correlation, and for measures of population diversity, such as entropy or variance. The contribution of this paper is the explorat...

In this work Traveling salesperson problem is taken as Domain. TSP has long been known to be NP-complete and is a standard example of such problems. Genetic Algorithm (GA) is an approximate algorithm that doesn’t always aim to find the shortest tour but to find a reasonably short tour quickly, which is a search procedure inspired by the mechanisms of biological evolution. In genetic algorithms,...

In this paper a new general schema theory for genetic programming is presented. Like other recent GP schema theory results (Poli 2000a, Poli 2000b), the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system which makes it possible to describe programs as func...

The genetic algorithm (GA) based solution techniques are found suitable for optimization because of their ability of simultaneous multidimensional search. Many GA-variants have been tried in the past to solve optimal power flow (OPF), one of the nonlinear problems of electric power system. The issues like convergence speed and accuracy of the optimal solution obtained after number of generation...

The purpose of this paper is to introduce several basic theorems of coherent states and generalized coherent states based on Lie algebras su(2) and su(1,1), and to give some applications of them to quantum information theory for graduate students or non–experts who are interested in both Geometry and Quantum Information Theory. In the first half we make a general review of coherent states and g...

Previous studies have shown that hitchhiking in standard GAs can cause premature convergence. In this study we show that hitchhiking also occurs in adaptive operators, specifically, selective crossover an adaptive recombination operator. We compare selective crossover with uniform crossover (a highly disruptive operator) and show that although selective crossover favours hitchhikers more than u...

This paper considers deception in the context of ordering genetic algorithms (GAs). Order-four deceptive ordering problems are designed for absolute and relative ordering decoding. Three different crossover operators are used in both absolute and relative ordering problems, and for each combination of crossover operator and coding, the schema survival probability is calculated. Simulation resul...