CRAN

nsga2R 1.0

Elitist Non-dominated Sorting Genetic Algorithm based on R

Released Jun 16, 2013 by Ming-Chang (Alan) Lee

Dependencies

mco 1.0.13

This package provide functions for box-constrained multiobjective optimization using the elitist non-dominated sorting genetic algorithm - NSGA-II. Fast non-dominated sorting, crowding distance, tournament selection, simulated binary crossover, and polynomial mutation are called in the main program, nsga2R, to complete the search.

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>nsga2R</artifactId>
    <version>1.0-b241</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:nsga2R')

Test Results

This package was last tested against Renjin 0.9.2644 on Jun 2, 2018.

• boundedPolyMutation-examples
• boundedSBXover-examples
• crowdingDist4frnt-examples
• fastNonDominatedSorting-examples
• nsga2R-examples
• tournamentSelection-examples

Source

View GitHub Mirror

Release History

• 1.0