nsga2R: Elitist Non-Dominated Sorting Genetic Algorithm

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. The methods are described in Deb et al. (2002) <doi:10.1109/4235.996017>.

Version:	1.1
Depends:	mco
Published:	2022-05-23
DOI:	10.32614/CRAN.package.nsga2R
Author:	Ching-Shih (Vince) Tsou
Maintainer:	Ming-Chang (Alan) Lee <alan9956 at ydu.edu.tw>
License:	LGPL-3
NeedsCompilation:	no
CRAN checks:	nsga2R results

Documentation:

Reference manual:

nsga2R.html , nsga2R.pdf

Downloads:

Package source:	nsga2R_1.1.tar.gz
Windows binaries:	r-devel: nsga2R_1.1.zip, r-release: nsga2R_1.1.zip, r-oldrel: nsga2R_1.1.zip
macOS binaries:	r-release (arm64): nsga2R_1.1.tgz, r-oldrel (arm64): nsga2R_1.1.tgz, r-release (x86_64): nsga2R_1.1.tgz, r-oldrel (x86_64): nsga2R_1.1.tgz
Old sources:	nsga2R archive

Reverse dependencies:

Reverse imports:

GSgalgoR, MaOEA, mfpp, moc.gapbk, stablespec

Linking:

Please use the canonical form https://CRAN.R-project.org/package=nsga2R to link to this page.