pub struct AcoSolver {
pub num_ants: usize,
pub alpha: f64,
pub beta: f64,
pub rho: f64,
pub q0: f64,
/* private fields */
}Expand description
Ant Colony Optimization solver for TSP.
This is a thin adapter around aprender::metaheuristics::AntColony.
Fields§
§num_ants: usizeNumber of artificial ants
alpha: f64Pheromone importance (α)
beta: f64Heuristic importance (β)
rho: f64Evaporation rate (ρ)
q0: f64Exploitation probability (q₀) for ACS rule Note: Not used by core ACO (uses simpler Ant System)
Implementations§
Source§impl AcoSolver
impl AcoSolver
Sourcepub fn with_num_ants(self, num_ants: usize) -> Self
pub fn with_num_ants(self, num_ants: usize) -> Self
Set number of ants
Sourcepub fn with_alpha(self, alpha: f64) -> Self
pub fn with_alpha(self, alpha: f64) -> Self
Set pheromone importance (α)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for AcoSolver
impl RefUnwindSafe for AcoSolver
impl Send for AcoSolver
impl Sync for AcoSolver
impl Unpin for AcoSolver
impl UnwindSafe for AcoSolver
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.