unified-nsga-iii

Releases (4)

• 0.2.2.0 indexed
• 0.2.1.0 unindexed
• 0.2.0.0 unindexed
• 0.1.2.0 unindexed

Definitions (702)

problems.bend

• def dtlz4_alphaDTLZ4: C# default α=100, k=10.
• def dtlz4
• def dtlz7DTLZ7: C# default M=3, k=20 ⇒ n=22.
• def sphereSingle-objective.
• def ackley
• def rosenbrock
• def osyOSY: 6 variables, 2 objectives, 6 inequalities.
• def tnkTNK: [0, π] × [1e-30, π].
• def c1_dtlz1C1-DTLZ1: DTLZ1 plus one inequality.
• def sum_from
• def sum_tail
• def list_tail
• def zdt_den
• def zdt_gC# Zdt1Problem.GLinear: 1 + 9 * sum(x[1..]) / (n - 1).
• def zdt1_f
• def zdt2_f
• def zdt3_fC# Zdt3Problem: g * (1 - sqrt(r) - r * sin(10 π x0)), r = x0/g.
• def zdt4_term
• def sum_zdt4
• def pred
• def zdt4_gC# Zdt4Problem: 1 + 10*(n-1) + Σ_{i≥1} (x_i² - 10 cos(4 π x_i)).
• def zdt4_f
• def zdt6_fC# Zdt6Problem: biased density.
• def sum_sq_half
• def tail_from_m
• def dtlz2_gC# DtlzHelper.GDtlz2: sum (x[i] - 0.5)^2 for i >= M-1.
• def dtlz1_term
• def sum_dtlz1
• def dtlz1_gC# DtlzHelper.GDtlz1: 100 * ((n - M + 1) + Σ (d² - cos(20 π d))), d = x-0.5.
• def half_pi
• def prod_cos.go
• def prod_cos
• def dtlz2_sin
• def dtlz2_fi.tail
• def dtlz2_fiC# Dtlz2Problem: (1+g) * prod_{j<M-i-1} cos(x[j] π/2) [* sin(x[M-i-1] π/2) if i>0].
• def dtlz2_fs.go
• def dtlz2_f
• def prod_xs.go
• def prod_xs
• def dtlz1_scale
• def dtlz1_fiC# Dtlz1Problem: 0.5*(1+g) * prod_{j<M-i-1} x[j] [* (1-x[M-i-1]) if i>0].
• def dtlz1_fs.go
• def dtlz1_f
• def nn_objF32 cos(π/2) is -4.371139e-8, not 0.
• def nn_objs
• def dtlz3_fC# Dtlz3Problem: DTLZ2 map with DTLZ1's g.
• def map_prefix_pow.goFuel shrinks first so the recursive call terminates.
• def map_prefix_powRaise the first `fuel` decision variables to α.
• def dtlz4_fC# Dtlz4Problem: DTLZ2 with x^α inside the sine/cosine map.
• def pos_or.fin
• def pos_or
• def dtlz7_gC# Dtlz7Problem g: 1 + 9 * sum(x[M-1..]) / (n - M + 1).
• def dtlz7_h.go
• def dtlz7_prefix
• def dtlz7_ff[i]=x[i] for i<M-1; f[M-1]=(1+g)*h; h = M - Σ f_i/(1+g) * (1+sin(3 π f_i)).
• def sum_sq
• def sphere_f
• type Acc2
• def ackley_go
• def ackley_den
• def ackley_from
• def ackley_fC# AckleyProblem.
• def rosen_step
• def rosenbrock_f
• type ScoredObjectives plus g ≤ 0.
• def plain
• def scored_f
• def scored_g
• def osy_fC# OsyProblem.
• def osy_gpymoo divisors, then negated so a positive value is a violation.
• def osy_score
• def tnk_gC# TnkProblem.
• def tnk_score
• def c1_wLast objective / 0.6, earlier objectives / 0.5.
• def c1_g
• def c1_score
• def eval_kind
• def apply_score
• def evaluate
• def evaluate_allIndependent per individual.

reference_directions.bend

• def binomial
• def count.succ
• def count.go
• def countNumber of Das–Dennis points.
• def to_dir
• def to_dirs
• type DasCtxk-th composition of `p` into `m` parts, C# DFS order (first coord increases 0..p).
• def nth_comp.fallback
• def nth_comp.go
• def nth_comp
• def nth_row
• def comps_all
• def das_dennis.from
• def das_dennis.p0
• def das_dennisGenerate directions.

rng.bend

• type State
• def new
• def from_nat
• def seed_of
• def last_double