This paper proposes a variant of genetic algorithm – GADYM, Genetic Algorithm with Gender-Age structure, DYnamic parameter tuning and Mandatory self perfection scheme. The motivation of this algorithm is to increase the diversity throughout the search procedure and to ease the difficulties associated with the tuning of GA parameters and operators. To promote diversity, GADYM combines the concep...

The genetic algorithm (GA) is an optimization and search technique based on the principles of genetics and natural selection. A GA allows a population composed of many individuals to evolve under specified selection rules to a state that maximizes the “fitness” function. In that process, crossover operator plays an important role. To comprehend the GAs as a whole, it is necessary to understand ...

In some multi-attribute decision making (MADM) problems, various relationships among the decision attributes should be considered. This paper investigates the prioritization relationship of attributes in MADM with trapezoidal intuitionistic fuzzy numbers (TrIFNs). TrIFNs are a special intuitionistic fuzzy set on a real number set and have the better capability to model ill-known quantities. Fir...

The problem of teacher placement in a school is faced by Magelang Regency. success determined the minimum total distance between and school, with aim that performance maintained. In computer science this an NP-hard takes very long time to achieve optimal results when done conventional methods. Another approach solve use heuristic algorithms, one which using genetic algorithms. To further improv...

in this paper we develop a natural generalization of schauder basis theory, we term operator-valued basis or simply ov-basis theory, using operator-algebraic methods. we prove several results for ov-basis concerning duality, orthogonality, biorthogonality and minimality. we prove that the operators of a dual ov-basis are continuous. we also de ne the concepts of bessel, hilbert ov-basis and obt...

Starting from a mathematical reinterpretation of the classical crossover operator, a new type of crossover is introduced. The proposed new crossover operator gives better performances than the classical 1 point, 2 point or uniform crossover operators. In the paper a theorical investigation of the behaviour of the new crossover is presented. In comparison to the classical crossover operator, it ...

Starting from a mathematical reinterpretation of the classical crossover operator, a new type of crossover is introduced. The proposed new crossover operator gives better performances than the classical 1 point, 2 point or uniform crossover operators. In the paper a theorical investigation of the behaviour of the new crossover is presented. In comparison to the classical crossover operator, it ...

In this paper an evolutionary technique for detecting hierarchical structure of a data set is considered [4]. A linear representation of the cluster structure within the data set is used. An evolutionary algorithm evolves a population of clustering hierarchies. Proposed algorithm uses mutation and crossover as search (variation) operators. Binary tournament selection is considered. A new crosso...

This paper presents some experimental results and analyses of the gene invariant genetic algorithm(GIGA). Although a subclass of the class of genetic algorithms, this algorithm and its variations represent a unique approach with many interesting results. The primary distinguishing feature is that when a pair of oospring are created and chosen as worthy of membership in the population they repla...

Problem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied through different approaches, according to the theoretical development of combinatorial optimization. Approach: In this study, modified evolutionary algorithm was presented for 0/1 knapsack problem. Results: A new objective_func_evaluation operator was proposed which ...