pub struct GASampler { /* private fields */ }Expand description
Genetic Algorithm Sampler
This sampler uses a genetic algorithm to find solutions to QUBO/HOBO problems. It maintains a population of potential solutions and evolves them through selection, crossover, and mutation.
Implementations§
Source§impl GASampler
impl GASampler
Sourcepub const fn new(seed: Option<u64>) -> Self
pub const fn new(seed: Option<u64>) -> Self
Create a new Genetic Algorithm sampler
§Arguments
seed- An optional random seed for reproducibility
Sourcepub const fn with_params(
seed: Option<u64>,
max_generations: usize,
population_size: usize,
) -> Self
pub const fn with_params( seed: Option<u64>, max_generations: usize, population_size: usize, ) -> Self
Create a new Genetic Algorithm sampler with custom parameters
§Arguments
seed- An optional random seed for reproducibilitymax_generations- Maximum number of generations to evolvepopulation_size- Size of the population
Sourcepub const fn with_population_size(self, size: usize) -> Self
pub const fn with_population_size(self, size: usize) -> Self
Set population size
Sourcepub const fn with_elite_fraction(self, _fraction: f64) -> Self
pub const fn with_elite_fraction(self, _fraction: f64) -> Self
Set elite fraction (placeholder method)
Sourcepub const fn with_mutation_rate(self, _rate: f64) -> Self
pub const fn with_mutation_rate(self, _rate: f64) -> Self
Set mutation rate (placeholder method)
Sourcepub const fn with_advanced_params(
seed: Option<u64>,
max_generations: usize,
population_size: usize,
_crossover: CrossoverStrategy,
_mutation: MutationStrategy,
) -> Self
pub const fn with_advanced_params( seed: Option<u64>, max_generations: usize, population_size: usize, _crossover: CrossoverStrategy, _mutation: MutationStrategy, ) -> Self
Create a new enhanced Genetic Algorithm sampler
§Arguments
seed- An optional random seed for reproducibilitymax_generations- Maximum number of generations to evolvepopulation_size- Size of the populationcrossover- Crossover strategy to usemutation- Mutation strategy to use
Trait Implementations§
Auto Trait Implementations§
impl Freeze for GASampler
impl RefUnwindSafe for GASampler
impl Send for GASampler
impl Sync for GASampler
impl Unpin for GASampler
impl UnwindSafe for GASampler
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.