Locus Oriented Adaptive Genetic Algorithm: Application to the Zero/One Knapsack Problem
نویسندگان
چکیده
The biological observation of the difference in the mutation rates of allele on different loci is implemented in genetic algorithm so that the mutation rate is both time and locus dependent. The performance of this new locus oriented adaptive genetic algorithm (LOAGA) is evaluated on the test problem of zero/one knapsack for various sizes. It is found that LOAGA can solve the single constraint zero/one knapsack with high speed, high success rate, and small memory requirement. A heuristic argument is given to show how the statistical information inside the population can be used to tune the mutation rate at individual locus, resulting in higher overall performance.
منابع مشابه
Adaptive Genetic Algorithm and Quasi-parallel Genetic Algorithm: Application to Knapsack Problem
A new adaptive genetic algorithm using mutation matrix is introduced and implemented in a single computer using the quasi-parallel time sharing algorithm for the solution of the zero/one knapsack problem. The mutation matrix M(t) is constructed using the locus statistics and the fitness distribution in a population A(t) with N rows and L columns, where N is the size of the population and L is t...
متن کاملMutation Matrix in Evolutionary Computation: An Application to Resource Allocation Problem
A new approach to evolutionary computation with mutation only is developed by the introduction of the mutation matrix. The method of construction of the mutation matrix is problem independent and the selection mechanism is achieved implicitly by individualized and locus specific mutation probability based on the information on locus statistics and fitness of the population, and traditional gene...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملAdaptive mutation rate control schemes in genetic algorithms
Abstract The adaptation of mutation rate parameter values is important to allow the search process to optimize its performance during run time. In addition it frees the user of the need to make non-trivial decisions beforehand. Contrary to real vector coded genotypes, for discrete genotypes most users still prefer to use a fixed mutation rate. Here we propose two simple adaptive mutation rate c...
متن کاملAdaptive Genetic Algorithm with Mutation and Crossover Matrices
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the sense that the problem at a particular stage of evolution will choose the parameters automatically. This time dependent selection process was first developed in MOGA (mutation only genetic algorithm) [Szeto and Zhang, 20...
متن کامل