The breeder genetic algorithm (BGA) models artificial selection as performed by human breeders. T... more The breeder genetic algorithm (BGA) models artificial selection as performed by human breeders. The science of breeding is based on advanced statistical methods. In this paper a connection between genetic algorithm theory and the science of breeding is made. We show how the response to selection equation and the concept of heritability can be applied to predict the behavior of the BGA. Selection, recombination, and mutation are analyzed within this framework. It is shown that recombination and mutation are complementary search operators. The theoretical results are obtained under the assumption of additive gene effects. For general fitness landscapes, regression techniques for estimating the heritability are used to analyze and control the BGA. The method of decomposing the genetic variance into an additive and a nonadditive part connects the case of additive fitness functions with the general case.
Theoretical biology has largely ignored Darwin 's true evolution model. In his famous book about ... more Theoretical biology has largely ignored Darwin 's true evolution model. In his famous book about the origin of species, Darwin detailed th e importance of a populati on structure on evolution. He conjectured that a large continent that exists for long periods in a broken condition will be th e most favorable for th e production of many new forms of life. We call this conject ure Darwin 's continent cycle theory. In this paper we investigate some of Darwin 's arguments in support of his th eory by simulat ing an art ificial ecology wit h the parallel genetic algorithm. Th e art ificial ecology consists of a populat ion playing th e It erated Pri soner's Dilemma. Th e major emphasis of this paper is on the meth odological questions of t he simulation. These are th e genet ic represent ation, the mapping of the genoty pes to phenotypes, and th e spatial population st ructure.
The dilute king model with a p = 0.8 fraction of the sites occupied by spins is simulated on L3 s... more The dilute king model with a p = 0.8 fraction of the sites occupied by spins is simulated on L3 systems for L up to 300, using a single-cluster algorithm of Wolff. In the range of reduced temperature 0.002 < (T -I",)/ I', < 0.03 the susceptibility appears to fit a simple power with an effective exponent yerr = 1.36.
We give a short introduction to the results of our theoretical analysis of evolutionary algorithm... more We give a short introduction to the results of our theoretical analysis of evolutionary algorithms. These results are used to design an algorithm for a large real-world problem: the placement of antennas for mobile radio networks. Our model for the antenna placement problem (APP) addresses cover, traffic demand, interference, different parameterized antenna types, and the geometrical structure of cells. The
ABSTRACT We present a parallel genetic algorithm for the k way graph partitioning problem. The al... more ABSTRACT We present a parallel genetic algorithm for the k way graph partitioning problem. The algorithm uses selection in local neighborhood and sophisticated genetic operators. For a sample problem the algorithm has found better solutions than those found by recent GPP algorithms. The success of the parallel genetic algorithm depends on the representation, a suitable crossover operator and an efficient local hill climbing method which is used to restrict the solution space.
We investigate the spatial distribution and the global frequency of agents who can either coopera... more We investigate the spatial distribution and the global frequency of agents who can either cooperate or defect. The agent interaction is described by a deterministic, non-iterated prisoner's dilemma game, further each agent only locally interacts with his neighbors. Based on a detailed analysis of the local payoff structures we derive critical conditions for the invasion or the spatial coexistence of cooperators and defectors. These results are concluded in a phase diagram that allows to identify five regimes, each characterized by a distinct spatiotemporal dynamics and a corresponding final spatial structure. In addition to the complete invasion of defectors, we find coexistence regimes with either a majority of cooperators in large spatial domains, or a minority of cooperators organized in small non-stationary domains or in small clusters. The analysis further allowed a verification of computer simulation results by . Eventually, we present simulation results of a true 5-person game on a lattice. This modification leads to non-uniform spatial interactions that may even enhance the effect of cooperation.
An efficient and systematic LL(1) error recovery method is presented that has been implemented fo... more An efficient and systematic LL(1) error recovery method is presented that has been implemented for an LL( 1) parser generator. Error messages which provide good diagnostic information are generated automatically. Error correction is done by discarding some input symbols and popping up some symbols from the parsing-stack in order to restore the parser to a valid configuration. Thus, symbol deletions and insertions are simulated. The choice between different possible corrections is made by comparing the cost of the inserted (popped) symbols with the reliability value of the recovery symbol (the first input symbol that is not discarded). Our concept of reliability is based on the observation that input symbols differ from each other in their ability to serve as recovery points. A high reliability value of a symbol asserts that it was probably not placed in the input by accident. So it is reasonable not to discard that symbol but to resume parsing. This is done even if a string with high insert-cost has to be inserted before that symbol in order to fit it to the part of the program that has already been analysed. The error recovery routine is invoked only when an error is detected. Thus, there is no additional time required for parsing correct programs. Error-correcting parsers for different languages, including Pascal, have been generated. Some experimental results are summarized.
The breeder genetic algorithm (BGA) models artificial selection as performed by human breeders. T... more The breeder genetic algorithm (BGA) models artificial selection as performed by human breeders. The science of breeding is based on advanced statistical methods. In this paper a connection between genetic algorithm theory and the science of breeding is made. We show how the response to selection equation and the concept of heritability can be applied to predict the behavior of the BGA. Selection, recombination, and mutation are analyzed within this framework. It is shown that recombination and mutation are complementary search operators. The theoretical results are obtained under the assumption of additive gene effects. For general fitness landscapes, regression techniques for estimating the heritability are used to analyze and control the BGA. The method of decomposing the genetic variance into an additive and a nonadditive part connects the case of additive fitness functions with the general case.
Theoretical biology has largely ignored Darwin 's true evolution model. In his famous book about ... more Theoretical biology has largely ignored Darwin 's true evolution model. In his famous book about the origin of species, Darwin detailed th e importance of a populati on structure on evolution. He conjectured that a large continent that exists for long periods in a broken condition will be th e most favorable for th e production of many new forms of life. We call this conject ure Darwin 's continent cycle theory. In this paper we investigate some of Darwin 's arguments in support of his th eory by simulat ing an art ificial ecology wit h the parallel genetic algorithm. Th e art ificial ecology consists of a populat ion playing th e It erated Pri soner's Dilemma. Th e major emphasis of this paper is on the meth odological questions of t he simulation. These are th e genet ic represent ation, the mapping of the genoty pes to phenotypes, and th e spatial population st ructure.
The dilute king model with a p = 0.8 fraction of the sites occupied by spins is simulated on L3 s... more The dilute king model with a p = 0.8 fraction of the sites occupied by spins is simulated on L3 systems for L up to 300, using a single-cluster algorithm of Wolff. In the range of reduced temperature 0.002 < (T -I",)/ I', < 0.03 the susceptibility appears to fit a simple power with an effective exponent yerr = 1.36.
We give a short introduction to the results of our theoretical analysis of evolutionary algorithm... more We give a short introduction to the results of our theoretical analysis of evolutionary algorithms. These results are used to design an algorithm for a large real-world problem: the placement of antennas for mobile radio networks. Our model for the antenna placement problem (APP) addresses cover, traffic demand, interference, different parameterized antenna types, and the geometrical structure of cells. The
ABSTRACT We present a parallel genetic algorithm for the k way graph partitioning problem. The al... more ABSTRACT We present a parallel genetic algorithm for the k way graph partitioning problem. The algorithm uses selection in local neighborhood and sophisticated genetic operators. For a sample problem the algorithm has found better solutions than those found by recent GPP algorithms. The success of the parallel genetic algorithm depends on the representation, a suitable crossover operator and an efficient local hill climbing method which is used to restrict the solution space.
We investigate the spatial distribution and the global frequency of agents who can either coopera... more We investigate the spatial distribution and the global frequency of agents who can either cooperate or defect. The agent interaction is described by a deterministic, non-iterated prisoner's dilemma game, further each agent only locally interacts with his neighbors. Based on a detailed analysis of the local payoff structures we derive critical conditions for the invasion or the spatial coexistence of cooperators and defectors. These results are concluded in a phase diagram that allows to identify five regimes, each characterized by a distinct spatiotemporal dynamics and a corresponding final spatial structure. In addition to the complete invasion of defectors, we find coexistence regimes with either a majority of cooperators in large spatial domains, or a minority of cooperators organized in small non-stationary domains or in small clusters. The analysis further allowed a verification of computer simulation results by . Eventually, we present simulation results of a true 5-person game on a lattice. This modification leads to non-uniform spatial interactions that may even enhance the effect of cooperation.
An efficient and systematic LL(1) error recovery method is presented that has been implemented fo... more An efficient and systematic LL(1) error recovery method is presented that has been implemented for an LL( 1) parser generator. Error messages which provide good diagnostic information are generated automatically. Error correction is done by discarding some input symbols and popping up some symbols from the parsing-stack in order to restore the parser to a valid configuration. Thus, symbol deletions and insertions are simulated. The choice between different possible corrections is made by comparing the cost of the inserted (popped) symbols with the reliability value of the recovery symbol (the first input symbol that is not discarded). Our concept of reliability is based on the observation that input symbols differ from each other in their ability to serve as recovery points. A high reliability value of a symbol asserts that it was probably not placed in the input by accident. So it is reasonable not to discard that symbol but to resume parsing. This is done even if a string with high insert-cost has to be inserted before that symbol in order to fit it to the part of the program that has already been analysed. The error recovery routine is invoked only when an error is detected. Thus, there is no additional time required for parsing correct programs. Error-correcting parsers for different languages, including Pascal, have been generated. Some experimental results are summarized.
Uploads
Papers by H. Mühlenbein