Free cookie consent management tool by TermsFeed Policy Generator

source: branches/OKBJavaConnector/ECJClient/src/ec/app/moosuite/moosuite.params @ 11194

Last change on this file since 11194 was 6152, checked in by bfarka, 14 years ago

added ecj and custom statistics to communicate with the okb services #1441

File size: 1.6 KB
Line 
1# Copyright 2006 by Sean Luke and George Mason University
2# Licensed under the Academic Free License version 3.0
3# See the file "LICENSE" for more information
4
5#uncomment the desired multiobjective algorithm
6#parent.0 = spea2.params
7parent.0 = nsga2.params
8
9eval.problem = ec.app.moosuite.MooSuite
10
11#
12# optionally your type could be: zdt1, zdt2, zdt3, zdt4, zdt6, sphere
13#
14# Different problems has different default settings, so we suggest
15# using the appropriate params file for each benchmark.
16
17pop.subpop.0.species = ec.vector.FloatVectorSpecies
18pop.subpop.0.species.ind = ec.vector.DoubleVectorIndividual
19pop.subpop.0.species.fitness.num-objectives = 2
20pop.subpop.0.species.fitness.maximize = false
21seed.0 = time
22
23
24# Uncomment this if you'd like to force reevaluation of all archive
25# members each generation.
26#
27# breed.reevaluate-elites.0 = true
28
29
30# The multiobjective optimization routines here can use any crossover
31# and mutation pipeline you like, but the literature tends to stick with
32# SBX for crossover and Polynomial Mutation.  And with good reason: our
33# tests indicate that Polynomial Mutation is much better than Gaussian of
34# any setting for these problems.  And for SPEA2 at least, SBX seems to
35# outperform most other crossover operators.  Note that we're using the
36# "bounded" Polynomial Mutation variant, which seems to do a bit better.
37
38pop.subpop.0.species.crossover-type = sbx
39pop.subpop.0.species.crossover-distribution-index = 20
40
41pop.subpop.0.species.mutation-type = polynomial
42pop.subpop.0.species.mutation-distribution-index = 20
43pop.subpop.0.species.mutation-bounded = true
44
Note: See TracBrowser for help on using the repository browser.