Mixed Integer Evolution Strategies
Set a Function's Environment
Filtor-Combination that Filters According to Two Filtors
Null-Filtor
Proxy-Filtor that Filters According to its Configuration Parameter
Progressive Surrogate Model Filtering
Tournament Surrogate Model Filtering
Dictionary of Filtors
Mutator Choosing Action Component-Wise Independently
Uniform Sample Mutator
Gaussian Distribution Mutator
Mutator Choosing Action Probabilistically
Null Mutator
Proxy-Mutator that Mutates According to its Configuration parameter
Run Multiple Mutator Operations in Sequence
Uniform Discrete Mutator
Dictionary of Mutators
Recombinator Choosing Action Component-Wise Independently
Convex Combination Recombinator
Convex Combination Recombinator for Pairs
Recombinator Choosing Action Probabilistically
Null-Recombinator
Proxy-Recombinator that Recombines According to its Configuration para...
Simulated Binary Crossover Recombinator
Run Multiple Recombinator Operations in Sequence
Swap Recombinator
N-ary Crossover Recombinator
Crossover Recombinator
Dictionary of Recombinators
Scalor giving Weighted Sum of Multiple Scalors
Scalor Counting Dominating Individuals
Multi-Objective Fixed Projection Scalor
Hypervolume Scalor
Nondominated Sorting Scalor
Single Dimension Scalor
Proxy-Scalor that Scales According to its Configuration parameter
Single Objective Scalor
Dictionary of Scalors
Best Value Selector
Selector-Combination that Selects According to Two Selectors
Null Selector
Proxy-Selector that Selects According to its Configuration Parameter
Random Selector
Run Multiple Selection Operations in Sequence
Tournament Selector
Dictionary of Selectors
Calculate Crowding Distance
Calculate Hypervolume Contribution
Calculate Hypervolume Improvement
Calculate Dominated Hypervolume
Filtor Base Class
Abstract Surrogate Model Filtering Base Class
Get Aggregated Performance Values by Generation
Aggregate a Value for a given Generation
Evaluate Proposed Configurations Generated in a MIES Iteration
Filter Offspring
Generate Offspring Through Mutation and Recombination
Aggregate Values for All Generations Present
Get the Last Generation that was Evaluated
Get Fitness Values from OptimInstance
Get Performance Values by Generation
Initialize MIES Optimization
Prime MIES Operators
Select Individuals from an OptimInstance
Re-Evaluate Existing Configurations with Higher Fidelity
Choose Survivors According to the "Mu , Lambda" ("Comma") Strategy
Choose Survivors According to the "Mu + Lambda" ("Plus") Strategy
miesmuschel: Mixed Integer Evolution Strategies
Operator Base Class
Terminator that Limits Total Budget Component Evaluation
Terminator That Stops When a Generation-Wise Aggregated Value Reaches ...
Terminator that Counts OptimizerMies Generations
Terminator That Stops When a Generation-Wise Aggregated Value Stagnate...
Short Access Forms for Operators
Mutator Base Class
Discrete Mutator Base Class
Numeric Mutator Base Class
Self-Adaptive Operator Combinations
OptimInstanceMultiCrit Class
OptimInstanceSingleCrit Class
Optimizer Class
Mixed Integer Evolution Strategies Optimizer
ParamSetShadow
Perform Nondominated Sorting
Recombinator Base Class
Pair Recombinator Base Class
Create a 'call' Object Representation
Sampler for Projection Weights
Chebyshev Scalarizer
Linear Scalarizer
Scalarizer
Scalor Base Class
Selector Base Class
Selector making use of Scalors
Get the Numger of Generations that a Terminator Allows
TuningInstanceMultiCrit Class
TuningInstanceSingleCrit Class
Evolutionary black box optimization algorithms building on the 'bbotk' package. 'miesmuschel' offers both ready-to-use optimization algorithms, as well as their fundamental building blocks that can be used to manually construct specialized optimization loops. The Mixed Integer Evolution Strategies as described by Li et al. (2013) <doi:10.1162/EVCO_a_00059> can be implemented, as well as the multi-objective optimization algorithms NSGA-II by Deb, Pratap, Agarwal, and Meyarivan (2002) <doi:10.1109/4235.996017>.