Struct LocalSearchPhaseFactory

Source

pub struct LocalSearchPhaseFactory<S, M, MS, A, Fo>where
    S: PlanningSolution,
    M: Move<S>,
    MS: MoveSelector<S, M>,
    A: Acceptor<S>,
    Fo: LocalSearchForager<S, M>,
{ /* private fields */ }

Expand description

Zero-erasure factory for local search phases.

All types flow through generics - MoveSelector MS, Acceptor A, and Forager Fo are all concrete types.

§Type Parameters

S - The planning solution type
M - The move type
MS - The move selector type (concrete)
A - The acceptor type (concrete)
Fo - The forager type (concrete)

Implementations§

Source §

impl<S, M, MS, A, Fo> LocalSearchPhaseFactory<S, M, MS, A, Fo>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>, A: Acceptor<S>, Fo: LocalSearchForager<S, M>,

Source

pub fn new(move_selector: MS, acceptor: A, forager: Fo) -> Self

Creates a new factory with concrete components.

Source

pub fn with_step_limit(self, limit: u64) -> Self

Sets step limit.

Source §

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, HillClimbingAcceptor, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

Source

pub fn hill_climbing(move_selector: MS) -> Self

Creates a hill climbing local search.

Source §

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, TabuSearchAcceptor<S>, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

Source

pub fn tabu_search(move_selector: MS, tabu_size: usize) -> Self

Creates a tabu search local search.

Source §

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, SimulatedAnnealingAcceptor, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

Source

pub fn simulated_annealing( move_selector: MS, starting_temp: f64, decay_rate: f64, ) -> Self

Creates a simulated annealing local search.

Source §

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, LateAcceptanceAcceptor<S>, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

Source

pub fn late_acceptance(move_selector: MS, size: usize) -> Self

Creates a late acceptance local search.

Trait Implementations§

Source §

impl<S, D, M, MS, A, Fo> PhaseFactory<S, D> for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where S: PlanningSolution, D: ScoreDirector<S>, M: Move<S> + Send + Sync + 'static, MS: MoveSelector<S, M> + Clone + Send + Sync + 'static, A: Acceptor<S> + Clone + Send + Sync + 'static, Fo: LocalSearchForager<S, M> + Clone + Send + Sync + 'static,

Source §

type Phase = LocalSearchPhase<S, M, MS, A, Fo>

The concrete phase type produced by this factory.

Source §

fn create(&self) -> Self::Phase

Creates a new phase instance with concrete type.

Auto Trait Implementations§

§

impl<S, M, MS, A, Fo> Freeze for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: Freeze, A: Freeze, Fo: Freeze,

§

impl<S, M, MS, A, Fo> RefUnwindSafe for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: RefUnwindSafe, A: RefUnwindSafe, Fo: RefUnwindSafe,

§

impl<S, M, MS, A, Fo> Send for LocalSearchPhaseFactory<S, M, MS, A, Fo>

§

impl<S, M, MS, A, Fo> Sync for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: Sync, A: Sync, Fo: Sync,

§

impl<S, M, MS, A, Fo> Unpin for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: Unpin, A: Unpin, Fo: Unpin,

§

impl<S, M, MS, A, Fo> UnwindSafe for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: UnwindSafe, A: UnwindSafe, Fo: UnwindSafe,

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T> Instrument for T

Source §

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

Source §

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

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 more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more

Source §

impl<T> Pointable for T

Source §

const ALIGN: usize

The alignment of pointer.

Source §

type Init = T

The type for initializers.

Source §

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

Source §

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

Source §

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

Source §

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

Source §

impl<T, U> TryFrom for T
where U: Into<T>,

Source §

type Error = Infallible

The type returned in the event of a conversion error.

Source §

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

Source §

impl<T, U> TryInto for T
where U: TryFrom<T>,

Source §

type Error = >::Error

The type returned in the event of a conversion error.

Source §

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Source §

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

Source §

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

Struct LocalSearchPhaseFactory Copy item path

§Type Parameters

Implementations§

impl<S, M, MS, A, Fo> LocalSearchPhaseFactory<S, M, MS, A, Fo>where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>, A: Acceptor<S>, Fo: LocalSearchForager<S, M>,

pub fn new(move_selector: MS, acceptor: A, forager: Fo) -> Self

pub fn with_step_limit(self, limit: u64) -> Self

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, HillClimbingAcceptor, AcceptedCountForager<S>>where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

pub fn hill_climbing(move_selector: MS) -> Self

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, TabuSearchAcceptor<S>, AcceptedCountForager<S>>where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

pub fn tabu_search(move_selector: MS, tabu_size: usize) -> Self

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, SimulatedAnnealingAcceptor, AcceptedCountForager<S>>where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

pub fn simulated_annealing( move_selector: MS, starting_temp: f64, decay_rate: f64, ) -> Self

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, LateAcceptanceAcceptor<S>, AcceptedCountForager<S>>where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

pub fn late_acceptance(move_selector: MS, size: usize) -> Self

Trait Implementations§

type Phase = LocalSearchPhase<S, M, MS, A, Fo>

fn create(&self) -> Self::Phase

Auto Trait Implementations§

impl<S, M, MS, A, Fo> Freeze for LocalSearchPhaseFactory<S, M, MS, A, Fo>where MS: Freeze, A: Freeze, Fo: Freeze,

impl<S, M, MS, A, Fo> RefUnwindSafe for LocalSearchPhaseFactory<S, M, MS, A, Fo>where MS: RefUnwindSafe, A: RefUnwindSafe, Fo: RefUnwindSafe,

impl<S, M, MS, A, Fo> Send for LocalSearchPhaseFactory<S, M, MS, A, Fo>

impl<S, M, MS, A, Fo> Sync for LocalSearchPhaseFactory<S, M, MS, A, Fo>where MS: Sync, A: Sync, Fo: Sync,

impl<S, M, MS, A, Fo> Unpin for LocalSearchPhaseFactory<S, M, MS, A, Fo>where MS: Unpin, A: Unpin, Fo: Unpin,

impl<S, M, MS, A, Fo> UnwindSafe for LocalSearchPhaseFactory<S, M, MS, A, Fo>where MS: UnwindSafe, A: UnwindSafe, Fo: UnwindSafe,

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<T> Pointable for T

const ALIGN: usize

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

fn vzip(self) -> V

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

fn with_current_subscriber(self) -> WithDispatch<Self>

Struct LocalSearchPhaseFactory

impl<S, M, MS, A, Fo> LocalSearchPhaseFactory<S, M, MS, A, Fo>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>, A: Acceptor<S>, Fo: LocalSearchForager<S, M>,

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, HillClimbingAcceptor, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, TabuSearchAcceptor<S>, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, SimulatedAnnealingAcceptor, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, LateAcceptanceAcceptor<S>, AcceptedCountForager<S>>
where S: PlanningSolution, M: Move<S>, MS: MoveSelector<S, M>,

impl<S, M, MS, A, Fo> Freeze for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: Freeze, A: Freeze, Fo: Freeze,

impl<S, M, MS, A, Fo> RefUnwindSafe for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: RefUnwindSafe, A: RefUnwindSafe, Fo: RefUnwindSafe,

impl<S, M, MS, A, Fo> Sync for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: Sync, A: Sync, Fo: Sync,

impl<S, M, MS, A, Fo> Unpin for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: Unpin, A: Unpin, Fo: Unpin,

impl<S, M, MS, A, Fo> UnwindSafe for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where MS: UnwindSafe, A: UnwindSafe, Fo: UnwindSafe,

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,