Non Sorting Genetic Algorithm II (NSGA-II)

Bearable and compressed implementation of Non Sorting Genetic Algorithm II (NSGA-II)

This function performs a Non Sorting Genetic Algorithm II (NSGA-II) for minimizing continuous functions. The implementation is bearable, computationally cheap, and compressed (the algorithm only requires one file: NSGAIII.m). An 'example.m' script is provided in order to help users to use the implementation. It is also noteworthy to mention that the code is highly commented for easing the understanding. This implementation is based on the paper of Deb et al. (2002), "A fast and elitist multiobjective genetic algorithm: NSGA-II".