Struct ListSpec 

pub struct ListSpec<S, V, DM, IDM> {

    pub list_len: fn(&S, usize) -> usize,
    pub list_remove: fn(&mut S, usize, usize) -> Option<V>,
    pub list_insert: fn(&mut S, usize, usize, V),
    pub list_get: fn(&S, usize, usize) -> Option<V>,
    pub list_set: fn(&mut S, usize, usize, V),
    pub list_reverse: fn(&mut S, usize, usize, usize),
    pub sublist_remove: fn(&mut S, usize, usize, usize) -> Vec<V>,
    pub sublist_insert: fn(&mut S, usize, usize, Vec<V>),
    pub ruin_remove: fn(&mut S, usize, usize) -> V,
    pub ruin_insert: fn(&mut S, usize, usize, V),
    pub element_count: fn(&S) -> usize,
    pub get_assigned: fn(&S) -> Vec<V>,
    pub entity_count: fn(&S) -> usize,
    pub list_remove_for_construction: fn(&mut S, usize, usize) -> V,
    pub index_to_element: fn(&S, usize) -> V,
    pub cross_distance_meter: DM,
    pub intra_distance_meter: IDM,
    pub depot_fn: Option<fn(&S) -> usize>,
    pub distance_fn: Option<fn(&S, usize, usize) -> i64>,
    pub element_load_fn: Option<fn(&S, usize) -> i64>,
    pub capacity_fn: Option<fn(&S) -> i64>,
    pub assign_route_fn: Option<fn(&mut S, usize, Vec<V>)>,
    pub merge_feasible_fn: Option<fn(&S, &[usize]) -> bool>,
    pub k_opt_get_route: Option<fn(&S, usize) -> Vec<usize>>,
    pub k_opt_set_route: Option<fn(&mut S, usize, Vec<usize>)>,
    pub k_opt_depot_fn: Option<fn(&S, usize) -> usize>,
    pub k_opt_distance_fn: Option<fn(&S, usize, usize) -> i64>,
    pub k_opt_feasible_fn: Option<fn(&S, usize, &[usize]) -> bool>,
    pub variable_name: &'static str,
    pub descriptor_index: usize,
    pub _phantom: PhantomData<fn() -> S>,
}

Problem specification for list variable problems.

Passed to run_solver to provide problem-specific construction and local search phases for solutions using #[shadow_variable_updates] (list variables).

Fields

list_len: fn(&S, usize) -> usize

list_remove: fn(&mut S, usize, usize) -> Option<V>

list_insert: fn(&mut S, usize, usize, V)

list_get: fn(&S, usize, usize) -> Option<V>

list_set: fn(&mut S, usize, usize, V)

list_reverse: fn(&mut S, usize, usize, usize)

sublist_remove: fn(&mut S, usize, usize, usize) -> Vec<V>

sublist_insert: fn(&mut S, usize, usize, Vec<V>)

ruin_remove: fn(&mut S, usize, usize) -> V

ruin_insert: fn(&mut S, usize, usize, V)

element_count: fn(&S) -> usize

get_assigned: fn(&S) -> Vec<V>

entity_count: fn(&S) -> usize

list_remove_for_construction: fn(&mut S, usize, usize) -> V

index_to_element: fn(&S, usize) -> V

cross_distance_meter: DM

intra_distance_meter: IDM

depot_fn: Option<fn(&S) -> usize>

distance_fn: Option<fn(&S, usize, usize) -> i64>

element_load_fn: Option<fn(&S, usize) -> i64>

capacity_fn: Option<fn(&S) -> i64>

assign_route_fn: Option<fn(&mut S, usize, Vec<V>)>

merge_feasible_fn: Option<fn(&S, &[usize]) -> bool>

k_opt_get_route: Option<fn(&S, usize) -> Vec<usize>>

k_opt_set_route: Option<fn(&mut S, usize, Vec<usize>)>

k_opt_depot_fn: Option<fn(&S, usize) -> usize>

k_opt_distance_fn: Option<fn(&S, usize, usize) -> i64>

k_opt_feasible_fn: Option<fn(&S, usize, &[usize]) -> bool>

variable_name: &'static str

descriptor_index: usize

_phantom: PhantomData<fn() -> S>

Trait Implementations

impl<S, V, C, DM, IDM> ProblemSpec<S, C> for ListSpec<S, V, DM, IDM>

where S: PlanningSolution, S::Score: Score + ParseableScore, V: Copy + PartialEq + Eq + Hash + Send + Sync + Debug + 'static, C: ConstraintSet<S, S::Score>, DM: CrossEntityDistanceMeter<S> + Clone, IDM: CrossEntityDistanceMeter<S> + Clone + 'static,

fn is_trivial(&self, solution: &S) -> bool

Returns true if the problem is trivially empty and solving can be skipped.

fn default_time_limit_secs(&self) -> u64

Default solver time limit in seconds (used when config has no termination).

fn log_scale(&self, solution: &S)

Logs the problem scale (entity count, value count, etc.).

fn build_and_solve( self, director: ScoreDirector<S, C>, config: &SolverConfig, time_limit: Duration, termination: AnyTermination<S, ScoreDirector<S, C>>, terminate: Option<&AtomicBool>, callback: impl Fn(&S) + Send + Sync, ) -> SolveResult<S>

Builds the construction + local search phases and runs the solver.