Struct vrp_core::solver::search::DecomposeSearch

source · [−]

pub struct DecomposeSearch { /* private fields */ }

Expand description

A search operator which decomposes original solution into multiple partial solutions, preforms search independently, and then merges partial solution back into one solution.

Implementations

source

impl DecomposeSearch

source

pub fn new(
    inner_search: TargetHeuristicOperator,
    max_routes_range: (usize, usize ),
    repeat_count: usize
) -> Self

Create a new instance of DecomposeSearch.

Trait Implementations

source

impl HeuristicOperator for DecomposeSearch

type Context = RefinementContext

A heuristic context type.

type Objective = ProblemObjective

A heuristic objective type.

type Solution = InsertionContext

A heuristic solution type.

source

fn search(
    &self,
    heuristic_ctx: &Self::Context,
    solution: &Self::Solution
) -> Self::Solution

Performs search for a new (better) solution using given one.

Auto Trait Implementations

impl !RefUnwindSafe for DecomposeSearch

impl Send for DecomposeSearch

impl Sync for DecomposeSearch

impl Unpin for DecomposeSearch

impl !UnwindSafe for DecomposeSearch

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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::()

The alignment of pointer.

type Init = T

The type for initializers.

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

Initializes a with the given initializer. Read more

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

Dereferences the given pointer. Read more

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

Mutably dereferences the given pointer. Read more

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>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · 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>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

Struct vrp_core::solver::search::DecomposeSearch

Implementations

impl DecomposeSearch

pub fn new( inner_search: TargetHeuristicOperator, max_routes_range: (usize, usize), repeat_count: usize) -> Self

Trait Implementations

impl HeuristicOperator for DecomposeSearch

type Context = RefinementContext

type Objective = ProblemObjective

type Solution = InsertionContext

fn search( &self, heuristic_ctx: &Self::Context, solution: &Self::Solution) -> Self::Solution

Auto Trait Implementations

impl !RefUnwindSafe for DecomposeSearch

impl Send for DecomposeSearch

impl Sync for DecomposeSearch

impl Unpin for DecomposeSearch

impl !UnwindSafe for DecomposeSearch

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::()

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 T where U: Into<T>,

type Error = Infallible

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

impl<T, U> TryInto<U> for T where 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 T where V: MultiLane<T>,

fn vzip(self) -> V

pub fn new(
inner_search: TargetHeuristicOperator,
max_routes_range: (usize, usize ),
repeat_count: usize
) -> Self

fn search(
&self,
heuristic_ctx: &Self::Context,
solution: &Self::Solution
) -> Self::Solution

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>,

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>,