solverforge-scoring 0.8.2

Incremental constraint scoring for SolverForge
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125

// IfExistsUniConstraint tests

use solverforge_core::score::SoftScore;
use solverforge_core::{ConstraintRef, ImpactType};

use crate::api::constraint_set::IncrementalConstraint;
use crate::constraint::if_exists::{ExistenceMode, IfExistsUniConstraint};

#[derive(Clone)]
struct Task {
    _id: usize,
    assignee: Option<usize>,
}

#[derive(Clone)]
struct Worker {
    id: usize,
    available: bool,
}

#[derive(Clone)]
struct TaskSchedule {
    tasks: Vec<Task>,
    workers: Vec<Worker>,
}

fn tasks(s: &TaskSchedule) -> &[Task] {
    s.tasks.as_slice()
}

#[test]
fn test_if_exists_penalizes_assigned_to_unavailable() {
    // Penalize tasks assigned to unavailable workers
    let constraint = IfExistsUniConstraint::new(
        ConstraintRef::new("", "Unavailable worker"),
        ImpactType::Penalty,
        ExistenceMode::Exists,
        tasks,
        |s: &TaskSchedule| s.workers.iter().filter(|w| !w.available).cloned().collect(),
        |t: &Task| t.assignee,
        |w: &Worker| Some(w.id),
        |_s: &TaskSchedule, t: &Task| t.assignee.is_some(),
        |_t: &Task| SoftScore::of(1),
        false,
    );

    let schedule = TaskSchedule {
        tasks: vec![
            Task {
                _id: 0,
                assignee: Some(0),
            }, // assigned to unavailable
            Task {
                _id: 1,
                assignee: Some(1),
            }, // assigned to available
            Task {
                _id: 2,
                assignee: None,
            }, // unassigned
        ],
        workers: vec![
            Worker {
                id: 0,
                available: false,
            },
            Worker {
                id: 1,
                available: true,
            },
        ],
    };

    // Only task 0 matches
    assert_eq!(constraint.evaluate(&schedule), SoftScore::of(-1));
    assert_eq!(constraint.match_count(&schedule), 1);
}

#[test]
fn test_if_not_exists_penalizes_unassigned() {
    // Penalize tasks not assigned to any available worker
    let constraint = IfExistsUniConstraint::new(
        ConstraintRef::new("", "No available worker"),
        ImpactType::Penalty,
        ExistenceMode::NotExists,
        tasks,
        |s: &TaskSchedule| s.workers.iter().filter(|w| w.available).cloned().collect(),
        |t: &Task| t.assignee,
        |w: &Worker| Some(w.id),
        |_s: &TaskSchedule, t: &Task| t.assignee.is_some(),
        |_t: &Task| SoftScore::of(1),
        false,
    );

    let schedule = TaskSchedule {
        tasks: vec![
            Task {
                _id: 0,
                assignee: Some(0),
            }, // assigned to unavailable - no match in available
            Task {
                _id: 1,
                assignee: Some(1),
            }, // assigned to available
            Task {
                _id: 2,
                assignee: None,
            }, // unassigned - filtered out by filter_a
        ],
        workers: vec![
            Worker {
                id: 0,
                available: false,
            },
            Worker {
                id: 1,
                available: true,
            },
        ],
    };

    // Task 0 is assigned but worker 0 is not available
    assert_eq!(constraint.evaluate(&schedule), SoftScore::of(-1));
    assert_eq!(constraint.match_count(&schedule), 1);
}