~ruther/ctu-fee-eoa

ref: f1a6bbdb829d78985c738ddd16184fde2690ccff ctu-fee-eoa/codes/eoa_lib/src/fitness/real.rs -rw-r--r-- 6.8 KiB
f1a6bbdb — Rutherther fix: use two objectives in nsga_constr 6 days ago
                                                                                
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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
use std::{convert::Infallible, f64::consts::PI, marker::PhantomData};

use nalgebra::{allocator::Allocator, DefaultAllocator, Dim, OVector, U1};

use super::FitnessFunction;

pub struct Linear<D>
where
    D: Dim,
    DefaultAllocator: Allocator<D>
{
    a0: f64,
    a: OVector<f64, D>,
}

impl<D> Linear<D>
where
    D: Dim,
    DefaultAllocator: Allocator<D>
{
    pub fn new(a0: f64, a: OVector<f64, D>) -> Self {
        Self {
            a0,
            a
        }
    }
}

impl<D> FitnessFunction for Linear<D>
where
    D: Dim,
    DefaultAllocator: Allocator<D>,
    DefaultAllocator: Allocator<U1, D>
{
    type In = OVector<f64, D>;
    type Out = f64;
    type Err = Infallible;

    fn fit(self: &Self, inp: &Self::In) -> Result<Self::Out, Self::Err> {
        Ok(self.a0 + (self.a.transpose() * inp).x)
    }
}

pub struct Step<D>
where
    D: Dim,
    DefaultAllocator: Allocator<D>,
{
    a0: f64,
    a: OVector<f64, D>,
}

impl<D> Step<D>
where
    D: Dim,
    DefaultAllocator: Allocator<D>,
{
    pub fn new(a0: f64, a: OVector<f64, D>) -> Self {
        Self {
            a0,
            a
        }
    }
}

impl<D> FitnessFunction for Step<D>
where
    D: Dim,
    DefaultAllocator: Allocator<D>,
{
    type In = OVector<f64, D>;
    type Out = f64;
    type Err = Infallible;

    fn fit(self: &Self, inp: &Self::In) -> Result<Self::Out, Self::Err> {
        Ok(self.a0 + inp.component_mul(&self.a).map(|x| x.floor()).sum())
    }
}

pub struct Rastrigin<D: Dim> {
    _phantom: PhantomData<D>
}

impl<D: Dim> Rastrigin<D> {
    pub fn new() -> Self {
        Self {
            _phantom: PhantomData
        }
    }
}

impl<D: Dim> FitnessFunction for Rastrigin<D>
where
    DefaultAllocator: Allocator<D>
{
    type In = OVector<f64, D>;
    type Out = f64;
    type Err = Infallible;

    fn fit(self: &Self, inp: &Self::In) -> Result<Self::Out, Self::Err> {
        let dim = inp.len() as f64;
        Ok(10.0 * dim + inp.iter()
           .map(|x| x.powi(2) - 10.0 * (2.0 * PI * x).cos())
           .sum::<f64>())
    }
}

pub struct Griewank<D: Dim> {
    _phantom: PhantomData<D>
}

impl<TDim: Dim> Griewank<TDim> {
    pub fn new() -> Self {
        Self {
            _phantom: PhantomData
        }
    }
}

impl<D: Dim> FitnessFunction for Griewank<D>
where
    DefaultAllocator: Allocator<D>
{
    type In = OVector<f64, D>;
    type Out = f64;
    type Err = Infallible;

    fn fit(self: &Self, inp: &Self::In) -> Result<Self::Out, Self::Err> {
        Ok(1.0 + inp.map(|x| x.powi(2)).sum() / 4000.0 - inp
           .iter()
           .enumerate()
           .map(|(i, x)| (x / ((i + 1) as f64).sqrt()).cos())
           .product::<f64>())
    }
}

pub struct Schwefel<D: Dim> {
    _phantom: PhantomData<D>
}

impl<D: Dim> Schwefel<D> {
    pub fn new() -> Self {
        Self {
            _phantom: PhantomData
        }
    }
}

