Multiobjective algorithms¶
dNSGA-II¶
-
pym2sa.algorithm.multiobjective.dnsgaii.R¶
-
pym2sa.algorithm.multiobjective.dnsgaii.create_new_solution(problem)¶
-
class
pym2sa.algorithm.multiobjective.dnsgaii.dNSGAII(population_size: int, problem: jmetal.core.problem.Problem[S], max_evaluations: int, mutation: jmetal.core.operator.Mutation[S], crossover: jmetal.core.operator.Crossover[S, S], selection: jmetal.core.operator.Selection[typing.List[S], S], number_of_cores: int, client: <Mock name='mock.Client' id='139876483885656'>)¶ Bases:
jmetal.core.algorithm.Algorithm-
create_initial_population() → typing.List[S]¶
-
get_name() → str¶
-
get_result()¶
-
run()¶
-
update_progress(population)¶
-
-
pym2sa.algorithm.multiobjective.dnsgaii.reproduction(population: typing.List[S], problem: jmetal.core.problem.Problem[S], crossover_operator: jmetal.core.operator.Crossover[S, S], mutation_operator: jmetal.core.operator.Mutation[S]) → S¶ Cross and mutate a list of solutions and return an individual (whichever scores better attending to one objective).