Abstract
We examine the role of selection in evolution-based approaches using results drawn from majorization theory and replicator models. Analyzing selection in this framework has several advantages: the availability of convergence results from the theory of inhomogeneous doubly stochastic Markov chains, and a generalized fundamental theorem from replicator models. We show that pre-ordering a sequence of vectors by the majorization relation necessarily implies replicator dynamics. We also give sufficient conditions for a converse result. We present arguments for using majorization operators in evolutionary algorithms.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the IEEE Conference on Evolutionary Computation |
Publisher | IEEE Computer Society |
Pages | 606-610 |
Number of pages | 5 |
State | Published - 1996 |
Event | Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, ICEC'96 - Nagoya, Jpn Duration: May 20 1996 → May 22 1996 |
Other
Other | Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, ICEC'96 |
---|---|
City | Nagoya, Jpn |
Period | 5/20/96 → 5/22/96 |
ASJC Scopus subject areas
- General Engineering