static List<ExperimentAlgorithm<DoubleSolution, List<DoubleSolution>>> configureAlgorithmList(
          List<ExperimentProblem<DoubleSolution>> problemList) {
    List<ExperimentAlgorithm<DoubleSolution, List<DoubleSolution>>> algorithms = new ArrayList<>();

      for (int run = 0; run < INDEPENDENT_RUNS; run++) {
        for (int i = 0; i < problemList.size(); i++) {
          Algorithm<List<DoubleSolution>> algorithm = new NSGAIIBuilder<>(
                  problemList.get(i).getProblem(),
                  new SBXCrossover(1.0, 5),
                  new PolynomialMutation(1.0 / problemList.get(i).getProblem().getNumberOfVariables(), 10.0),
                  100)
                  .setMaxEvaluations(25000)
                  .build();
          algorithms.add(new ExperimentAlgorithm<>(algorithm, "NSGAIIa", problemList.get(i),run));
        }

        for (int i = 0; i < problemList.size(); i++) {
          Algorithm<List<DoubleSolution>> algorithm = new NSGAIIBuilder<>(
                  problemList.get(i).getProblem(),
                  new SBXCrossover(1.0, 20.0),
                  new PolynomialMutation(1.0 / problemList.get(i).getProblem().getNumberOfVariables(), 20.0),
                  100)
                  .setMaxEvaluations(25000)
                  .build();
          algorithms.add(new ExperimentAlgorithm<>(algorithm, "NSGAIIb", problemList.get(i),run));
        }

        for (int i = 0; i < problemList.size(); i++) {
          Algorithm<List<DoubleSolution>> algorithm = new NSGAIIBuilder<>(problemList.get(i).getProblem(), new SBXCrossover(1.0, 40.0),
                  new PolynomialMutation(1.0 / problemList.get(i).getProblem().getNumberOfVariables(), 40.0),
                  10)
                  .setMaxEvaluations(25000)
                  .build();
          algorithms.add(new ExperimentAlgorithm<>(algorithm, "NSGAIIc", problemList.get(i),run));
        }

        for (int i = 0; i < problemList.size(); i++) {
          Algorithm<List<DoubleSolution>> algorithm = new NSGAIIBuilder<>(problemList.get(i).getProblem(), new SBXCrossover(1.0, 80.0),
                  new PolynomialMutation(1.0 / problemList.get(i).getProblem().getNumberOfVariables(), 80.0),
                  100)
                  .setMaxEvaluations(25000)
                  .build();
          algorithms.add(new ExperimentAlgorithm<>(algorithm, "NSGAIId", problemList.get(i),run));
        }
      }
    return algorithms;
  }
static List < ExperimentAlgorithm < DoubleSolution , List < DoubleSolution > > > configureAlgorithmList ( List < ExperimentProblem < DoubleSolution > > problemList ) { List < ExperimentAlgorithm < DoubleSolution , List < DoubleSolution > > > algorithms = new ArrayList < > ( ) ; for ( int run = 0 ; run < INDEPENDENT_RUNS ; run ++ ) { for ( int i = 0 ; i < problemList . size ( ) ; i ++ ) { Algorithm < List < DoubleSolution > > algorithm = new NSGAIIBuilder < > ( problemList . get ( i ) . getProblem ( ) , new SBXCrossover ( 1.0 , 5 ) , new PolynomialMutation ( 1.0 / problemList . get ( i ) . getProblem ( ) . getNumberOfVariables ( ) , 10.0 ) , 100 ) . setMaxEvaluations ( 25000 ) . build ( ) ; algorithms . add ( new ExperimentAlgorithm < > ( algorithm , "NSGAIIa" , problemList . get ( i ) , run ) ) ; } for ( int i = 0 ; i < problemList . size ( ) ; i ++ ) { Algorithm < List < DoubleSolution > > algorithm = new NSGAIIBuilder < > ( problemList . get ( i ) . getProblem ( ) , new SBXCrossover ( 1.0 , 20.0 ) , new PolynomialMutation ( 1.0 / problemList . get ( i ) . getProblem ( ) . getNumberOfVariables ( ) , 20.0 ) , 100 ) . setMaxEvaluations ( 25000 ) . build ( ) ; algorithms . add ( new ExperimentAlgorithm < > ( algorithm , "NSGAIIb" , problemList . get ( i ) , run ) ) ; } for ( int i = 0 ; i < problemList . size ( ) ; i ++ ) { Algorithm < List < DoubleSolution > > algorithm = new NSGAIIBuilder < > ( problemList . get ( i ) . getProblem ( ) , new SBXCrossover ( 1.0 , 40.0 ) , new PolynomialMutation ( 1.0 / problemList . get ( i ) . getProblem ( ) . getNumberOfVariables ( ) , 40.0 ) , 10 ) . setMaxEvaluations ( 25000 ) . build ( ) ; algorithms . add ( new ExperimentAlgorithm < > ( algorithm , "NSGAIIc" , problemList . get ( i ) , run ) ) ; } for ( int i = 0 ; i < problemList . size ( ) ; i ++ ) { Algorithm < List < DoubleSolution > > algorithm = new NSGAIIBuilder < > ( problemList . get ( i ) . getProblem ( ) , new SBXCrossover ( 1.0 , 80.0 ) , new PolynomialMutation ( 1.0 / problemList . get ( i ) . getProblem ( ) . getNumberOfVariables ( ) , 80.0 ) , 100 ) . setMaxEvaluations ( 25000 ) . build ( ) ; algorithms . add ( new ExperimentAlgorithm < > ( algorithm , "NSGAIId" , problemList . get ( i ) , run ) ) ; } } return algorithms ; }
The algorithm list is composed of pairs {@link Algorithm} + {@link Problem} which form part of
a {@link ExperimentAlgorithm}, which is a decorator for class {@link Algorithm}. The {@link
ExperimentAlgorithm} has an optional tag component, that can be set as it is shown in this example,
where four variants of a same algorithm are defined.