Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- Defines the fecundity of two independent instances of a particular evolution-strategy; one composed from a deterministic timetable-constructor & the other from a random timetable-constructor.
- It quantifies the number of candidate solutions bred at each generation of the evolution of the timetable.
- If the fecundity is zero, then the corresponding strategy is effectively switched-off.
Types
Type-synonyms
The number of candidate solutions to breed in any one generation of the evolution of a timetable.
Data-types
data TimetableBreederFecundity Source #
Describes a pair of boolean values, which independently switch on or off.
Instances
Constants
zero :: TimetableBreederFecundity Source #
Constant.
Functions
Constructor
mkTimetableBreederFecundity :: Fecundity -> Fecundity -> TimetableBreederFecundity Source #
Smart constructor.
Operators
(>*<) :: TimetableBreederFecundity -> TimetableBreederFecundity -> TimetableBreederFecundity infixl 7 Source #
- Combine two
TimetableBreederFecundity
s, returning the geometric mean of the individualFecundity
s. - The operation is commutative; https://en.wikipedia.org/wiki/Commutative_property.