impl<D> FitnessFunction for Schwefel<D>
where
    D: Dim,
    DefaultAllocator: Allocator<D>
{
    type In = OVector<f64, D>;
    type Out = f64;
    type Err = Infallible;

    fn fit(self: &Self, inp: &Self::In) -> Result<Self::Out, Self::Err> {
        Ok(-inp
            .map(|x| x * x.abs().sqrt().sin())
            .sum())
    }
}

#[cfg(test)]
pub mod tests {
    use nalgebra::{Dyn, OVector, SVector};

    use crate::{fitness::{real::{Linear, Rastrigin, Schwefel, Step}, FitnessFunction}, test_infra::load_test_file};

    use super::Griewank;

    #[test]
    fn test_linear_1() {
        let data = load_test_file::<f64, f64>("tests/linear_1.txt");

        for test in data {
            let offset = OVector::<f64, Dyn>::from_element(test.inp.len(), 1.0);
            let inp = OVector::<f64, Dyn>::from_vec(test.inp);

            let linear = Linear::new(1.0, offset);

            assert_eq!(
                linear.fit(&inp).unwrap(),
                test.out
            );
        }
    }

    #[test]
    fn test_linear_2() {
        let data = load_test_file::<f64, f64>("tests/linear_2.txt");

        for test in data {
            let offset = OVector::<f64, Dyn>::from_iterator(test.inp.len(), (2..=test.inp.len()+1).map(|x| x as f64));
            let linear = Linear::new(1.0, offset);
            let inp = OVector::<f64, Dyn>::from_vec(test.inp);

            assert_eq!(
                linear.fit(&inp).unwrap(),
                test.out
            );
        }
    }

    #[test]
    fn test_step_1() {
        const MAX_LEN: usize = 10;

        let data = load_test_file::<f64, f64>("tests/step_1.txt");
        let offset = SVector::repeat(1.0);
        let linear = Step::new(1.0, offset);

        for test in data {
            let filled = test.inp.iter()
                .chain(vec![0f64; MAX_LEN - test.inp.len()].iter())
                .map(|x| *x)
                .collect::<Vec<_>>();
            let inp = SVector::<f64, MAX_LEN>::from_vec(filled);

            assert_eq!(
                linear.fit(&inp).unwrap(),
                test.out
            );
        }
    }

    #[test]
    fn test_step_2() {
        const MAX_LEN: usize = 10;

        let data = load_test_file::<f64, f64>("tests/step_2.txt");
        let offset = SVector::from_vec((2..=11).map(|x| x as f64).collect());
        let linear = Step::new(1.0, offset);

        for test in data {
            let filled = test.inp.iter()
                .chain(vec![0f64; MAX_LEN - test.inp.len()].iter())
                .map(|x| *x)
                .collect::<Vec<_>>();
            let inp = SVector::<f64, MAX_LEN>::from_vec(filled);

            assert_eq!(
                linear.fit(&inp).unwrap(),
                test.out
            );
        }
    }

    #[test]
    fn test_rastrigin() {
        let data = load_test_file::<f64, f64>("tests/rastrigin.txt");
        let linear = Rastrigin::<Dyn>::new();

        for test in data {
            let inp = OVector::<f64, Dyn>::from_vec(test.inp);

            assert_eq!(
                linear.fit(&inp).unwrap(),
                test.out
            );
        }
    }

    #[test]
    fn test_griewank() {
        let data = load_test_file::<f64, f64>("tests/griewank.txt");
        let griewank = Griewank::<Dyn>::new();

        for test in data {
            let inp = OVector::<f64, Dyn>::from_vec(test.inp);

            assert_eq!(
                griewank.fit(&inp).unwrap(),
                test.out
            );
        }
    }

    #[test]
    fn test_schwefel() {
        const MAX_LEN: usize = 10;

        let data = load_test_file::<f64, f64>("tests/schwefel.txt");
        let schwefel = Schwefel::new();

        for test in data {
            let filled = test.inp.iter()
                .chain(vec![0f64; MAX_LEN - test.inp.len()].iter())
                .map(|x| *x)
                .collect::<Vec<_>>();
            let inp = SVector::<f64, MAX_LEN>::from_vec(filled);

            assert_eq!(
                schwefel.fit(&inp).unwrap(),
                test.out
            );
        }
    }
}