A Statistical Model of GA Dynamics for the OneMax Problem
نویسندگان
چکیده
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to describe the dynamics of the problem for all time, using a variety of crossover and mutation rates. The model is very practical and can be generalized to cover other cases of the OneMax, such as weighted OneMax, as well as the deceptive function problem, for high enough crossover rates. Proportional selection with and without Boltzmann scaling have been modeled; however the Boltzmann extensions are not described here. In the development of the model, we introduce a new quantity that measures the effect of the crossover operation in the counting-ones problem and is independent of generation, for practical purposes.
منابع مشابه
Population Sizing for Optimum Sampling with Genetic Algorithms: A Case Study of the Onemax Problem
An experimental and analytical investigation of sampling, which focused on the sizing of population for optimum performance, was performed using the OneMax problem. A fixed-size population and population sizes that vary according to the number of samples were considered in this study. For the case of varying population sizes, population sizing models that ensure proper decision making of the GA...
متن کاملA Multi-objective Mixed Model Two-sided Assembly Line Sequencing Problem in a Make –To- Order Environment with Customer Order Prioritization
Mixed model two-sided assembly lines (MM2SAL) are applied to assemble large product models, which is produced in high-volume. So, the sequence planning of products to reduce cost and increase productivity in this kind of lines is imperative. The presented problem is tackled in two steps. In step 1, a framework is developed to select and prioritize customer orders under the finite capacity of th...
متن کاملThe Crossover Landscape for the Onemax Problem
In seeking to understand how and why genetic algorithms (GAs) work, attention has been focussed on the landscapes on which they search. While it is relatively simple to analyse the landscapes induced by traditional neighbourhood search operators, the position is considerably complicated for the operators normally used by a GA. Problems which have a single global optimum on a standard`Hamming' l...
متن کاملLZW Encoding in Genetic Algorithm
To solve a problem using Genetic Algorithms (GAs), a solution must be encoded into a binary string. The length of the binary string represents the size of the problem. As the length of the binary string increases, the size of the search space also increases at an exponential rate. To reduce the search space, one approach is to use a compressed encoding chromosome. This paper presents a genetic ...
متن کاملA GA Model Development for Decision Making Under Reverse Logistics
Managing products’ end-of-life and recovery of used products is gaining significant importance during last years. Therefore, managing the reverse flow of products can be an important potential for winning consumers in future competitive markets. In this context, establishing reverse logistics networks is becoming a main problem in reverse supply chains. Genetic Algorithm (GA) is utilized to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004