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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.1 |
rolling linux/jammy R-4.5 | nsga2R_1.1.tar.gz |
37.5 KiB |
1.1 |
rolling linux/noble R-4.5 | nsga2R_1.1.tar.gz |
37.5 KiB |
1.1 |
rolling source/ R- | nsga2R_1.1.tar.gz |
6.5 KiB |
1.1 |
latest linux/jammy R-4.5 | nsga2R_1.1.tar.gz |
37.5 KiB |
1.1 |
latest linux/noble R-4.5 | nsga2R_1.1.tar.gz |
37.5 KiB |
1.1 |
latest source/ R- | nsga2R_1.1.tar.gz |
6.5 KiB |
1.1 |
2026-04-26 source/ R- | nsga2R_1.1.tar.gz |
6.5 KiB |
1.1 |
2026-04-23 source/ R- | nsga2R_1.1.tar.gz |
6.5 KiB |
1.1 |
2026-04-09 windows/windows R-4.5 | nsga2R_1.1.zip |
40.3 KiB |
1.1 |
2025-04-20 source/ R- | nsga2R_1.1.tar.gz |
6.5 KiB |